Biembeddings of Archdeacon type: their full automorphism group and their number
Abstract
Archdeacon, in his seminal paper , defined the concept of Heffter array in order to provide explicit constructions of -regular biembeddings of complete graphs into orientable surfaces. In this paper, we first introduce the quasi-Heffter arrays as a generalization of the concept of Heffer array and we show that, in this context, we can define a -colorable embedding of Archdeacon type of the complete multipartite graph into an orientable surface. Then, our main goal is to study the full automorphism groups of these embeddings: here we are able to prove, using a probabilistic approach, that, almost always, this group is exactly . As an application of this result, given a positive integer , we prove that there are, for infinitely many pairs of and , at least non-isomorphic biembeddings of whose face lengths are multiples of . Here denotes the Euler's totient function. Moreover, in case and is a prime, almost all these embeddings define faces that are all of the same length , i.e. we have a more than exponential number of non-isomorphic -gonal biembeddings of .
Keywords
Cite
@article{arxiv.2205.02066,
title = {Biembeddings of Archdeacon type: their full automorphism group and their number},
author = {Simone Costa},
journal= {arXiv preprint arXiv:2205.02066},
year = {2025}
}