×

Complete circular regular dessins of type \(\{2^e,2^f\}\). I: metacyclic case. (English) Zbl 07511945

Summary: A complete dessin of type \(\{2^e,2^f\}\) is an orientable map with underlying graph being a complete bipartite graph \(\mathbf{K}_{2^e,2^f}\), which is said to be regular if all edges are equivalent under the group of color- and orientation-preserving automorphisms, and circular if the boundary cycle of each face is a circuit (a simple cycle). As one of a series papers towards a classification of complete circular regular dessins of type \(\{m,n\}\), this paper presents such a classification for the case \(\{m,n\}=\{2^e,2^f\}\), where \(e, f\) are positive integers and \(e\ge f\ge 2\). We note that the group \(G\) of color- and orientation-preserving automorphisms is a bicyclic 2-group of type \(\{2^e,2^f\}\), and our analysis splits naturally into two cases depending on whether the group \(G\) is metacyclic or not. In this paper, we deal with the case that \(G\) is metacyclic.

MSC:

20B15 Primitive groups
20B30 Symmetric groups
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
Full Text: DOI

References:

[1] M.J.Curran, The automorphism group of a split metacyclic \(2\)-group, Arch. Math.89 (2007), 10šC23. · Zbl 1125.20015
[2] Du, SF, 2-groups that factorise as products of cyclic groups, and regular embeddings of complete bipartite graphs, Ars math. Contemp., 6, 155-170 (2013) · Zbl 1309.20010 · doi:10.26493/1855-3974.295.270
[3] S. F. Du, G. Jones, J. H. Kwak, R. Nedela and M. Škoviera, Regular embeddings of \(K_{n,n}\) where n is a power of 2. I. Metacyclic case, European J. Combin.28 (2007), no. 6, 1595-1609. · Zbl 1123.05029
[4] S. F. Du, G. Jones, J. H. Kwak, R. Nedela and M. Škoviera, Regular embeddings of \(K_{n,n}\) where n is a power of 2. II: the non-metacyclic case, European J. Combin. 31 (2010), no. 7, 1946-1956. · Zbl 1221.05079
[5] Fan, WW, Circular regular dessins, J. Algebr. Comb., 54, 441-456 (2021) · Zbl 1542.05042 · doi:10.1007/s10801-020-00996-7
[6] Fan, WW; Li, CH, The complete bipartite graphs with a unique edge-transitive embedding, J. Graph Theory, 87, 581-586 (2018) · Zbl 1398.05103 · doi:10.1002/jgt.22176
[7] Fan, WW; Li, CH; Qu, HP, A classification of orientably edge-transitive circular embeddings of \(K_{p^e,p^f}\), Ann. Comb., 22, 135-146 (2018) · Zbl 1458.05050 · doi:10.1007/s00026-018-0373-5
[8] W. W. Fan, C. H. Li and Naer Wang, Edge-transitive uniface embeddings of bipartite multi-graphs. J. Algebr. Comb.49 (2019), 125-134. · Zbl 1414.05139
[9] W. W. Fan, C. H. Li and S. H. Qiao,Complete circular regular dessins of coprime orders, submitted. · Zbl 1502.05169
[10] Gonzalez-Diez, G.; Jaikin-Zapirain, A., The absolute Galois group acts faithfully on regular dessins and on Beauville surfaces, Proc. London Math. Soc., 111, 775-796 (2015) · Zbl 1333.11061 · doi:10.1112/plms/pdv041
[11] A. Grothendieck, Esquisse d’un programme. [Sketch of a program] (English Translation) pp. 243-283. London Math. Soc. Lecture Note Ser., 242, Geometric Galois actions, 1, 5-48, Cambridge Univ. Press, Cambridge, 1997. · Zbl 0901.14001
[12] Huppert, B., Endliche Gruppen I (1979), Berlin: Springer, Berlin · Zbl 0412.20002
[13] Hu, K.; Nedela, R.; Wang, NE, Complete regular dessins of odd prime power order, Discrete Math., 342, 2, 314-325 (2019) · Zbl 1400.05159 · doi:10.1016/j.disc.2018.09.028
[14] Hu, K.; Nedela, R.; Wang, NE, Nilpotent groups of class two which underly a unique regular dessin, Geom. Dedicata, 179, 2, 177-186 (2015) · Zbl 1330.14058 · doi:10.1007/s10711-015-0074-8
[15] K. Hu and Y. S. Kwon, Reflexible complete regular dessins and antiblanced skew morphisms of cyclic groups, Art Discrete Appl. Math., 3 (2020) doi:10.26493/2590-9770.1284.3ad · Zbl 1474.20003
[16] G. A. Jones, Regular embeddings of complete bipartite graphs: classification and enumeration, Proc. London Math. Soc. (3)101(2010), 427-453. · Zbl 1202.05028
[17] Jones, GA; Jones, JM, Elementary Number Theory (1998), London: Springer, London · Zbl 0891.11001 · doi:10.1007/978-1-4471-0613-5
[18] G. A. Jones, R. Nedela and M. Škoviera, Regular embeddings of \(K_{n,n}\) where n is an odd prime power, European J. combinatorics, 28 (2007), 1863-1875. · Zbl 1125.05033
[19] G. A. Jones, Complete bipartite maps, factorable groups and generalised Fermat curves, in “Applications of Group Theory to Combinatorics”, Eds by Koolen, Kwak and Xu, Taylor & Francis Group, London, (2008), pp. 43-58, ISBN 978-0-415-47184-8. · Zbl 1251.05076
[20] Jones, GA; Nedela, R.; Škoviera, M., Complete bipartite graphs with a unique regular embedding, J. Combin. Theorey Ser. B, 98, 241-248 (2008) · Zbl 1136.05014 · doi:10.1016/j.jctb.2006.07.004
[21] Kwak, JH; Kwon, YS, Regular orientable embeddings of complete bipartite graphs, J. Graph Theory, 50, 105-122 (2005) · Zbl 1077.05032 · doi:10.1002/jgt.20097
[22] Kwak, JH; Kwon, YS, Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs, Discrete Math., 308, 2156-2166 (2008) · Zbl 1141.05029 · doi:10.1016/j.disc.2007.04.062
[23] R. Nedela, M. Škoviera, and A. Zlatoš Regular embeddings of complete bipartite graphs, Discrete Math. 258 (2002), no. 1-3, 379-381. · Zbl 1009.05049
[24] Richter, RB; Seymour, PD; Širáň, J., Circular embeddings of planar graphs in non-spherical surfaces, Discrete Math., 126, 273-280 (1994) · Zbl 0798.05020 · doi:10.1016/0012-365X(94)90271-2
[25] J. Širáň, How symmetric can maps on surfaces be ?, in: Surveys in Combinatorics, in: LMS Lecture Notes, vol. 409, Cambridge University Press, Cambridge, 2013, pp. 161-238. · Zbl 1301.05323
[26] Yu, X.; Lou, BG; Fan, WW, The complete bipartite graphs which have exactly two orientably edge-transitive embeddings, Ars math. Contemp., 18, 371-379 (2020) · Zbl 1486.05065 · doi:10.26493/1855-3974.1900.cc1
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.