A class of highly symmetric Archdeacon embeddings
Combinatorics
2023-04-05 v2
Abstract
Archdeacon, in his seminal paper , defined the concept of Heffter array to provide explicit constructions of biembeddings of the complete graph into orientable surfaces, the so-called Archdeacon embeddings, and proved that these embeddings are -regular. In this paper, we show that an Archdeacon embedding may admit an automorphism group that is strictly larger than . Indeed, as an application of the interesting class of arrays recently introduced by Buratti in , we exhibit, for infinitely many values of , an embedding of this type having full automorphism group of size that is the largest possible one.
Keywords
Cite
@article{arxiv.2212.08491,
title = {A class of highly symmetric Archdeacon embeddings},
author = {Simone Costa and Lorenzo Mella},
journal= {arXiv preprint arXiv:2212.08491},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2205.02066