Almost Simplicial Polytopes: The Lower and Upper Bound Theorems (Q5222174): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rigidity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rigidity of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum number of vertices of a simple polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the lower bound conjecture for convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of faces of polytope pairs and unbounded polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the combinatorial intersection cohomology of fans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection homology of toric varieties and a conjecture of Kalai / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellable Decompositions of Cells and Spheres. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigidity and the lower bound theorem. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of faces of the Minkowski sum of two convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Lefschetz theorem for nonrational polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(f\)-vectors of triangulated balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numbers of faces of simplicial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized lower‐bound conjecture for simplicial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized lower bound conjecture for polytopes and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of simplicial polytopes with \(g_{2}=1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of faces of a simplicial convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitesimally Rigid Polyhedra. I. Statics of Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Revision as of 04:38, 22 July 2024

scientific article; zbMATH DE number 7184221
Language Label Description Also known as
English
Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
scientific article; zbMATH DE number 7184221

    Statements

    Almost Simplicial Polytopes: The Lower and Upper Bound Theorems (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2020
    0 references
    almost simplicial polytope
    0 references
    lower bound theorem
    0 references
    upper bound theorem
    0 references
    graph rigidity
    0 references
    \(h\)-vector
    0 references
    \(f\)-vector
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references