Triangulated Manifolds with Few Vertices: Vertex-Transitive Triangulations I
Köhler, Ekkehard G. · Lutz, Frank H.
Original · EN
We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial d-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on n≤ 13 vertices. With the exception of actions of groups of small order, the enumeration is extended to 14 and 15 vertices.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.