The combinatorics of interval vector polytopes (Q396835): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1211.2039 / rank
 
Normal rank

Revision as of 14:21, 18 April 2024

scientific article
Language Label Description Also known as
English
The combinatorics of interval vector polytopes
scientific article

    Statements

    The combinatorics of interval vector polytopes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2014
    0 references
    Summary: An interval vector is a \((0,1)\)-vector in \(\mathbb{R}^n\) for which all the 1's appear consecutively, and an interval vector polytope is the convex hull of a set of interval vectors in \(\mathbb{R}^n\). We study three particular classes of interval vector polytopes which exhibit interesting geometric-combinatorial structures; e.g., one class has volumes equal to the Catalan numbers, whereas another class has face numbers given by the Pascal 3-triangle.
    0 references
    0 references
    0 references
    0 references
    0 references
    interval vector
    0 references
    lattice polytope
    0 references
    Ehrhart polynomial
    0 references
    root polytope
    0 references
    Catalan number
    0 references
    \(f\)-vector
    0 references
    0 references
    0 references
    0 references