OpenAlex ·

A Topological Figiel-Lindenstrauss-Milman Theorem and its Applications

Florian Frick, Kaave Hosseini, Eric Myzelev, Arya Narnapatti and Aliaksei Vasileuski

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.10402
Original
Read it at the publisher
Topics
Mathematical PhysicsCombinatoricsGeometric Topology

Abstract

We prove a topological generalization of the Figiel--Lindenstrauss--Milman inequality, answering a recent question of Frick, Hosseini, and Vasileuski: every nonempty strongly regular CW complex with $v$ vertices, $f$ maximal cells, and a free involution that permutes its cells has $\mathbb Z/2$-index at most $4\log v\log f$. The classical inequality for centrally symmetric polytopes is the special case of polytope boundaries. As an application, we show that every finite simplicial complex homotopy equivalent to $\mathbb RP^d$ has at least $\exp(Ω(\sqrt d))$ vertices. The previous best lower bound was $Ω(d^2)$. We also construct triangulations with $\exp(O(\sqrt d))$ vertices. Using the same method, we prove a low-dimensional Postnikov factorization theorem, which gives similar vertex lower bounds for several classical families, such as complex and quaternionic projective spaces, the $d$-torus, closed symplectic and aspherical manifolds, Grassmannians, classical Lie groups, and spherical space forms. Further applications include results in learning theory, convex geometry, computational topology, and topological bounds for chromatic numbers and Vietoris--Rips complexes.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Mathematical Physics

Get the few papers worth your time in Mathematical Physics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics