A Lower Bound Technique for Triangulations of Simplotopes (Q4601211): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962890073 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0910.1134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag arrangements and triangulations of products of simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of products of minors / 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: Dyck path triangulations and extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulation of the 4-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of transportation polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations. Structures for algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and relatively efficient triangulation of the n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplexity of the cube / 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 triangulation of the n-cube / 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: A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rental Harmony: Sperner's Lemma in Fair Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4703857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of fixed points and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative <i>N</i> Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex / rank
 
Normal rank

Latest revision as of 22:52, 14 July 2024

scientific article; zbMATH DE number 6825996
Language Label Description Also known as
English
A Lower Bound Technique for Triangulations of Simplotopes
scientific article; zbMATH DE number 6825996

    Statements

    A Lower Bound Technique for Triangulations of Simplotopes (English)
    0 references
    0 references
    0 references
    12 January 2018
    0 references
    products of simplices
    0 references
    minimal triangulations
    0 references
    simplicial covers
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references