Skip to content
Preprint

Superpolynomial lower bounds for vertex numbers of real projective space triangulations via a topological Figiel-Lindenstrauss-Milman theorem

Sep 2026 · 1 citation · 21 references
Mathematics

Abstract

We prove that every simplicial triangulation of real projective $d$-space has $\exp(\Omega(\sqrt d))$ vertices. Together with known constructions, this determines the minimum vertex number as $\mu_d=\exp(d^{1/2+o(1)})$. The result follows from a topological generalization of the Figiel--Lindenstrauss--Milman inequality, answering a recent question of Frick, Hosseini, and Vasileuski: a finite strongly regular CW complex with a free cellular involution, $v$ vertices, and $f$ maximal cells has $\mathbb{Z}/2$-index at most $O(\log v\log f)$. We bound the dimensions of Morse cells by a trace estimate for a constrained Hessian, obtaining a Morse-theoretic proof of the classical inequality for centrally symmetric polytopes. As further applications of this inequality, we give an $\exp(\Omega(\sqrt t))$ lower bound for the order of a triangle-free topologically $t$-chromatic graph and bound the index of sign complexes by $O(d\log^2 N)$ for total matrices and $O(d\log^3 N)$ for partial matrices, where $N\geq2$ is the number of columns and $d\geq1$ is the VC dimension.

View source

Similar papers

Preprint Oct 2026

Geometric Realizations with Strong Self-Duality Part II: Diameter Graphs, Reuleaux Polyhedra, and Thrackles

In this paper we construct new examples of diameter graphs and Reuleaux polyhedra in $\mathbb{R}^3$, obtaining a full characterization of their combinatorial structure. For a finite set of points $X\subset\mathbb{R}^d$, its diameter graph is the graph on vertex set $X$ where pairs forming a diameter pair are connected...

Gábor Damásdi · 0 citations
Preprint Aug 2026

Fixed Convex-Lens Spectral Constants: M\"obius Reduction, Sharp Model Theorems, and Angle-Dependent Bounds

For the intersection of two disks meeting at angle $2\alpha$, let $C(\alpha)$ be the least constant in the associated spectral-set inequality. We give a self-contained M"obius reduction to the corresponding numerical-range problem on a sector and determine the sharp constant for affine square-zero operators $B=\lambda...

Zi-Jian Zeng · 0 citations
Preprint Sep 2026

A planar algebraic Zarankiewicz theorem over prime fields

We prove an incidence bound for bipartite graphs on finite subsets of $\mathbb{F}^2\times \mathbb{F}^2$ defined by Boolean combinations of polynomial equations of bounded degree. If such a graph is $K_{k,k}$-free and its vertex classes have sizes $m$ and $n$, then it has $O_{t,k}((mn)^{2/3}+m+n+mn/p)$ edges, where $t$...

Le Quang-Ham · 0 citations
Preprint Aug 2026

Simplicial arrangements in real projective three-space revisited

In this paper we study irreducible simplicial arrangements of projective planes in $\mathbb{P}^{3}(\mathbb{R})$ from combinatorial and projective geometry viewpoints. We first formulate a simpliciality criterion in terms of incidences between rank-two and rank-three flats, together with equivalent formulations using fa...

Marek Janasz, Piotr Pokora · 0 citations
Preprint Sep 2026

Regular dyadic triangulations of delta-matroid polytopes

Backman and Liu proved that every integral generalized permutohedron of type $A$, and in particular every matroid base polytope, admits a regular unimodular triangulation. The analogous statement fails in type $B$: the delta-matroid simplex \[\operatorname*{conv}\{\mathbf{0},\ e_1+e_2,\ e_1+e_3,\ e_2+e_3\}\] has normal...

Mathieu Vallée · 0 citations
Preprint Aug 2026

Sharp Bounds for Rational Points Near Space Curves

Let $Q\geq 1$ be large, and $\delta \in(0,1)$ be small. Denote by $\mathcal C \subset \mathbb R^3$ a sufficiently smooth curve with non-vanishing curvature and torsion. How many rational points $\mathbf{a}/q$ of height $q\in[1, Q]$ are $\delta/q$-near $\mathcal C$? This manuscript provides an essentially optimal answer...

Ming-Feng Chen, A. Seeger, Rajula Srivastava et al. · 3 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.