[Facets-of-complexity] Invitation and link to Monday Lecture and Colloquium - February 22nd 2021 - online via zoom

[Ita Brunke <i.brunke@inf.fu-berlin.de>]

You are cordially invited to our last Monday Lecture and Colloquium of winter term 2020/21.

You may find valid Invitation for zoom throughout all winter term here:
http://www.facetsofcomplexity.de/monday/WS-2020-21/index.html

Invitation link:
https://tu-berlin.zoom.us/j/69716124232?pwd=dzFlcTFHMmFXRTE5QmZLaEV5N0FRUT09

Monday Lecture and Colloquium will be on February 22nd 2021 at 14:15 h and 16:00 h s.t. !

Online via:
Zoom - Invitation

Time: Monday, February 22nd - 14:15 h

Lecture: Peter Bürgisser (Technische Universität Berlin)

Title: Optimization, Complexity and Invariant Theory

Abstract:

Invariant and representation theory studies symmetries by means of group actions and is a well established source of unifying principles in mathematics and physics. Recent research suggests its relevance for complexity and optimization through quantitative and algorithmic questions. The goal of the lecture is to give an introduction to new algorithmic and analysis techniques that extend convex optimization from the classical Euclidean setting to a general geodesic setting. We also point out surprising connections to a diverse set of problems in different areas of mathematics, statistics, computer science, and physics. The lecture is mainly based on this joint article with Cole Franks, Ankit Garg, Rafael Oliveira, Michael Walter and Avi Wigderson: http://arxiv.org/abs/1910.12375

Time: Monday, February 22nd - 16:00 h s.t.

Colloquium: Joanna Lada (Merton College Oxford)

Title: On colour-bias Hamilton cycles in dense graphs

Abstract:

The study of colour-biased structures in graphs concerns the following problem: given graphs H and G , what is the largest t such that, in any r-colouring of the edges of G, there is always a copy of H in G having at least t edges of the same colour?  In this talk, we present a generalisation of a recent result of Balogh, Csaba, Jing and Pluhár (2020) establishing the minimum degree threshold that ensures a 2-coloured graph G contains a Hamilton cycle H of a specified colour bias. We obtain the corresponding tight threshold for r-coloured graphs.  This is joint work with Andrea Freschi, Joseph Hyde, and Andrew Treglown (Birmingham).