Random processes and quasirandomness for decomposition problems, Julia Böttcher | LMS CSC 2025
Автор: London Mathematical Society
Загружено: 2025-12-12
Просмотров: 81
Abstract: The use of random processes and of various notions of quasirandomness continue to play a crucial role in extremal combinatorics. In this talk I will illustrate this using the example of graph and hypergraph decomposition problems. I will introduce some important questions that researchers have looked at under this lens, provide background and motivation, and explain how random processes and quasirandomness are used to tackle these problems.
This lecture was part of the LMS Computer Science Colloquium 2025, which took place at De Morgan House, London on Tuesday 9 December 2025 and online via Zoom.
==========
The London Mathematical Society has, since 1865, been the UK's learned society for the advancement, dissemination and promotion of mathematical knowledge. Our mission is to advance mathematics through our members and the broader scientific community worldwide.
For further information:
► Website: https://www.lms.ac.uk
► Events: https://www.lms.ac.uk/events
► Grants and Prizes: https://www.lms.ac.uk/grants-prizes
► Publications: https://www.lms.ac.uk/publications
► Membership: https://www.lms.ac.uk/membership
Follow us:
► Twitter: / londmathsoc
► Facebook: / londonmathematicalsociety
► LinkedIn: / the-london-mathematical-society
► Youtube: @LondonMathematicalSociety
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
