Sannolikhet, statistik och kombinatorik: Cutting Down and Growing Trees
- Datum: –11.15
- Plats: Ångströmlaboratoriet
- Föreläsare: Benjamin Hackl (The University of Klagenfurt)
- Arrangör: Matematiska institutionen
- Kontaktperson: Xing Shi Cai
Abstract: In a series of articles over the last few years, the concept of deterministic tree reductions has been studied intensively. Two core questions in this context can be formulated as follows: given some deterministic reduction procedure (e.g., "cut away all left-most leaves"), how many iterations have to be applied to trees of given size such that they are completely reduced? And, after applying a fixed number of iterations, how many vertices are still left?
In this seminar talk, we will walk through the main ideas behind the combinatorial and asymptotic analysis of these questions. Simultaneously, in some live demonstrations we explore in how far the computer mathematics software system SageMath can support us when it comes to the asymptotic calculus.