Seminar

Title: Stretching drawings of graphs

Abstract: Given a drawing D of a graph (where vertices are dots in the plane and edges are arbitrary curves connecting some pairs of dots),

Title: Two-level polytopes

Abstract:

This talk is dedicated to two-level polytopes. On one side, two-level polytopes form a well structured family of polytopes.

Title: Minimization of convex compositions

Abstract:

Numerous optimization tasks can be posed as minimization of a finite convex function composed with a smooth map. Phase retrieval and matrix factorization problems are common examples.

Title: The price of connectivity for domination

Abstract: The price of connectivity for dominating set in a graph G is the ratio between the minimum sizes of a connected dominating set and a dominating set of G.

Title: Distributed coloring in planar graphs

Abstract:

We are concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar graphs can be colored with at most 4 colors, and the proof gives a (sequential) quadratic algorithm finding such a coloring.

Title: Hamilton cycles in cubic planar graphs

Abstract: Tait conjectured in 1884 that each cubic planar graph contains a Hamilton cycle. Had the conjecture been true,

Title: On isogeny graphs of supersingular elliptic curves over finite fields- Part 2

 Abstract: After having defined the supersingular isogeny graph, in this second talk

Title: Online Learning of Quantum States

Abstract:

Suppose we have many copies of an unknown n-qubit state rho. We measure some copies of rho using a known two-outcome measurement E_1, then other copies using a measurement E_2, and so on.

Title: A single pass bijection between certain quarter plane lattice walks and certain Motzkin-like paths.

Abstract: A p-tandem quarter plane walk is a walk starting at the origin and remaining in the first quadrant

Title: All Graphs are Beautiful

Abstract: In this talk I will show that all graphs are beautiful. The proof is by induction on g