Info Seminar: Convex Discrete Geometry


The seminar will be  hold online. If you are interested in participating, please enrol via ISIS : https://isis.tu-berlin.de/course/view.php?id=23930 or send me an email.

Content: Classical and modern research topics from Convex and Discrete Geometry (more details “soon”).

Vorkenntnisse in Diskreter Geometrie und/oder Konvexgeometrie erforderlich.
Working/good knowledge of Discrete or/and Convex Geometry is needed.

Die online Vorbesprechung findet am (first online meeting will be at)
Tuesday, 13.04.2020, 16:00 s.t./04:00 pm. where ? – see ISIS.

Info Discrete Geometry I

Please please enrol for this course on ISIS :
https://isis.tu-berlin.de/course/view.php?id=23516 
There you can also find the necessary online information.

Vorlesungszeiten (times&locations):  preliminary Tuesday & Thursday 14:15 / 2:15pm; details will be discussed in the first lecture taking place:

Vorlesungsbeginn (start): Tuesday, 13.04.2021, 14:15 –where? see ISIS

Inhalt (content): Basics of discrete/convex geometry, e.g., combinatorial properties of convex sets, polytopes and their different representations,  (mixed) volumes of convex sets. 

Vorkenntnisse (requirements):  Solid knowledge of Lineare Algebra II and Analysis II.

Literatur: (vorläufig/preliminary) 

Info

Classical & modern research topics from Convex and Discrete Geometry.

Vorkenntnisse in Diskreter Geometrie und/oder Konvexgeometrie erforderlich.
Working/good knowledge of Discrete or/and Convex Geometry is needed.

Die online Vorbesprechung findet am (first online meeting will be at)
Dienstag, 21.04.2020, 16:00 s.t..

If you are interested in participating, please send me an email so that I can provide you with the “how´´ .

Info

Vorlesungszeiten: Dienstag, 10-12, online

Vorlesungsbeginn: April, 21st; if you are interested in participating, please send me an email so that I can provide you with the “how´´ .

Inhalt: Covering numbers, Dvoretzky’s theorem, reverse Brunn-Minkowski theorem,  L_p/dual-Brunn-Minkowski theory, volume distribution in convex bodies

Vorkenntnisse: Fundierte Kenntnisse in der Konvexgeometrie

Literatur: (vorläufig)

Shiri Artstein-Avidan, Apostolos Giannopoulos and Vitali Milman, Asymptotic Geometric Analysis, Part I, AMS 2015.
Guillaume Auburn and Stanislaw J. Szarek, Alice and Bob meet Banach, AMS 2017.
Silouanos Brazitikos, Apostolos Giannopoulos, Petros Valettas  and Beatrice-Helen Vritsiou, Geometry of isotropic convex bodies, AMS  2014.
Richard Gardner, Geometric Tomography, Cambridge 2006.
Alexander Koldobsky, Fourier analysis in convex geometry, AMS 2005.
Rolf Schneider, Convex bodies: The Brunn-Minkowsi theory, Cambridge 2014.

Bei Fragen, bitte e-mail an mich.

Info

Vorlesungszeiten (times&locations):  Donnerstag, 10-12 & Freitag, 10-12, online ((average)weekly format: lectures 3 + exercises 1)

Vorlesungsbeginn (start): April 23rd; if you are interested in participating, please send me an email so that I can provide you with the “how´´ .

Inhalt (content): Lattices, reduction theory, packing and covering of convex bodies,
successive&covering minima, transference theorems, lattice points and convex bodies

Vorkenntnisse (requirements): Diskrete Geometrie I & II, bzw. fundierte Kenntnisse über strukturelle und metrische Eigenschaften konvexer Mengen. Discrete Geometry I/II, or solid knowledge on structural and metrical/analytic properties of convex sets.

Literatur: (vorläufig/preliminary)

John William Scott Cassels, An Introduction to the Geometry of Numbers, 1971.
Peter Manfred Gruber, Convex and Discrete Geometry, 2007.
Peter Manfred Gruber and Cornelius Gerrit Lekkerkerker, Geometry of Numbers, 1987.
Laszlo Lovász: An Algorithmic Theory of Numbers, Graphs, and Convexity, 1986.
Carl Ludwig Siegel, Lectures on the Geometry of Numbers, 1988.

If you have any questions, please send me an email.

Themenauswahl Seminar

Quantitative Helly-type Theoreme (kann auch für 2 reichen) —reserviert
Helly-type mit Ganzzahligkeitsbedingungen (reicht für 2) —reserviert
Diskrete Schnittungleichungen
Smooth Simplex-Algorithms Analysis
Algorithmische Rekonstruktion des Minkowski Problems (reicht auch für 2) —reserviert
-aus dem Buch “combinatorial geometry” von Pach&Agarwal:
Approximation durch Polygonereserviert
Packungen und Überdeckungen in der Ebene (2 Themen)
Planare Graphen und Kreispackungen

Die Auswahl erfolgt nach dem Prinzip “first come, first served” — und die Auswahl erfolgt bitte per email an mich. Die Terminabsprache der Vorträge erfolgt am Dienstag, 03.11, um 16:00 im MA 406.