A convex polytope and an antimatroid for any given, finite group

DOI10.1016/j.endm.2016.09.005zbMath1356.05021OpenAlexW2536844771MaRDI QIDQ510527

Jean-Paul Doignon

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.005

zbMATH Keywords

automorphismconvex polytopeantimatroidfinite group

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (1)

Realisation of groups as automorphism groups in permutational categories

Cites Work

• Greedoids
• Polytopes with preassigned automorphism groups
• The theory of convex geometries
• Hamiltonicity and combinatorial polyhedra
• Automorphism groups of algebraic number fields
• On the groups of automorphisms of Steiner triple and quadruple systems
• Every group is the collineation group of some projective plane
• Graphs with Given Group and Given Graph-Theoretical Properties
• Convexity in Graphs and Hypergraphs
• On the Minimum Order of Graphs with Given Group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A convex polytope and an antimatroid for any given, finite group