English
Related papers

Related papers: Many Triangulated 3-Spheres

200 papers

It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous…

Combinatorics · Mathematics 2016-03-10 Eran Nevo , Francisco Santos , Stedman Wilson

In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…

Combinatorics · Mathematics 2007-05-23 Julian Pfeifle

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos

The result of Padrol asserts that for every $d\geq 4$, there exist $2^{\Omega(n\log n)}$ distinct combinatorial types of $\lfloor d/2\rfloor$-neighborly simplicial $(d-1)$-spheres with $n$ vertices. We present a construction showing that…

Combinatorics · Mathematics 2021-10-08 Isabella Novik , Hailun Zheng

It is known that the $3$-sphere has at most $2^{O(n^2 \log n)}$ combinatorially distinct triangulations with $n$ vertices. Here we construct at least $2^{\Omega(n^2)}$ such triangulations.

Combinatorics · Mathematics 2013-11-08 Eran Nevo , Stedman Wilson

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 describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…

Metric Geometry · Mathematics 2018-04-19 Moritz Firsching

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…

Metric Geometry · Mathematics 2015-10-05 Lauri Loiskekoski , Günter M. Ziegler

We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2\times S^1$ and 615…

Combinatorics · Mathematics 2007-05-23 Frank H. Lutz

Let $M$ be an $n$-vertex combinatorial triangulation of a $\ZZ_2$-homology $d$-sphere. In this paper we prove that if $n \leq d + 8$ then $M$ must be a combinatorial sphere. Further, if $n = d + 9$ and $M$ is not a combinatorial sphere then…

Geometric Topology · Mathematics 2012-05-29 Bhaskar Bagchi , Basudeb Datta

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

Combinatorics · Mathematics 2015-12-01 Frédéric Bosio

In 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of simplicial spheres. He proved that, for any simplicial complex $\Delta$ on the vertex set $V$ with $\Delta \ne 2^V$, the deleted join of $\Delta$ with…

Combinatorics · Mathematics 2011-05-10 Satoshi Murai

A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S^i\times\S^{d-2-i}$ is constructed for all pairs of non-negative integers $i$ and $d$ with $0\leq i \leq d-2$. For the case of $i=d-2-i$, the…

Combinatorics · Mathematics 2011-02-03 Steven Klee , Isabella Novik

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

Geometric Topology · Mathematics 2007-05-23 William P. Thurston

Every closed oriented PL 4-manifold is a branched cover of the 4-sphere branched over a PL-surface with finitely many singularities by Piergallini [Topology 34(3):497-508, 1995]. This generalizes a long standing result by Hilden and…

Combinatorics · Mathematics 2007-07-11 Nikolaus Witte

Nevo, Santos, and Wilson constructed $2^{\Omega(N^d)}$ combinatorially distinct simplicial $(2d-1)$-spheres with $N$ vertices. We prove that all spheres produced by one of their methods are shellable. Combining this with prior results of…

Combinatorics · Mathematics 2024-05-21 Yirong Yang

A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…

Metric Geometry · Mathematics 2025-10-06 Théophile Buffière , Lionel Pournin

We classify the combinatorial types of Murai spheres in dimensions $1$ and $2$, thereby showing that the corresponding convex simple polytopes have Delzant realizations. Then we describe all chordal Murai spheres $\mathrm{Bier}_c(M)$ with…

Combinatorics · Mathematics 2026-02-13 Ivan Limonchenko , Aleš Vavpetič

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

Combinatorics · Mathematics 2007-05-23 Frank H. Lutz

In this note we gather and review some facts about existence of toric spaces over 3-dimensional simple polytopes. First, over every combinatorial 3-polytope there exists a quasitoric manifold. Second, there exist combinatorial 3-polytopes,…

Algebraic Topology · Mathematics 2026-02-10 Anton Ayzenberg
‹ Prev 1 2 3 10 Next ›