Related papers: Many Triangulated 3-Spheres
For Tur\'an's (3, 4)-conjecture, in the case of n = 3k+1 vertices, (.5)6^{k-1} non-isomorphic complexes are constructed that attain the conjecture. In the case of n = 3k+2 vertices, 6^{k-1} non-isomorphic complexes are constructed that…
In 1987 Brehm and K\"uhnel showed that any combinatorial $d$-manifold with less than $3d/2+3$ vertices is PL homeomorphic to the sphere and any combinatorial $d$-manifold with exactly $3d/2+3$ vertices is PL homeomorphic to either the…
A conjecture of Kalai from 1994 posits that for an arbitrary $2\leq k\leq \lfloor d/2 \rfloor$, the combinatorial type of a simplicial $d$-polytope $P$ is uniquely determined by the $(k-1)$-skeleton of $P$ (given as an abstract simplicial…
A polytrope is a tropical polytope which at the same time is convex in the ordinary sense. A $d$-dimensional polytrope turns out to be a tropical simplex, that is, it is the tropical convex hull of $d+1$ points. This statement is equivalent…
We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all…
A seminal result in the theory of toric varieties, due to Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope $P$ there is a positive integer $k$ such that the dilated polytope $kP$ has a unimodular triangulation.…
We present a first example of a flag vector of a polyhedral sphere that is not the flag vector of any polytope. Namely, there is a unique 3-sphere with the parameters $(f_0,f_1,f_2,f_3;f_{02})=(12,40,40,12;120)$, but this sphere is not…
A small triangulation of the sphere product can be found in lower dimensions by computer search and is known in few other cases: Klee and Novik constructed a centrally symmetric triangulation of $\mathbb{S}^i\times \mathbb{S}^{d-i-1}$ with…
We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…
In terms of the number of triangles, it is known that there are more than exponentially many triangulations of surfaces, but only exponentially many triangulations of surfaces with bounded genus. In this paper we provide a first geometric…
It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…
We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker…
The problem of deciding if a given triangulation of a sphere can be realized as the boundary sphere of a simplicial, convex polytope is known as the "Simplicial Steinitz problem". It is known by an indirect and non-constructive argument…
The $g$-vector of a simplicial complex contains a lot of information about the combinatorial and topological structure of that complex. Several classification results regarding the structure of normal pseudomanifolds and homology manifolds…
We use methods of combinatorics of polytopes together with geometrical and computational ones to obtain the complete list of compact hyperbolic Coxeter n-polytopes with n+3 facets, 3<n<8. Combined with results of Esselmann (1994), Andreev…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3^{d/2} = (1.73)^d vertices and of centrally symmetric k-neighborly d-polytopes with about 2^{c_k d} vertices where c_k=3/20 k^2 2^k.…
We give a simple combinatoric proof of an exponential upper bound on the number of distinct 3-manifolds that can be constructed by successively identifying nearest neighbour pairs of triangles in the boundary of a simplicial 3-ball and show…
In 1989 Kalai stated the three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the ``$3^d$-conjecture''. It is well-known that the three…
Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained…