Products of foldable triangulations (Q875253): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: QEPCAD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TOPCOM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: polymake / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065803780 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0508180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equidecomposable and weakly neighborly polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for simplicial covers and triangulations of cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical convexity via cellular resolutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonregular triangulations of products of simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5813687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even Triangulations of S 3 and the Coloring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplexity of the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branched coverings, triangulations, and 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projectivities in simplicial complexes and colorings of simple polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically efficient triangulations of the \(d\)-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A point set whose space of triangulations is disconnected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5701861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for real solutions to sparse polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and commutative algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sign-balanced posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is known about unit cubes / rank
 
Normal rank

Latest revision as of 17:09, 25 June 2024

scientific article
Language Label Description Also known as
English
Products of foldable triangulations
scientific article

    Statements

    Products of foldable triangulations (English)
    0 references
    0 references
    0 references
    13 April 2007
    0 references
    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\).
    0 references
    0 references
    triangulation
    0 references
    lattice polytope
    0 references
    triangulations of cubes
    0 references
    foldable triangulation
    0 references
    graph colouring
    0 references
    signature of a triangulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references