Skip to content

Simplicial sphere

In geometry and combinatorics, a simplicial (or combinatorial) d-sphere is a simplicial complex homeomorphic to the d-dimensional sphere.

Version
v1 · 2026-09-28 · History
Domain-specific #
12053
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Combinatorial Topology, Polyhedral Combinatorics → Mathematics

Core Idea

Simplicial sphere is treated here as the recurring mathematicslogicstatistics identity summarized by this source-grounded definition: In geometry and combinatorics, a simplicial (or combinatorial) d-sphere is a simplicial complex homeomorphic to the d-dimensional sphere. In geometry and combinatorics, a simplicial (or combinatorial) d-sphere is a simplicial complex homeomorphic to the d-dimensional sphere. Some simplicial spheres arise as the boundaries of convex polytopes, however, in higher dimensions most simplicial spheres cannot be obtained in this way. One important open problem in the field was the g-conjecture, formulated by Peter McMullen, which asks about possible numbers of faces.

Scope of Application

  • Examples. For any n ≥ 3, the simple n-cycle C n is a simplicial circle, i.e. a simplicial sphere of dimension 1.

  • Examples. The boundary of a convex polyhedron in R 3 with triangular faces, such as an octahedron or icosahedron, is a simplicial 2-sphere.

  • Examples. More generally, the boundary of any (d+1)-dimensional compact (or bounded) simplicial convex polytope in the Euclidean space is a simplicial d-sphere.

  • Properties. It follows from Euler's formula that any simplicial 2-sphere with n vertices has 3n − 6 edges and 2n − 4 faces.

  • Properties. By repeatedly performing the barycentric subdivision, it is easy to construct a simplicial sphere for any n ≥ 4.

Clarity

A clear use of Simplicial sphere names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In geometry and combinatorics, a simplicial (or combinatorial) d-sphere is a simplicial complex homeomorphic to the d-dimensional sphere. The strongest recognition evidence in the frozen account is: The case of n = 4 is realized by the tetrahedron.

Manages Complexity

Simplicial sphere compresses multiple mathematicslogicstatistics details into a stable diagnostic relation. The source shows both the central mechanism—the g-conjecture, formulated by McMullen in 1970, asks for a complete characterization of f-vectors of simplicial d-spheres.—and the practical consequence—one important open problem in the field was the g-conjecture, formulated by Peter McMullen, which asks about possible numbers of faces of different dimensions of a simplicial sphere.

Abstract Reasoning

  1. Type the carrier. Identify the mathematicslogicstatistics entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: In geometry and combinatorics, a simplicial (or combinatorial) d-sphere is a simplicial complex homeomorphic to the d-dimensional sphere.
  3. Check operation and conditions. In the case of polytopal spheres, the answer is given by the g-theorem, proved in 1979 by Billera and Lee (existence) and Stanley (necessity).
  4. Demand recognition evidence. The case of n = 4 is realized by the tetrahedron.
  5. Test variation.

Knowledge Transfer

Within the home domain. Knowledge about Simplicial sphere transfers literally when a new case preserves the same carrier type, relation, and recognition test. For any n ≥ 3, the simple n-cycle C n is a simplicial circle, i.e. a simplicial sphere of dimension 1. The boundary of a convex polyhedron in R 3 with triangular faces, such as an octahedron or icosahedron, is a simplicial 2-sphere. Beyond the home domain. No canonical parent is asserted for Simplicial sphere.

Neighborhood in Abstraction Space

Simplicial sphere sits in a moderately populated region (60th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Geometric Figures & Constructions (32 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08