From itabrunke@zedat.fu-berlin.de Wed Jan 06 14:40:34 2021 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 ) id 1kx93C-004A26-Ch; Wed, 06 Jan 2021 14:40:34 +0100 Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69]) by outpost.zedat.fu-berlin.de (Exim 4.94) with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from ) id 1kx939-003BsV-8i; Wed, 06 Jan 2021 14:40:30 +0100 Received: from ip5f5af20b.dynamic.kabel-deutschland.de ([95.90.242.11] helo=[192.168.0.2]) by inpost2.zedat.fu-berlin.de (Exim 4.94) with esmtpsa (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 (envelope-from ) id 1kx938-000hky-DB; Wed, 06 Jan 2021 14:40:30 +0100 From: Ita Brunke To: facets-of-complexity@lists.fu-berlin.de Message-ID: <8d9b910f-fe3b-5986-95e6-1c70f1a7874e@inf.fu-berlin.de> Date: Wed, 6 Jan 2021 14:40:30 +0100 User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:52.0) Gecko/20100101 Firefox/52.0 SeaMonkey/2.49.5 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="------------8D0C11A24ACF4AA124B4876E" X-Original-Sender: i.brunke@inf.fu-berlin.de X-Originating-IP: 95.90.242.11 X-ZEDAT-Hint: A X-purgate: clean X-purgate-type: clean X-purgate-ID: 151147::1609940434-000B6607-5D530ED9/0/0 X-Bogosity: Ham, tests=bogofilter, spamicity=0.184287, version=1.2.4 X-Spam-Flag: NO X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE X-Spam-Checker-Version: SpamAssassin 3.4.4 on Vanuatu.ZEDAT.FU-Berlin.DE X-Spam-Level: Subject: [Facets-of-complexity] Invitation and link to Monday Lecture - January 11th 2021 - online via zoom X-BeenThere: facets-of-complexity@lists.fu-berlin.de X-Mailman-Version: 2.1.29 Precedence: list List-Id: announcements of Monday lectures and other events List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 06 Jan 2021 13:40:35 -0000 This is a multi-part message in MIME format. --------------8D0C11A24ACF4AA124B4876E Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit You are cordially invited to our next Monday Lecture in the New Year. Next Monday Lecture, there will be again a regular schedule. All Monday Lectures and Colloquia of winter term 2020/21 will be given online via zoom. 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 will be on *January 11th 2021* at 14:15 h & 16:00. *_Online via_: Zoom - Invitation* *_Time_: **Monday, January 11th - 14:15 h* *_Lecture_: Raman Sanyal (Goethe-Universität Frankfurt)* *_Title_: From counting lattice points to counting free segments and back* *_Abstract_:* Ehrhart theory, the art of counting lattice points in convex polytopes, is a cornerstone of the interplay of combinatorics and geometry. Many important combinatorial objects can be modelled as lattice points in polytopes and counting lattice points with respect to dilation yields deep results in combinatorics. Conversely, the combinatorics of polytopes provides a powerful framework for the computation of these counting functions with numerous algebraic/combinatorial consequnces and challenges. A lattice polytope is free if does not contain lattice points other than its vertices. Klain (1999) suggested a generalization of Ehrhart theory by counting free polytopes with $k$ vertices contained in dilates of a given polytope. For $k=1$, this is precisely Ehrhart theory. Determining these counting functions for $k > 1$ is quite challenging. For $k=2$ (free segments), this is related to counting lattice points visible from each other. In the talk I will discuss joint work with Sebastian Manecke on counting free segments in dilates of unimodular simplices. Our main tool is a number-theoretic variant of Ehrhart theory which can be computed using classical results from geometry. The talk will be scenic tour (with impressions from the unusual summer 2020). *_Time_: **Monday, ***January 11th -* 16:00 h* *_Lecture_: Maria Dostert (Royal Institute of Technology)* *_Title_: Exact semidefinite programming bounds for packing problems* *_Abstract_:* In the first part of the talk, I present how semidefinite programming methods can provide upper bounds for various geometric packing problems, such as kissing numbers, spherical codes, or packings of spheres into a larger sphere. When these bounds are sharp, they give additional information on optimal configurations, that may lead to prove the uniqueness of such packings. For example, we show that the lattice /E/_8  is the unique solution for the kissing number problem on the hemisphere in dimension 8. However, semidefinite programming solvers provide approximate solutions, and some additional work is required to turn them into an exact solution, giving a certificate that the bound is sharp. In the second part of the talk, I explain how, via our rounding procedure, we can obtain an exact rational solution of a semidefinite program from an approximate solution in floating point given by the solver. This is a joined work with David de Laat and Philippe Moustrou. --------------8D0C11A24ACF4AA124B4876E Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: 8bit

You are cordially invited to our next Monday Lecture in the New Year. Next Monday Lecture, there will be again a regular schedule.

All Monday Lectures and Colloquia of winter term 2020/21 will be given online via zoom.

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 will be on January 11th 2021 at 14:15 h & 16:00.

Online via:
Zoom - Invitation

Time: Monday, January 11th - 14:15 h

Lecture: Raman Sanyal (Goethe-Universität Frankfurt)

Title: From counting lattice points to counting free segments and back

Abstract:

Ehrhart theory, the art of counting lattice points in convex polytopes, is a cornerstone of the interplay of combinatorics and geometry. Many important combinatorial objects can be modelled as lattice points in polytopes and counting lattice points with respect to dilation yields deep results in combinatorics. Conversely, the combinatorics of polytopes provides a powerful framework for the computation of these counting functions with numerous algebraic/combinatorial consequnces and challenges. A lattice polytope is free if does not contain lattice points other than its vertices. Klain (1999) suggested a generalization of Ehrhart theory by counting free polytopes with $k$ vertices contained in dilates of a given polytope. For $k=1$, this is precisely Ehrhart theory. Determining these counting functions for $k > 1$ is quite challenging. For $k=2$ (free segments), this is related to counting lattice points visible from each other. In the talk I will discuss joint work with Sebastian Manecke on counting free segments in dilates of unimodular simplices. Our main tool is a number-theoretic variant of Ehrhart theory which can be computed using classical results from geometry. The talk will be scenic tour (with impressions from the unusual summer 2020).

Time: Monday, January 11th - 16:00 h

Lecture: Maria Dostert (Royal Institute of Technology)

Title: Exact semidefinite programming bounds for packing problems

Abstract:

In the first part of the talk, I present how semidefinite programming methods can provide upper bounds for various geometric packing problems, such as kissing numbers, spherical codes, or packings of spheres into a larger sphere. When these bounds are sharp, they give additional information on optimal configurations, that may lead to prove the uniqueness of such packings. For example, we show that the lattice E8 is the unique solution for the kissing number problem on the hemisphere in dimension 8. However, semidefinite programming solvers provide approximate solutions, and some additional work is required to turn them into an exact solution, giving a certificate that the bound is sharp. In the second part of the talk, I explain how, via our rounding procedure, we can obtain an exact rational solution of a semidefinite program from an approximate solution in floating point given by the solver. This is a joined work with David de Laat and Philippe Moustrou. --------------8D0C11A24ACF4AA124B4876E-- From rote@zedat.fu-berlin.de Sun Jan 10 14:25:15 2021 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 ) id 1kyaiV-0022CG-Ol; Sun, 10 Jan 2021 14:25:11 +0100 Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69]) by outpost.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 ) id 1kyaiW-000A6q-29; Sun, 10 Jan 2021 14:25:11 +0100 Received: from dslb-178-005-236-107.178.005.pools.vodafone-ip.de ([178.5.236.107] helo=[192.168.178.44]) by inpost2.zedat.fu-berlin.de (Exim 4.94) for facets-of-complexity@lists.fu-berlin.de with esmtpsa (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 (envelope-from ) id 1kyaiV-003owG-9c; Sun, 10 Jan 2021 14:25:11 +0100 To: facets-of-complexity@lists.fu-berlin.de References: <6b9c8752-1041-3423-5c11-1efc230f9667@inf.fu-berlin.de> From: =?UTF-8?Q?G=c3=bcnter_Rote?= Message-ID: Date: Sun, 10 Jan 2021 14:25:06 +0100 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.10.0 MIME-Version: 1.0 In-Reply-To: <6b9c8752-1041-3423-5c11-1efc230f9667@inf.fu-berlin.de> Content-Type: text/plain; charset=utf-8; format=flowed Content-Language: en-US Content-Transfer-Encoding: 7bit X-Original-Sender: rote@inf.fu-berlin.de X-Originating-IP: 178.5.236.107 X-purgate: clean X-purgate-type: clean X-purgate-ID: 151147::1610285111-0004243B-178C9F6C/0/0 X-Bogosity: Ham, tests=bogofilter, spamicity=0.216568, version=1.2.4 X-Spam-Flag: NO X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED X-Spam-Checker-Version: SpamAssassin 3.4.4 on Tuvalu.ZEDAT.FU-Berlin.DE X-Spam-Level: Subject: [Facets-of-complexity] Invitation to Monday Colloquium - January 11th 2021, 4 p.m. X-BeenThere: facets-of-complexity@lists.fu-berlin.de X-Mailman-Version: 2.1.29 Precedence: list List-Id: announcements of Monday lectures and other events List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 10 Jan 2021 13:25:15 -0000 Tomorrow, there will be only a Monday *Colloquium* at 16:00. The Lecture at 14:15 by Raman Sanyal (From counting lattice points to counting free segments and back) had to be canceled and will be given at a later time. Invitation link: https://tu-berlin.zoom.us/j/69716124232?pwd=dzFlcTFHMmFXRTE5QmZLaEV5N0FRUT09 Time: Monday, Jan 11, 2021 - 16:00 h s.t. Colloquium: Maria Dostert (Royal Institute of Technology, Stockholm): Exact semidefinite programming bounds for packing problems In the first part of the talk, I present how semidefinite programming methods can provide upper bounds for various geometric packing problems, such as kissing numbers, spherical codes, or packings of spheres into a larger sphere. When these bounds are sharp, they give additional information on optimal configurations that may lead to prove the uniqueness of such packings. For example, we show that the lattice E8 is the unique solution for the kissing number problem on the hemisphere in dimension 8. However, semidefinite programming solvers provide approximate solutions, and some additional work is required to turn them into an exact solution, giving a certificate that the bound is sharp. In the second part of the talk, I explain how, via our rounding procedure, we can obtain an exact rational solution of a semidefinite program from an approximate solution in floating point given by the solver. This is joint work with David de Laat and Philippe Moustrou. http://www.facetsofcomplexity.de/monday/WS-2020-21/index.html From itabrunke@zedat.fu-berlin.de Mon Jan 11 15:22:23 2021 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 ) id 1kyy5L-003gal-IY; Mon, 11 Jan 2021 15:22:19 +0100 Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69]) by outpost.zedat.fu-berlin.de (Exim 4.94) with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from ) id 1kyy5G-003u5m-H7; Mon, 11 Jan 2021 15:22:14 +0100 Received: from ip5f5af230.dynamic.kabel-deutschland.de ([95.90.242.48] helo=[192.168.0.2]) by inpost2.zedat.fu-berlin.de (Exim 4.94) with esmtpsa (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 (envelope-from ) id 1kyy5F-002U0R-NZ; Mon, 11 Jan 2021 15:22:14 +0100 From: Ita Brunke To: facets-of-complexity@lists.fu-berlin.de Cc: Florian Frick , blagojevic@math.fu-berlin.de Message-ID: <4fc4daac-05b1-5749-e4b6-b3b9de852b62@inf.fu-berlin.de> Date: Mon, 11 Jan 2021 15:22:14 +0100 User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:52.0) Gecko/20100101 Firefox/52.0 SeaMonkey/2.49.5 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="------------056DD9773840A9D917BBB1CF" X-Original-Sender: i.brunke@inf.fu-berlin.de X-Originating-IP: 95.90.242.48 X-ZEDAT-Hint: A X-purgate: clean X-purgate-type: clean X-purgate-ID: 151147::1610374939-0009846C-E5688CA8/0/0 X-Bogosity: Ham, tests=bogofilter, spamicity=0.000001, version=1.2.4 X-Spam-Flag: NO X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE X-Spam-Checker-Version: SpamAssassin 3.4.4 on Kiribati.ZEDAT.FU-Berlin.DE X-Spam-Level: Subject: [Facets-of-complexity] Invitation and link to Monday Lecture - January 18th 2021 - online via zoom X-BeenThere: facets-of-complexity@lists.fu-berlin.de X-Mailman-Version: 2.1.29 Precedence: list List-Id: announcements of Monday lectures and other events List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 11 Jan 2021 14:22:24 -0000 This is a multi-part message in MIME format. --------------056DD9773840A9D917BBB1CF Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit You are cordially invited to our next Monday Lecture in the New Year. All Monday Lectures and Colloquia of winter term 2020/21 will be given online via zoom. 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 will be on *January 18th 2021* at 14:15 h & 16:00. *_Online via_: Zoom - Invitation* *_Time_: **Monday, January 18th - 14:15 h* *_Lecture_: Florian Frick (Carnegie Mellon University)* *_Title_: New applications of the Borsuk--Ulam theorem* *_Abstract_:* The classical Borsuk--Ulam theorem states that any continuous map from the d-sphere to d-space identifies two antipodal points. Over the last 90 years numerous applications of this result across mathematics have been found. I will survey some recent progress, such as results about the structure of zeros of trigonometric polynomials, which are related to convexity properties of circle actions on Euclidean space, a proof of a 1971 conjecture that any closed spatial curve inscribes a parallelogram, and finding well-behaved smooth functions to the unit circle in any closed finite codimension subspace of square-intergrable complex functions. *_Time_: **Monday, ***January 18th -* 16:00 h* *_Lecture_: Pavle Blagojević (Freie Universität Berlin)* *_Title_: Ten years in one lecture* *_Abstract_:* Ten years ago, in February 2011, I joined the group of Günter M. Ziegler at Freie Universität Berlin. Now, ten years later, I will show you some of the problems in Geometric and Topological Combinatorics that intrigued us, some of which we managed to solve, and sketch some of the crucial ideas, methods, and the tools we had to develop in order to answer them. We will see how -- work on the Bárány-Larman conjecture on colored point sets in the plane   gave birth to the Optimal colored Tverberg theorem, -- the constraint method collected all classical Tverberg type results under one roof    and opened a door towards counter-examples to the topological Tverberg conjecture. Furthermore, we will illustrate how the search for convex partitions of a polygon into pieces of equal area and equal perimeter forced us to -- study the topology of the classical configuration spaces, -- construct equivariant cellular models for them, -- prove a new version of an equivariant Goresky-MacPherson formula for complements of arrangements, -- revisit a classical vanishing theorem of Frederick Cohen, and explain why these answers are related to the existence of highly regular embeddings and periodic billiard trajectories. Finally, we will talk about -- equi-partitions of convex bodies by affine hyperplanes, and -- greedy convex partitions of many measures. These results are joint work with, in chronological order, Günter M. Ziegler, Benjamin Matschke, Florian Frick, Albert Haase, Nevena Palić, Günter Rote, and Johanna K. Steinmeyer. --------------056DD9773840A9D917BBB1CF Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: 8bit

You are cordially invited to our next Monday Lecture in the New Year. 

All Monday Lectures and Colloquia of winter term 2020/21 will be given online via zoom.

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 will be on January 18th 2021 at 14:15 h & 16:00.

Online via:
Zoom - Invitation

Time: Monday, January 18th - 14:15 h

Lecture: Florian Frick (Carnegie Mellon University)

Title: New applications of the Borsuk--Ulam theorem

Abstract:

The classical Borsuk--Ulam theorem states that any continuous map from the d-sphere to d-space identifies two antipodal points. Over the last 90 years numerous applications of this result across mathematics have been found. I will survey some recent progress, such as results about the structure of zeros of trigonometric polynomials, which are related to convexity properties of circle actions on Euclidean space, a proof of a 1971 conjecture that any closed spatial curve inscribes a parallelogram, and finding well-behaved smooth functions to the unit circle in any closed finite codimension subspace of square-intergrable complex functions.

Time: Monday, January 18th - 16:00 h

Lecture: Pavle Blagojević (Freie Universität Berlin)

Title: Ten years in one lecture

Abstract:

Ten years ago, in February 2011, I joined the group of Günter M. Ziegler at Freie Universität Berlin. Now, ten years later, I will show you some of the problems in Geometric and Topological Combinatorics that intrigued us, some of which we managed to solve, and sketch some of the crucial ideas, methods, and the tools we had to develop in order to answer them. 


We will see how 

-- work on the Bárány-Larman conjecture on colored point sets in the plane   gave birth to the Optimal colored Tverberg theorem, 

-- the constraint method collected all classical Tverberg type results under one roof    and opened a door towards counter-examples to the topological Tverberg conjecture.


Furthermore, we will illustrate how the search for convex partitions of a polygon into pieces of equal area and equal perimeter forced us to 

-- study the topology of the classical configuration spaces, 

-- construct equivariant cellular models for them, 

-- prove a new version of an equivariant Goresky-MacPherson formula for complements of arrangements, 

-- revisit a classical vanishing theorem of Frederick Cohen, and explain why these answers are related to the existence of highly regular embeddings and periodic billiard trajectories.


Finally, we will talk about 

-- equi-partitions of convex bodies by affine hyperplanes, and 

-- greedy convex partitions of many measures.

These results are joint work with, in chronological order, Günter M. Ziegler, Benjamin Matschke, Florian Frick, Albert Haase, Nevena Palić, Günter Rote, and Johanna K. Steinmeyer.

--------------056DD9773840A9D917BBB1CF-- From itabrunke@zedat.fu-berlin.de Wed Jan 20 16:07:22 2021 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 ) id 1l2F4r-001MJA-Hm; Wed, 20 Jan 2021 16:07:21 +0100 Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69]) by outpost.zedat.fu-berlin.de (Exim 4.94) with esmtps (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (envelope-from ) id 1l2F4q-002ZW3-It; Wed, 20 Jan 2021 16:07:20 +0100 Received: from ip5f5af4c8.dynamic.kabel-deutschland.de ([95.90.244.200] helo=[192.168.0.2]) by inpost2.zedat.fu-berlin.de (Exim 4.94) with esmtpsa (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 (envelope-from ) id 1l2F4p-002fW3-Qt; Wed, 20 Jan 2021 16:07:20 +0100 From: Ita Brunke To: facets-of-complexity@lists.fu-berlin.de, Matthias Beck , klimm@tu-berlin.de Message-ID: <835635da-e3ea-57fd-6412-7e5a6227bae9@inf.fu-berlin.de> Date: Wed, 20 Jan 2021 16:07:20 +0100 User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:52.0) Gecko/20100101 Firefox/52.0 SeaMonkey/2.49.5 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="------------933F1EA01D758D5D6CCE2D5E" X-Original-Sender: i.brunke@inf.fu-berlin.de X-Originating-IP: 95.90.244.200 X-ZEDAT-Hint: A X-purgate: clean X-purgate-type: clean X-purgate-ID: 151147::1611155241-0000FB61-BC196BA2/0/0 X-Bogosity: Ham, tests=bogofilter, spamicity=0.000000, version=1.2.4 X-Spam-Flag: NO X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE X-Spam-Checker-Version: SpamAssassin 3.4.4 on Palau.ZEDAT.FU-Berlin.DE X-Spam-Level: Subject: [Facets-of-complexity] Invitation and link to Monday Lectures - January 25th 2021 - online via zoom X-BeenThere: facets-of-complexity@lists.fu-berlin.de X-Mailman-Version: 2.1.29 Precedence: list List-Id: announcements of Monday lectures and other events List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 20 Jan 2021 15:07:22 -0000 This is a multi-part message in MIME format. --------------933F1EA01D758D5D6CCE2D5E Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit You are cordially invited to our next Monday Lecture. Next Monday Lecture, there will be again the hearing of our next  PhD candidates. We will have*two talks* this time. Talks will be 30 min. 15 min discussions, 15 min break. All Monday Lectures and Colloquia of winter term 2020/21 will be given online via zoom. 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 will be on *January 25th 2021* at *14:15 h & 15:00* ! *_Online via_: Zoom - Invitation* *_Time_: **Monday, January 25th - 14:15 h* *_Lecture_: Michaela Borzechowski * *_Title_: One-Permutation-Discrete-Contraction is UEOPL-hard* *_Abstract_:* The complexity class Unique End of Potential Line (UEOPL) was introduced in 2018 by Fearnley et al. and contains many interesting search problems. UEOPL captures problems that have either by definition a unique solution, like the Arrival problem, or that are promised to have a unique solution by some property, like the P-Matrix linear complementary problem. Furthermore the problems in UEOPL have the property that the candidate solutions can be interpreted as an exponentially large graph which form a line, i.e. each node has in and out degree at most 1. The solution of each problem is at the end of that line. In 2017, Daskalakis, Tzamos and Zampetakis proved the problem of finding a fixpoint of a contraction map in a continuous space whose existence is guaranteed by the Banach fixed point theorem to be CLS-complete. A discrete version of the contraction problem, called One-Permutation-Discrete-Contraction, is proven to be the first UEOPL-complete problem. This proof is particularly interesting because it is currently the only one of its kind and lays the groundwork for future UEOPL-completeness proofs. This talk will provide an overview of the reduction from the problem Unique-End-of-Potential-Line to One-Permutation-Discrete-Contraction as well as correcting some errors that were done in the original paper. *_Time_: **Monday, ***January 25th -* 15:00 h* *_Lecture_: Shubhang Mittal * *_Title_: tba* *_Abstract_:* tba --------------933F1EA01D758D5D6CCE2D5E Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: 8bit

You are cordially invited to our next Monday Lecture. Next Monday Lecture, there will be again the hearing of our next  PhD candidates.

We will have two talks this time. Talks will be 30 min. 15 min discussions, 15 min break.
All Monday Lectures and Colloquia of winter term 2020/21 will be given online via zoom.

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 will be on January 25th 2021 at 14:15 h & 15:00 !

Online via:
Zoom - Invitation

Time: Monday, January 25th - 14:15 h

Lecture: Michaela Borzechowski

Title: One-Permutation-Discrete-Contraction is UEOPL-hard

Abstract:

The complexity class Unique End of Potential Line (UEOPL) was introduced in 2018 by Fearnley et al. and contains many interesting search problems.
UEOPL captures problems that have either by definition a unique solution, like the Arrival problem, or that are promised to have a unique solution by some property, like the P-Matrix linear complementary problem.
Furthermore the problems in UEOPL have the property that the candidate solutions can be interpreted as an exponentially large graph which form a line, i.e. each node has in and out degree at most 1. The solution of each problem is at the end of that line.
In 2017, Daskalakis, Tzamos and Zampetakis proved the problem of finding a fixpoint of a contraction map in a continuous space whose existence is guaranteed by the Banach fixed point theorem to be CLS-complete.
A discrete version of the contraction problem, called One-Permutation-Discrete-Contraction, is proven to be the first UEOPL-complete problem.
This proof is particularly interesting because it is currently the only one of its kind and lays the groundwork for future UEOPL-completeness proofs.
This talk will provide an overview of the reduction from the problem Unique-End-of-Potential-Line to One-Permutation-Discrete-Contraction as well as correcting some errors that were done in the original paper.

Time: Monday, January 25th - 15:00 h

Lecture: Shubhang Mittal

Title: tba

Abstract:

tba
--------------933F1EA01D758D5D6CCE2D5E-- From itabrunke@zedat.fu-berlin.de Sun Jan 31 22:16:32 2021 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 ) id 1l6K55-003ztc-Gg; Sun, 31 Jan 2021 22:16:27 +0100 Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69]) by outpost.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 ) id 1l6K55-000zUv-DI; Sun, 31 Jan 2021 22:16:27 +0100 Received: from ip5f5af229.dynamic.kabel-deutschland.de ([95.90.242.41] helo=[192.168.0.2]) by inpost2.zedat.fu-berlin.de (Exim 4.94) for facets-of-complexity@lists.fu-berlin.de with esmtpsa (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 (envelope-from ) id 1l6K55-002HRN-63; Sun, 31 Jan 2021 22:16:27 +0100 To: facets-of-complexity@lists.fu-berlin.de From: Ita Brunke Message-ID: Date: Sun, 31 Jan 2021 22:16:26 +0100 User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:52.0) Gecko/20100101 Firefox/52.0 SeaMonkey/2.49.5 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="------------D9F4E2A912B49A8E1E64AC9F" X-Original-Sender: i.brunke@inf.fu-berlin.de X-Originating-IP: 95.90.242.41 X-ZEDAT-Hint: A X-purgate: clean X-purgate-type: clean X-purgate-ID: 151147::1612127787-0008F3C6-6C5EF91E/0/0 X-Bogosity: Ham, tests=bogofilter, spamicity=0.014979, version=1.2.4 X-Spam-Flag: NO X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE X-Spam-Checker-Version: SpamAssassin 3.4.4 on Tuvalu.ZEDAT.FU-Berlin.DE X-Spam-Level: Subject: [Facets-of-complexity] No Monday's Lecture - February 1st 2021 X-BeenThere: facets-of-complexity@lists.fu-berlin.de X-Mailman-Version: 2.1.29 Precedence: list List-Id: announcements of Monday lectures and other events List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 31 Jan 2021 21:16:32 -0000 This is a multi-part message in MIME format. --------------D9F4E2A912B49A8E1E64AC9F Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Dear all, there will be*no* Monday's Lecture or Colloquium, Monday February 1st 2021. Next Monday Lecture will be on Monday, February 8th 2021 - to be announced as usual. All the best, Ita. --------------D9F4E2A912B49A8E1E64AC9F Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: 7bit Dear all,

there will be no Monday's Lecture or Colloquium, Monday February 1st 2021.

Next Monday Lecture will be on Monday, February 8th 2021 - to be announced as usual.

All the best,
Ita.

  


--------------D9F4E2A912B49A8E1E64AC9F--



From itabrunke@zedat.fu-berlin.de Wed Feb 03 16:18:20 2021
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 )
 id 1l7JvA-000cZK-AL; Wed, 03 Feb 2021 16:18:20 +0100
Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69])
 by outpost.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 )
 id 1l7JvA-003f5D-7D; Wed, 03 Feb 2021 16:18:20 +0100
Received: from ip5f5af4c0.dynamic.kabel-deutschland.de ([95.90.244.192]
 helo=[192.168.0.2]) by inpost2.zedat.fu-berlin.de (Exim 4.94)
 for facets-of-complexity@lists.fu-berlin.de with esmtpsa (TLS1.2)
 tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256
 (envelope-from )
 id 1l7Jv9-002ugJ-Vr; Wed, 03 Feb 2021 16:18:20 +0100
From: Ita Brunke 
To: facets-of-complexity@lists.fu-berlin.de
Message-ID: <3999b96b-3b93-997a-f35a-6eb1766a4637@inf.fu-berlin.de>
Date: Wed, 3 Feb 2021 16:18:21 +0100
User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:52.0) Gecko/20100101
 Firefox/52.0 SeaMonkey/2.49.5
MIME-Version: 1.0
Content-Type: multipart/alternative;
 boundary="------------D07852352722F1F5E5CE4E2D"
X-Original-Sender: i.brunke@inf.fu-berlin.de
X-Originating-IP: 95.90.244.192
X-ZEDAT-Hint: A
X-purgate: clean
X-purgate-type: clean
X-purgate-ID: 151147::1612365500-000157EA-F8EC1241/0/0
X-Bogosity: Ham, tests=bogofilter, spamicity=0.000000, version=1.2.4
X-Spam-Flag: NO
X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE
X-Spam-Checker-Version: SpamAssassin 3.4.4 on Palau.ZEDAT.FU-Berlin.DE
X-Spam-Level: 
Subject: [Facets-of-complexity] Invitation and link to Monday Lecture -
 February 8th 2021 - online via zoom
X-BeenThere: facets-of-complexity@lists.fu-berlin.de
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: announcements of Monday lectures and other events
 
List-Unsubscribe: ,
 
List-Archive: 
List-Post: 
List-Help: 
List-Subscribe: ,
 
X-List-Received-Date: Wed, 03 Feb 2021 15:18:20 -0000

This is a multi-part message in MIME format.
--------------D07852352722F1F5E5CE4E2D
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit

You are cordially invited to our next Monday Lecture. Next Monday 
Lecture, there will again be the hearing of one of our PhD candidates.

We will have*one talk* this time only. Talk will be 30 min. 15 min 
discussion.
All Monday Lectures and Colloquia of winter term 2020/21 will be given 
online via zoom.

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 will be on *February 8th 2021* at *14:15 h* !

*_Online via_:
Zoom - Invitation*

*_Time_: **Monday, February 8th - 14:15 h*

*_Lecture_: Helena Bergold (Fern Universität Hagen)
*

*_Title_: Topological Drawings meet Classical Theorems of Convex Geometry*

*_Abstract_:*

In this talk we discuss classical theorems from Convex Geometry such as 
Carathéodory's Theorem in a more general context of topological drawings 
of complete graphs. In a (simple) topological drawing the edges of the 
graph are drawn as simple closed curves such that every pair of edges 
has at most one common point. Triangles of topological drawings can be 
viewed as convex sets. This gives a link to convex geometry. Our main 
result is a generalization of Kirchberger's Theorem that is of purely 
combinatorial nature. For this we introduce a structure called 
''generalized signotopes'' which are a combinatorial generalization of 
topological drawings. We discuss further properties of generalized 
signotopes. Joint work with Stefan Felsner, Manfred Scheucher, Felix 
Schröder and Raphael Steiner.


--------------D07852352722F1F5E5CE4E2D
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: 8bit


  
    
  
  
    
You are cordially invited to our next Monday Lecture. Next Monday
      Lecture, there will again be the hearing of one of our PhD
      candidates. 

    

    
We will have one talk this time only. Talk will be 30 min.
      15 min discussion.

      All Monday Lectures and Colloquia of winter term 2020/21 will be
      given online via zoom. 

    

    
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 will be on February 8th 2021 at 14:15
        h !

    

    Online via:

      Zoom - Invitation

    
Time: Monday, February 8th - 14:15 h 

    
Lecture: Helena Bergold (Fern Universität Hagen) 

      

    
Title: Topological Drawings meet Classical Theorems of
        Convex Geometry

    Abstract:

    


    

    In this talk we discuss classical theorems from Convex Geometry such
    as Carathéodory's Theorem in a more general context of topological
    drawings of complete graphs. In a (simple) topological drawing the
    edges of the graph are drawn as simple closed curves such that every
    pair of edges has at most one common point. Triangles of topological
    drawings can be viewed as convex sets. This gives a link to convex
    geometry. Our main result is a generalization of Kirchberger's
    Theorem that is of purely combinatorial nature. For this we
    introduce a structure called ''generalized signotopes'' which are a
    combinatorial generalization of topological drawings. We discuss
    further properties of generalized signotopes. Joint work with Stefan
    Felsner, Manfred Scheucher, Felix Schröder and Raphael Steiner.

    

  


--------------D07852352722F1F5E5CE4E2D--



From itabrunke@zedat.fu-berlin.de Wed Feb 17 15:29:15 2021
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 )
 id 1lCNpI-000iFS-4G; Wed, 17 Feb 2021 15:29:12 +0100
Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69])
 by outpost.zedat.fu-berlin.de (Exim 4.94) with esmtps (TLS1.2)
 tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384
 (envelope-from )
 id 1lCNpI-000wUp-1F; Wed, 17 Feb 2021 15:29:12 +0100
Received: from ip5f5af4c1.dynamic.kabel-deutschland.de ([95.90.244.193]
 helo=[192.168.0.2]) by inpost2.zedat.fu-berlin.de (Exim 4.94)
 with esmtpsa (TLS1.2) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256
 (envelope-from )
 id 1lCNpG-0018Lj-Tv; Wed, 17 Feb 2021 15:29:11 +0100
From: Ita Brunke 
To: facets-of-complexity@lists.fu-berlin.de
Message-ID: 
Date: Wed, 17 Feb 2021 15:29:10 +0100
User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:52.0) Gecko/20100101
 Firefox/52.0 SeaMonkey/2.49.5
MIME-Version: 1.0
Content-Type: multipart/alternative;
 boundary="------------47C739CA1B4824F3C216A140"
X-Original-Sender: i.brunke@inf.fu-berlin.de
X-Originating-IP: 95.90.244.193
X-ZEDAT-Hint: A
X-purgate: clean
X-purgate-type: clean
X-purgate-ID: 151147::1613572152-000329F0-728D8512/0/0
X-Bogosity: Ham, tests=bogofilter, spamicity=0.005312, version=1.2.4
X-Spam-Flag: NO
X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE,
 HTML_OBFUSCATE_05_10
X-Spam-Checker-Version: SpamAssassin 3.4.4 on Niue.ZEDAT.FU-Berlin.DE
X-Spam-Level: 
Subject: [Facets-of-complexity] Invitation and link to Monday Lecture and
 Colloquium - February 22nd 2021 - online via zoom
X-BeenThere: facets-of-complexity@lists.fu-berlin.de
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: announcements of Monday lectures and other events
 
List-Unsubscribe: ,
 
List-Archive: 
List-Post: 
List-Help: 
List-Subscribe: ,
 
X-List-Received-Date: Wed, 17 Feb 2021 14:29:15 -0000

This is a multi-part message in MIME format.
--------------47C739CA1B4824F3C216A140
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit

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).


--------------47C739CA1B4824F3C216A140
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: 8bit


  

    
  
  
    
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).

    

  


--------------47C739CA1B4824F3C216A140--



From itabrunke@zedat.fu-berlin.de Mon Mar 29 16:52:29 2021
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 )
 id 1lQtFh-002AgJ-7j; Mon, 29 Mar 2021 16:52:25 +0200
Received: from inpost2.zedat.fu-berlin.de ([130.133.4.69])
 by outpost.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 )
 id 1lQtFh-003Wg9-4t; Mon, 29 Mar 2021 16:52:25 +0200
Received: from [95.90.243.48] (helo=[192.168.0.2])
 by inpost2.zedat.fu-berlin.de (Exim 4.94)
 for facets-of-complexity@lists.fu-berlin.de with esmtpsa (TLS1.2)
 tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256
 (envelope-from )
 id 1lQtFg-0003sc-Qe; Mon, 29 Mar 2021 16:52:25 +0200
From: Ita Brunke 
To: facets-of-complexity@lists.fu-berlin.de
Message-ID: <66e2e3f8-1410-042f-3c81-b067162a654a@inf.fu-berlin.de>
Date: Mon, 29 Mar 2021 16:52:24 +0200
User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:52.0) Gecko/20100101
 Firefox/52.0 SeaMonkey/2.49.5
MIME-Version: 1.0
Content-Type: multipart/alternative;
 boundary="------------18823F3241D9C25781C9CBBF"
X-Original-Sender: i.brunke@inf.fu-berlin.de
X-Originating-IP: 95.90.243.48
X-ZEDAT-Hint: A
X-purgate: clean
X-purgate-type: clean
X-purgate-ID: 151147::1617029545-00032A12-7603B81E/0/0
X-Bogosity: Ham, tests=bogofilter, spamicity=0.002621, version=1.2.4
X-Spam-Flag: NO
X-Spam-Status: No, score=-50.0 required=5.0 tests=ALL_TRUSTED,HTML_MESSAGE
X-Spam-Checker-Version: SpamAssassin 3.4.5 on Kiribati.ZEDAT.FU-Berlin.DE
X-Spam-Level: 
Subject: [Facets-of-complexity] Invitation to application talks for 'Facets
 of Complexity' - this week.
X-BeenThere: facets-of-complexity@lists.fu-berlin.de
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: announcements of Monday lectures and other events
 
List-Unsubscribe: ,
 
List-Archive: 
List-Post: 
List-Help: 
List-Subscribe: ,
 
X-List-Received-Date: Mon, 29 Mar 2021 14:52:29 -0000

This is a multi-part message in MIME format.
--------------18823F3241D9C25781C9CBBF
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit

Dear all,

this week we do have application talks again for 'Facets of Complexity', 
like we did in December and January.
You all are cordially invited. Schedule will be as given below:


_Tuesday, March 30th_: _Wednesday, March 31st_:

14:00 Kunz Pascal                                14:00 Karl Stickler
15:00 Vera Chekan                               15:00 Alexandre Simon
                                                              16:00 
Krishnendu Bhowmick

Schedule is: 30min talk, 15min discussion, 15 min break.

The talks will be over Zoom:
_https://tu-berlin.zoom.us/j/69716124232?pwd=dzFlcTFHMmFXRTE5QmZLaEV5N0FRUT09_
No password is needed.

Best regards,
Ita.

-- 
Graduiertenkolleg 'Facets of Complexity'
Koordinatorin: Ita Brunke  Raum 111  Tel.:838-52683
Freie Universität Berlin
Institut für Informatik
Takustr. 9
14195 Berlin (Dahlem)


--------------18823F3241D9C25781C9CBBF
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: 8bit


  

    
  
  
    Dear all,

    

    this week we do have application talks again for 'Facets of
    Complexity', like we did in December and January. 

    You all are cordially invited. Schedule will be as given below:

    

    

    Tuesday, March 30th:                           Wednesday,
      March 31st:

    

    14:00 Kunz Pascal                                14:00 Karl Stickler

    15:00 Vera Chekan                               15:00 Alexandre
    Simon

                                                                 16:00
    Krishnendu Bhowmick

    

    Schedule is: 30min talk, 15min discussion, 15 min break.

    

    The talks will be over Zoom: 

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

    No password is needed.

    

    Best regards,

    Ita.
    
-- 
Graduiertenkolleg 'Facets of Complexity'
Koordinatorin: Ita Brunke  Raum 111  Tel.:838-52683
Freie Universität Berlin
Institut für Informatik
Takustr. 9
14195 Berlin (Dahlem)

  


--------------18823F3241D9C25781C9CBBF--