Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope (Q1380809): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/pl00009328 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008907142 / rank
 
Normal rank

Latest revision as of 08:36, 30 July 2024

scientific article
Language Label Description Also known as
English
Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope
scientific article

    Statements

    Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope (English)
    0 references
    3 November 1998
    0 references
    A conjecture of Perles and Sturmfels claims that every simplicial polytope is a quotient of an even-dimensional neighbourly polytope and that similarly, every matroid polytope is a quotient of a neighborly matroid polytope of odd rank. Using the technique of affine Gale diagrams, the author proves the conjecture for simplicial polytopes as well as matroid polytopes with a bound on the number of vertices. More precisely, he proves the following theorem: Every simplicial \(d\)-polytope with at most \(d+4\) vertices is a quotient of a neighbourly polytope of dimension at most \(2d+4\) with at most \(2d+8\) vertices; every matroid polytope of rank \(d+1\) with at most \(d+4\) vertices is a quotient of a neighbourly matroid polytope of rank at most \(2d+5\) with at most \(2d+8\) vertices.
    0 references
    quotient polytope
    0 references
    simplicial polytope
    0 references
    neighbourly polytope
    0 references
    matroid polytope
    0 references
    Gale diagrams
    0 references
    0 references

    Identifiers