The enumeration of stack polytopes and simplicial clusters

DOI10.1016/0012-365X(82)90121-2MaRDI QIDQ1173286zbMATH OpenFDO

Authors G. C. Shephard, Franz Hering, Ronald C. Read

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

equivalenceenumerationsimplicial d-clusterstack polytopesunder rigid motions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polytopes and polyhedra (52Bxx)

Cites work

• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Can Regular Tetrahedra be Glued Together Face to Face to form a Ring?
• Enumerating Dissectible Polyhedra by Their Automorphism Groups
• Enumeration of polyhedra: The number of 9-hedra
• Manifolds in stacked 4-polytopes
• On general dissections of a polygon
• On the cell-growth problem for arbitrary polygons
• Polyhedra with 4 to 8 faces
• Subpolytopes of stack polytopes
• The minimum number of vertices of a simple polytope
• The number of d ‐polytopes with d +3 vertices
• The number of neighbourly d ‐polytopes with d +3 vertices
• The number of trees

Cited in

(2)

• The weak-coupling limit of simplicial quantum gravity
• The weak-coupling limit of 3D simplicial quantum gravity

This page was built for publication: The enumeration of stack polytopes and simplicial clusters

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