On the realization of convex polytopes, Euler's formula and Möbius functions

DOI10.1007/BF01819757zbMath0294.52006OpenAlexW2072464551MaRDI QIDQ1212691

Bernt Lindström

Publication date: 1971

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136194

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Structure theory of lattices (06B05) Polytopes and polyhedra (52Bxx)

Related Items

Antiprismlessness, or: reducing combinatorial equivalence to projective equivalence in realizability problems for polytopes, A universality theorem for projectively unique polytopes and a conjecture of Shephard, Polytopes, graphs, and complexes, Geometria combinatoria e geometrie finite, Dual-antiprisms and partitions of powers of 2 into powers of 2, Combinatorial reciprocity theorems, A linear equation for Minkowski sums of polytopes relatively in general position, Flag enumerations of matroid base polytopes, A new basis of polytopes, Rectangular products of lattices, Some enumeration relating to intervals in posets, Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets, A combinatorial perspective on the non-Radon partitions

Cites Work

• Möbius inversion in lattices
• Introduction to model theory and to the metamathematics of algebra
• The Euler Characteristic in Combinatorial Geometry
• Determinants on Semilattices
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item