Partitioning the triangles of the cross polytope into surfaces

We present a constructive proof that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope $\beta^k$ into closed surfaces of genus $g \leq 1$, each with a transitive automorphism group given by the vertex transitive $\mathbb{Z}_{2k}$-action on $\beta^k$. Furthermore we show that for each $k \equiv 1,5(6)$ the 2-skeleton of the (k-1)-simplex is a union of highly symmetric tori and M\"obius strips.Comment: 13 pages, 1 figure. Minor update. Journal-ref: Beitr. Algebra Geom. / Contributions to Algebra and Geometry, 53(2):473-486, 201

On r-stacked triangulated manifolds

The notion of r-stackedness for simplicial polytopes was introduced by McMullen and Walkup in 1971 as a generalization of stacked polytopes. In this paper, we define the r-stackedness for triangulated homology manifolds and study their basic properties. In addition, we find a new necessary condition for face vectors of triangulated manifolds when all the vertex links are polytopal.Comment: 15 page

Triangulated Manifolds with Few Vertices: Centrally Symmetric Spheres and Products of Spheres

The aim of this paper is to give a survey of the known results concerning centrally symmetric polytopes, spheres, and manifolds. We further enumerate nearly neighborly centrally symmetric spheres and centrally symmetric products of spheres with dihedral or cyclic symmetry on few vertices, and we present an infinite series of vertex-transitive nearly neighborly centrally symmetric 3-spheres.Comment: 26 pages, 8 figure

Nerve complexes of circular arcs

We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Second, we show that the Lovasz bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the Vietoris--Rips simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time O(n log n)

Minimal triangulations of sphere bundles over the circle

For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1, d - 1}(\epsilon)$ denote the sphere product $S^{1} \times S^{d - 1}$ if $\epsilon = 0$ and the twisted $S^{d - 1}$ bundle over $S^{1}$ if $\epsilon = 1$. The main results of this paper are: (a) if $d \equiv \epsilon$ (mod 2) then $S^{1, d - 1}(\epsilon)$ has a unique minimal triangulation using $2d + 3$ vertices, and (b) if $d \equiv 1 - \epsilon$ (mod 2) then $S^{1, d - 1}(\epsilon)$ has minimal triangulations (not unique) using $2d + 4$ vertices. The second result confirms a recent conjecture of Lutz. The first result provides the first known infinite family of closed manifolds (other than spheres) for which the minimal triangulation is unique. Actually, we show that while $S^{1, d - 1}(\epsilon)$ has at most one $(2d + 3)$-vertex triangulation (one if $d \equiv \epsilon$ (mod 2), zero otherwise), in sharp contrast, the number of non-isomorphic $(2d + 4)$-vertex triangulations of these $d$-manifolds grows exponentially with $d$ for either choice of $\epsilon$. The result in (a), as well as the minimality part in (b), is a consequence of the following result: (c) for $d \geq 3$, there is a unique $(2d + 3)$-vertex simplicial complex which triangulates a non-simply connected closed manifold of dimension $d$. This amazing simplicial complex was first constructed by K\"{u}hnel in 1986. Generalizing a 1987 result of Brehm and K\"{u}hnel, we prove that (d) any triangulation of a non-simply connected closed $d$-manifold requires at least $2d + 3$ vertices. The result (c) completely describes the case of equality in (d). The proofs rest on the Lower Bound Theorem for normal pseudomanifolds and on a combinatorial version of Alexander duality.Comment: 15 pages, Revised, To appear in `Journal of Combinatorial Theory, Ser. A

Equivelar and d-Covered Triangulations of Surfaces. I

We survey basic properties and bounds for $q$-equivelar and $d$-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for $q$-equivelar and $d$-covered triangulations. We identify all orientable and non-orientable surfaces $M$ of Euler characteristic $0>\chi(M)\geq -230$ which admit non-neighborly $q$-equivelar triangulations with equality in the upper bound $q\leq\Bigl\lfloor\tfrac{1}{2}(5+\sqrt{49-24\chi (M)})\Bigl\rfloor$. These examples give rise to $d$-covered triangulations with equality in the upper bound $d\leq2\Bigl\lfloor\tfrac{1}{2}(5+\sqrt{49-24\chi (M)})\Bigl\rfloor$. A generalization of Ringel's cyclic $7{\rm mod}12$ series of neighborly orientable triangulations to a two-parameter family of cyclic orientable triangulations $R_{k,n}$, $k\geq 0$, $n\geq 7+12k$, is the main result of this paper. In particular, the two infinite subseries $R_{k,7+12k+1}$ and $R_{k,7+12k+2}$, $k\geq 1$, provide non-neighborly examples with equality for the upper bound for $q$ as well as derived examples with equality for the upper bound for $d$.Comment: 21 pages, 4 figure

Stacked polytopes and tight triangulations of manifolds

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be a purely combinatorial condition which implies the tightness of a triangulation. Here we present other sufficient and purely combinatorial conditions which can be applied to the odd-dimensional case as well. One of the conditions is that all vertex links are stacked spheres, which implies that the triangulation is in Walkup's class $\mathcal{K}(d)$. We show that in any dimension $d\geq 4$ \emph{tight-neighborly} triangulations as defined by Lutz, Sulanke and Swartz are tight. Furthermore, triangulations with $k$-stacked vertex links and the centrally symmetric case are discussed.Comment: 28 pages, 2 figure

The topological Tverberg problem beyond prime powers

Tverberg-type theory aims to establish sufficient conditions for a simplicial complex $\Sigma$ such that every continuous map $f\colon \Sigma \to \mathbb{R}^d$ maps $q$ points from pairwise disjoint faces to the same point in $\mathbb{R}^d$. Such results are plentiful for $q$ a power of a prime. However, for $q$ with at least two distinct prime divisors, results that guarantee the existence of $q$-fold points of coincidence are non-existent---aside from immediate corollaries of the prime power case. Here we present a general method that yields such results beyond the case of prime powers. In particular, we prove previously conjectured upper bounds for the topological Tverberg problem for all $q$.Comment: 13 pages, 2 figure