next Monday's Lecture and Colloquium will take place

Please find link to Zoom Meeting here:

__Location__**: **

__Monday's Lecture__: María A. Hernández Cifre (Universitdad
de Murcia)

__Time__: **Monday, January 17 - 14:15 h**

__Title__: On discrete Brunn-Minkowski type inequalities

The classical Brunn-Minkowski inequality in the n-dimensional Euclidean space asserts that the volume (Lebesgue measure) to the power 1/n is a concave functional when dealing with convex bodies (non-empty compact convex sets). This result has become not only a cornerstone of the Brunn-Minkowski theory, but also a powerful tool in other related fields of mathematics.

In this talk we will make a brief walk on this inequality, as well as on its extensions to the Lp-setting, for non-negative values of p. Then, we will move to the discrete world, either considering the integer lattice endowed with the cardinality, or working with the lattice point enumerator, which provides with the number of integer points contained in a given convex body: we will discuss and show certain discrete analogues of the above mentioned Brunn-Minkowski type inequalities in both cases.

This is about joint works with Eduardo Lucas and Jesús Yepes Nicolás.

__Monday's Colloquium__: Ji Hoon Chun (Technische
Universität Berlin)

__Time__: **Monday, January 17**** - 16:00 h s.t.**

__Title__: The Sausage Conjecture in dimension 4

__Abstract__:

----------------59902AFFCF5977DBDD90F08C-- From itabrunke@zedat.fu-berlin.de Wed Jan 12 20:19:45 2022 Received: from outpost1.zedat.fu-berlin.de ([130.133.4.66]) by list1.zedat.fu-berlin.de (Exim 4.94) for facets-of-complexity@lists.fu-berlin.de with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from

next Monday's Lecture and Colloquium will take place

Please find link to Zoom Meeting here:

__Location__**: **

__Monday's Lecture__: María A. Hernández Cifre (Universitdad
de Murcia)

__Time__: **Monday, January 17 - 14:15 h**

__Title__: On discrete Brunn-Minkowski type inequalities

The classical Brunn-Minkowski inequality in the n-dimensional Euclidean space asserts that the volume (Lebesgue measure) to the power 1/n is a concave functional when dealing with convex bodies (non-empty compact convex sets). This result has become not only a cornerstone of the Brunn-Minkowski theory, but also a powerful tool in other related fields of mathematics.

In this talk we will make a brief walk on this inequality, as well as on its extensions to the Lp-setting, for non-negative values of p. Then, we will move to the discrete world, either considering the integer lattice endowed with the cardinality, or working with the lattice point enumerator, which provides with the number of integer points contained in a given convex body: we will discuss and show certain discrete analogues of the above mentioned Brunn-Minkowski type inequalities in both cases.

This is about joint works with Eduardo Lucas and Jesús Yepes Nicolás.

__Monday's Colloquium__: Ji Hoon Chun (Technische
Universität Berlin)

__Time__: **Monday, January 17**** - 16:00 h s.t.**

__Title__: The Sausage Catastrophe **in dimension 4**

__Abstract__:

----------------DDF8389FDBE11A37B741CB4E-- From itabrunke@zedat.fu-berlin.de Wed Jan 19 18:26:59 2022 Received: from outpost1.zedat.fu-berlin.de ([130.133.4.66]) by list1.zedat.fu-berlin.de (Exim 4.94) for facets-of-complexity@lists.fu-berlin.de with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from

next Monday's Lecture will take place

Please find link to Zoom Meeting here:

A password is

__Location__**: **

__Monday's Lecture__: Günter Rote (Freie Universität
Berlin)

__Time__: **Monday, January 24 - 14:15 h**

__Title__: The maximum number of minimal dominating sets in
a tree

A tree with n vertices has at most 95

We also derive an output-sensitive algorithm for listing all minimal dominating sets with linear set-up time and linear delay between successive solutions.

--------------326CB802BCCAE5BA804DFB96-- From itabrunke@zedat.fu-berlin.de Wed Jan 26 16:03:50 2022 Received: from outpost1.zedat.fu-berlin.de ([130.133.4.66]) by list1.zedat.fu-berlin.de (Exim 4.94) for facets-of-complexity@lists.fu-berlin.de with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from

next Monday's Lecture and Colloquium will take place

Please find link to Zoom Meeting here:

A password is not required!

__Location__**: **

__Monday's Lecture__: George Mertzios (Durham University)

__Time__: **Monday, January 31 - 14:15 h**

__Title__: Algorithmic Problems on Temporal Graphs

A temporal graph is a graph whose edge set changes over a sequence of discrete time steps. This can be viewed as a discrete sequence G_1, G_2, ... of static graphs, each with a fixed vertex set V. Research in this area is motivated by the fact that many modern systems are highly dynamic and relations (edges) between objects (vertices) vary with time. Although static graphs have been extensively studied for decades from an algorithmic point of view, we are still far from having a concrete set of structural and algorithmic principles for temporal graphs. Many notions and algorithms from the static case can be naturally transferred in a meaningful way to their temporal counterpart, while in other cases new approaches are needed to define the appropriate temporal notions. In particular, some problems become radically different, and often substantially more difficult, when the time dimension is additionally taken into account. In this talk we will discuss some natural but only recently introduced temporal problems and some algorithmic approaches to them.

__Monday's Colloquium__: Klaus Heeger (Technische
Universität Berlin)

__Time__: **Monday, January 31**** - 16:00 h s.t.**

__Title__: Stable Matchings Beyond Stable Marriage

__Abstract__:

----------------03D02541362135FF76D80A2C-- From itabrunke@zedat.fu-berlin.de Wed Feb 02 18:10:00 2022 Received: from outpost1.zedat.fu-berlin.de ([130.133.4.66]) by list1.zedat.fu-berlin.de (Exim 4.94) for facets-of-complexity@lists.fu-berlin.de with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from

next Monday's Lecture and Colloquium will take place

Please find link to Zoom Meeting here:

A password is not required!

__Location__**: **

__Monday's Lecture__: Neil Olver (London School of Economics
and Political Science)

__Time__: **Monday, February 7 - 14:15 h**

__Title__: Continuity, Uniqueness and Long-Term Behaviour
of Nash Flows Over Time

We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from a source to destination as quickly as possible. Flow patterns vary over time, and congestion effects are modelled via queues, which form whenever the inflow into a link exceeds its capacity. We answer some rather basic questions about equilibria in this model: in particular

To prove these results, we make a surprising connection to another question: whether, assuming constant inflow into the network at the source, do equilibria always eventually settle into a "steady state" where all queue delays change linearly forever more? Cominetti et al. proved this under an assumption that the inflow rate is not larger than the capacity of the network - eventually, queues remain constant forever. We resolve the more general question positively.

(Joint work with Leon Sering and Laura Vargas Koch).

__Monday's Colloquium__: Manuel Radons (Technische
Universität Berlin)

__Time__: **Monday, February 7**** - 16:00 h s.t.**

__Title__: Nearly flat polytopes in the context of Dürer's
problem

__Abstract__:

----------------B5D5BF46D67DC54F118CC3FD-- From itabrunke@zedat.fu-berlin.de Tue Feb 08 16:58:35 2022 Received: from outpost1.zedat.fu-berlin.de ([130.133.4.66]) by list1.zedat.fu-berlin.de (Exim 4.94) for facets-of-complexity@lists.fu-berlin.de with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from

next Monday's Lecture and Colloquium will take place

Please find link to Zoom Meeting here:

A password is not required!

__Location__**: **

__Monday's Lecture__: Carlos Amendola (Technische
Universität München)

__Time__: **Monday, February 14 - 14:15 h**

__Title__: Estimating Gaussian mixtures using sparse
polynomial moment systems

The method of moments is a statistical technique for density estimation that solves a system of moment equations to estimate the parameters of an unknown distribution. A fundamental question critical to understanding identifiability asks how many moment equations are needed to get finitely many solutions and how many solutions there are.

Since the moments of a mixture of Gaussians are polynomial expressions in the means, variances and mixture weights, one can address this question from the perspective of algebraic geometry. With the help of tools from polyhedral geometry, we answer this fundamental question for several classes of Gaussian mixture models. Furthermore, these results allow us to present an algorithm that performs parameter recovery and density estimation, applicable even in the high dimensional case.

Based on joint work with Julia Lindberg and Jose Rodriguez
(University of Wisconsin-Madison).

__Monday's Colloquium__: Marie Brandenburg (Max Planck
Institut Leipzig)

__Time__: **Monday, February 14**** - 16:00 h s.t.**

__Title__: Intersection Bodies of Polytopes

__Abstract__:

----------------28DEB4948E24B457586F0BBC--