Products of foldable triangulations

DOI10.1016/J.AIM.2006.07.016MaRDI QIDQ875253zbMATH OpenOpenAlexWikidataFDO

Publication date 13 April 2007

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0508180

foldable triangulation graph colouring lattice polytope signature of a triangulation triangulation triangulations of cubes

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Abstract: Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile [Adv. Math. 204(1):116-151, 2006]. Special attention is paid to the cube case.

Review text

A triangulation of an \(m\)-polytope is foldable if, intuitively, the triangulation can be folded along the connecting \((m-1)\)-dimensional faces, so that the triangulation collapses to a single \(m\)-simplex. Note that foldability is a combinatorial condition -- if the simplices have different shapes or sizes, this is ignored. A triangulation is foldable if and only if its 1-skeleton is \((m+1)\)-vertex colourable. (See the article under review for further definitions and discussion.) Equivalently, a triangulation is foldable if its facets may be coloured black and white, checkerboard-style, so that no two adjacent facets have the same colour. The article under review considers foldable triangulations of products of polytopes, and of lattice polytopes, focusing especially on foldable triangulations which are regular and dense (see the article for definitions). The signature of a foldable triangulation is the (positive) difference between the numbers of black and white facets. The signature of a lattice polytope is the largest signature of its regular dense foldable triangulations. The article gives lower bounds for the signatures of the \(d\)-cubes \([0,1]^d\), showing that these increase superexponentially with \(d\). Explicit values are given for a few small \(d\), and computer experiments are described for a few slightly larger \(d\).

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: Products of foldable triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875253)