We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and we improve lower bounds for covers and triangulations in dimensions 4 through at least 12 (and possibly more dimensions as well). Important ingredients are an analysis of the number of exterior faces that a simplex in the cube can have of a specified dimension and volume, and a characterization of corner simplices in terms of their exterior faces.
A triangulation of a simplicial complex $Δ$ is called uniform if the $f$-vector of its restriction to a face of $Δ$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform triangulation of $Δ$ can be expressed as nonnegative integer linear combinations of those of the $h$-vector of $Δ$, where the coefficients depend only on the dimension of $Δ$ and the $f$-vectors of the restrictions of the triangulation to simplices of various dimensions. Moreover, it provides information about these coefficients, including formulas, recurrence relations a…
The Barratt nerve, denoted $B$, is the endofunctor that takes a simplicial set to the nerve of the poset of its non-degenerate simplices. The ordered simplicial complex $BSd\, X$, namely the Barratt nerve of the Kan subdivision $Sd\, X$, is a triangulation of the original simplicial set $X$ in the sense that there is a natural map $BSd\, X\to X$ whose geometric realization is homotopic to some homeomorphism. This is a refinement to the result that any simplicial set can be triangulated. A simplicial set is said to be regular if each of its non-degenerate simplices is embedded along its $n$-th …
In a recent paper, Bruns and von Thaden established a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The authors mentioned that the next goal would be a bound that is polynomial in the multiplicity but not knowing if such a bound exists. In this paper we will prove that such a bound, which is polynomial in the multiplicity $μ$, indeed exists. In detail, the bound is of the type $μ^{f(d)}$ with $f(d) \in \mathcal{O}(d)$.
An $S$-hypersimplex for $S \subseteq \{0,1, \dots,d\}$ is the convex hull of all $0/1$-vectors of length $d$ with coordinate sum in $S$. These polytopes generalize the classical hypersimplices as well as cubes, crosspolytopes, and halfcubes. In this paper we study faces and dissections of $S$-hypersimplices. Moreover, we show that monotone path polytopes of $S$-hypersimplices yield all types of multipermutahedra. In analogy to cubes, we also show that the number of simplices in a pulling triangulation of a halfcube is independent of the pulling order.
The Hyperdeterminant and Triangulations of the 4-Cube
格式为2 x 2 x 2 x 2的超行列式是16个未知数的24次多项式，有2894276项。我们计算这个多项式的牛顿多面体和4-立方体的第二多面体。87959448个正则三角剖分分为25448个D-等价类，每个类对应于牛顿多面体的每个顶点。4-立方体有80876个粗规则的细分，一个次级多面体的每个面，但只有268个来自超行列式。
Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we will show that every hyperbolic surface of genus $g$ has a simplicial Delaunay triangulation with $O(g)$ vertices, where edges are given by distance paths. Then, we will construct a class of hyperbolic surfaces for which the order of this bound is optimal. Finally, to give a general lower bound, we will show that the $Ω(\sqrt{g})$ lower bound for the number of vertices of a simplicial triangulation of a topological surface of genus $g$ is tigh…
The antiprism triangulation provides a natural way to subdivide a simplicial complex $Δ$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as the simplicial complex of chains of multi-pointed faces of $Δ$, from a combinatorial point of view, and by successively applying the antiprism construction, or balanced stellar subdivisions, on the faces of $Δ$, from a geometric point of view. This paper studies enumerative invariants associated to this triangulation, such as the transformation of the $h$-vector o…
For a CAT(0) cube complex $\mathbf X$, we define a simplicial flag complex $\partial_Δ\mathbf X$, called the \emph{simplicial boundary}, which is a natural setting for studying non-hyperbolic behavior of $\mathbf X$. We compare $\partial_Δ\mathbf X$ to the Roller, visual, and Tits boundaries of $\mathbf X$ and give conditions under which the natural CAT(1) metric on $\partial_Δ\mathbf X$ makes it (quasi)isometric to the Tits boundary. $\partial_Δ\mathbf X$ allows us to interpolate between studying geodesic rays in $\mathbf X$ and the geometry of its \emph{contact graph} $Γ\mathbf X$, which is …
The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this work we show the intersection matrix is enough to determine the triangulation of a 3-manifold up to isomorphism.
Higher chromatic numbers $χ_s$ of simplicial complexes naturally generalize the chromatic number $χ_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $χ_s$ of $d$-complexes can become arbitrarily large for $s\leq\lceil d/2\rceil$ [6,18]. In contrast, $χ_{d+1}=1$, and only little is known on $χ_s$ for $\lceil d/2\rceil<s\leq d$. A particular class of $d$-complexes are triangulations of $d$-manifolds. As a consequence of the Map Color Theorem for surfaces [29], the 2-chromatic number of any fixed surface is finite. However, by combining results from the literature, we will see …
Sphere-bases are constructed for the $\mathbb{Z}_2$ vector space formed by the $k$-dimensional subcomplexes, of $n$-simplex (or $n$-cube), for which every $(k{-}1)$-face is contained in a positive even number of $k$-cells; addition is symmetric difference of the corresponding sets of $k$-cells. The bases consist of the boundaries of an algorithmically-specified family of $k{+}1$-simplexes or $k{+}1$-cubes. Geometric properties of these bases are investigated.
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 dimension. Under some additional conditions (for example, if the cubical manifold is a sphere), the result can be tightened to the $\lceil d/2 \rceil$-skeleton when $d \geq 3$.
Given an infinite field $\mathbb{k}$ and a simplicial complex $Δ$, a common theme in studying the $f$- and $h$-vectors of $Δ$ has been the consideration of the Hilbert series of the Stanley--Reisner ring $\mathbb{k}[Δ]$ modulo a generic linear system of parameters $Θ$. Historically, these computations have been restricted to special classes of complexes (most typically triangulations of spheres or manifolds). We provide a compact topological expression of $h_{d-1}^\mathfrak{a}(Δ)$, the dimension over $\mathbb{k}$ in degree $d-1$ of $\mathbb{k}[Δ]/(Θ)$, for any complex $Δ$ of dimension $d-1$. I…
