![]() |
![]() |
![]() Finding HomeomorphsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact M.Jenssen. Nati Linial asked the following basic problem in 2006: Given a k-dimensional simplicial complex S, how many facets can a k-complex on n vertices have if it contains no topological copy of S? This is a beautiful and natural question, but results in low dimensions apart (k <= 2), very little was previously known. In this talk, I’ll provide an answer in all dimensions and take the scenic route to the answer, surveying many natural problems about simplicial complexes along the way. This talk is part of the Combinatorics and Probability seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listshttp://talks.bham.ac.uk/show/index/1942 EPS - College Research Teas Optimisation and Numerical Analysis SeminarsOther talksTBC Geometry of alternating projections in metric spaces with bounded curvature Ultrafast, all-optical, and highly efficient imaging of molecular chirality TBC Quantum simulations using ultra cold ytterbium Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems |