Prague Summer School on Discrete Mathematics 2018

The second edition of the Prague Summer School on Discrete Mathematics was held in the week July 16-July 20 in the historical building of Charles University at Lesser Town Square.

Three lecture courses for 42 participants from fourteen countries were delivered by Piotr Micek (Jagiellonian University, POL), Aleksandar Nikolov (University of Toronto, CAN), and Péter Pál Pach (Budapest University of Technology, HUN and University of Warwick, GBP), based upon a recommendation of the international scientific board of the school. These courses covered recent breakthrough results of the speakers.

Piotr Micek talked on structural aspects of partially ordered set. Mathematical and computational aspects of combinatorial discrepancy were covered in the lectures by Aleksandar Nikolov. Péter Pál Pach focused in his lectures on the so-called polynomial method. The highlight of his lectures was the cap set problem. This problem, which has been central for mathematics since the work of the Fields medailist Klaus Roth in the 1950's, was solved by Pach in collaboration with Ernie Croot, Vsevolod Lev, Jordan Ellenberg, and Dion Gijswijt only in 2016. Six students and one postdoc from Charles University attended the school.

Discrete mathematics is a modern branch of mathematics which studies problems that are largely motivated by contemporary computer science. MFF UK has a strong record in the field, including a prestigious ERC grant awarded to Michal Koucký.

The school was organized by the Computer Science Institute of Charles University and the Institute of Mathematics of the Czech Academy of Sciences, with a financial support from Charles University, the Czech Academy of Sciences and the RSJ Foundation. The next edition of the school will take place on the premises of the Institute of Mathematics of the Czech Academy of Sciences in 2020.

CSI –

© 2013–2018 Charles University, Faculty of Mathematics and Physics. Design noBrother.
Content responsibility: Media Communications and PR Office.