English
Related papers

Related papers: Lower Bounds for Cubical Pseudomanifolds

200 papers

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…

Metric Geometry · Mathematics 2023-02-09 Wiktor Mogilski , Kyle Grant

In this paper we derive an explicit lower bound on the volume of a hyperbolic $n$-orbifold for dimensions greater than or equal to four. Our main tool is H. C. Wang's bound on the radius of a ball embedded in the fundamental domain of a…

Geometric Topology · Mathematics 2014-10-01 Ilesanmi Adeboye , Guofang Wei

For each $d\geq 3$ we construct cube complexes homeomorphic to the $d$-sphere with $n$ vertices in which the number of facets (assuming $d$ constant) is $\Omega(n^{5/4})$. This disproves a conjecture of Kalai's stating that the number of…

Combinatorics · Mathematics 2025-03-25 Sergey Avvakumov , Alfredo Hubard

We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…

Combinatorics · Mathematics 2026-04-01 Andrey Egorov

We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…

Geometric Topology · Mathematics 2018-01-17 Petar Pavešić

Suppose that a finite-dimensional cube is orthogonally projected onto a central section of itself by a subspace of one dimension less. Up to dimension $9$, at least one vertex is projected onto the section, but for dimension $10$ or larger,…

Functional Analysis · Mathematics 2020-10-13 Yossi Lonke

Although the Unimodality Conjecture holds for some certain classes of cubical polytopes (e.g. cubes, capped cubical polytopes, neighborly cubical polytopes), it fails for cubical polytopes in general. A 12-dimensional cubical polytope with…

Combinatorics · Mathematics 2015-01-07 László Major , Szabolcs Tóth

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

In this paper we discuss face numbers of generalised triangulations of manifolds in arbitrary dimensions. This is motivated by the study of triangulations of simply connected $4$-manifolds: We observe that, for a triangulation $\mathcal{T}$…

Geometric Topology · Mathematics 2024-01-23 Jonathan Spreer , Lucy Tobin

In 1984, Dancis proved that any $d$-dimensional simplicial manifold is determined by its $(\lfloor d/2 \rfloor + 1)$-skeleton. This paper adapts his proof to the setting of cubical complexes that can be embedded into a cube of arbitrary…

Combinatorics · Mathematics 2021-07-08 Rowan Rowlands

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

Combinatorics · Mathematics 2016-02-10 Steven Klee , Isabella Novik

In a previous paper the second author showed that if $M$ is a pseudomanifold with complementarity other than the 6-vertex real projective plane and the 9-vertex complex projective plane, then $M$ must have dimension $\geq 6$, and - in case…

Geometric Topology · Mathematics 2007-05-23 Bhaskar Bagchi , Basudeb Datta

A normal pseudomanifold is a pseudomanifold in which the links of simplices are also pseudomanifolds. So, a normal 2-pseudomanifold triangulates a connected closed 2-manifold. But, normal $d$-pseudomanifolds form a broader class than…

Geometric Topology · Mathematics 2008-07-18 Basudeb Datta , Nandini Nilakantan

In 1967, Gr\"unbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. We prove this conjecture and also…

Combinatorics · Mathematics 2020-04-21 Lei Xue

We present a technique for deriving lower bounds for incidences with hypersurfaces in ${\mathbb R}^d$ with $d\ge 4$. These bounds apply to a large variety of hypersurfaces, such as hyperplanes, hyperspheres, paraboloids, and hypersurfaces…

Combinatorics · Mathematics 2016-10-05 Adam Sheffer

Rigidity results are obtained for Riemannian $d$-manifolds with $\sec \geqslant 1$ and spherical rank at least $d-2>0$. Conjecturally, all such manifolds are locally isometric to a round sphere or complex projective space with the…

Differential Geometry · Mathematics 2014-09-29 Benjamin Schmidt , Krishnan Shankar , Ralf Spatzier

We establish several new lower bounds on the $g$-numbers of simplicial spheres without large missing faces. For this class of spheres, we derive bounds on the $g$-numbers in terms of the independence numbers of their graphs, extending a…

Combinatorics · Mathematics 2026-04-21 Isabella Novik , Hailun Zheng

We establish a lower bound for the surface area of a closed, convex hypersurface in Euclidean space in terms of its displacement under continuous maps. As a result, a hypothesized lower bound for the volume of a Riemannian $n$-sphere,…

Differential Geometry · Mathematics 2026-04-23 James Dibble , Joseph Hoisington

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

Combinatorics · Mathematics 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

Combinatorics · Mathematics 2026-01-21 Ksenia Apolonskaya , Oleg R. Musin