Simplicial surfaces with given automorphism group

Abstract For any finite group G , Frucht presents a construction of a cubic graph whose automorphism group is isomorphic to G . For groups generated by two elements, we simplify Frucht’s construction to obtain cubic graphs with fewer nodes. In the general case, we address an oversight in Frucht’s construction. We prove the existence of cycle double covers of the resulting cubic graphs that lead to simplicial surfaces with given finite automorphism group. For almost all finite non-abelian simple groups, we give alternative constructions based on graphic regular representations. In the general cases $$C_n,D_n,A_5$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>C</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>D</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>A</mml:mi> <mml:mn>5</mml:mn> </mml:msub> </mml:mrow> </mml:math> for $$n\ge 4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> , we provide alternative constructions of simplicial spheres. Furthermore, we embed these simplicial spheres into the Euclidean 3-Space with equilateral triangles such that the automorphism group of the simplicial spheres and the symmetry group of the corresponding polyhedron are isomorphic.

Authors

Institutions

Publication Details

Journal
Journal of Algebraic Combinatorics
Published
2025-07-25
DOI
https://doi.org/10.1007/s10801-025-01424-4
Citations
1
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
5.33

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Simplicial surfaces with given automorphism group

Reymond Akpanya, Tom Goertzen
1 citations
Journal of Algebraic Combinatorics
Finite Group Theory Research
5.33
article

Simplicial surfaces with given automorphism group

Reymond Akpanya, Tom Goertzen
article en
1 citations

Abstract

Abstract For any finite group G , Frucht presents a construction of a cubic graph whose automorphism group is isomorphic to G . For groups generated by two elements, we simplify Frucht’s construction to obtain cubic graphs with fewer nodes. In the general case, we address an oversight in Frucht’s construction. We prove the existence of cycle double covers of the resulting cubic graphs that lead to simplicial surfaces with given finite automorphism group. For almost all finite non-abelian simple groups, we give alternative constructions based on graphic regular representations. In the general cases $$C_n,D_n,A_5$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>C</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>D</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>A</mml:mi> <mml:mn>5</mml:mn> </mml:msub> </mml:mrow> </mml:math> for $$n\ge 4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> , we provide alternative constructions of simplicial spheres. Furthermore, we embed these simplicial spheres into the Euclidean 3-Space with equilateral triangles such that the automorphism group of the simplicial spheres and the symmetry group of the corresponding polyhedron are isomorphic.

Journal of Algebraic CombinatoricsVol. 62(1)
The University of Sydney (AU), RWTH Aachen University (DE)
Deutsche Forschungsgemeinschaft, University of Sydney, Japan Society for the Promotion of Science
Openalex Percentile: Top 6%
Finite Group Theory Research
5.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.