Skip to contentSkip to filters

We use cookies for analytics.

Trickle-down Theorems for High-dimensional Expanders via Log-concave Polynomials

Mathematics, Algebra and seminar by Jonathan Leake, University of Waterloo

Hosted by Simons Institute for the Theory of Computing

Monday 09:00 Los Angeles (GMT-7)

Recording available

Berkeley, United States
Related content

Recording

1 h

Abstract

Expansion properties of low-dimensional links can propagate through a simplicial complex. This talk presents recent results for partite high-dimensional expanders and their consequences for approximate sampling. It explains how Lorentzian and log-concave polynomials provide the mathematical basis for these local-to-global arguments.

Topics

low-dimensional linkssimplicial complexpartite high-dimensional expandersapproximate samplinglog-concave polynomialslocal-to-global argumentsexpansion propertiesmathematical basis