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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: polymake / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LattE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1211.2039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Continuous Discretely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes related to interval vectors and incidence matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Barvinok Algorithm Based on Irrational Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutohedra, Associahedra, and Beyond / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:15, 8 July 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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references