A lower bound theorem for strongly regular CW spheres with up to \(2d+1\) Vertices

DOI10.1007/S00454-023-00553-6WikidataQ123017578 ScholiaQ123017578MaRDI QIDQ6624200

Lei Xue

Publication date: 25 October 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

polytopediamond latticelower bound theoremstrongly regular CW sphere

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Cites Work

• Title not available (Why is that?)
• Rigidity and the lower bound theorem. I
• Polytopal and nonpolytopal spheres. An algorithmic approach
• The number of faces of a simplicial convex polytope
• Lower-bound theorems for pseudomanifolds
• A proof of Grünbaum's lower bound conjecture for general polytopes
• Minimum number of edges of polytopes with \(2d+2\) vertices
• Graph theorems for manifolds
• A characterization of homology manifolds with \(g_{2}\geq 2\)
• Lower bound theorems for general polytopes
• Decomposition theorem for the cd-index of Gorenstein posets
• The minimum number of vertices of a simple polytope
• A proof of the lower bound conjecture for convex polytopes
• Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
• Lectures on Polytopes
• Convex Polytopes
• The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices
• Convex Polytopes
• The maximum numbers of faces of a convex polytope

This page was built for publication: A lower bound theorem for strongly regular CW spheres with up to \(2d+1\) Vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624200)