Metraipolis › archive › dc_916e38fbffd6

Circular regular dessins with underlying graphs ${\bf K}_{2^e,2^f}^{(2^d)}$: the metacyclic case — arXiv:2610.41123

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41123
License (as archived)
CC0-1.0
Archived
2026-11-02T05:00:30.762Z
SHA-256 of the archived text
5b751bcff8e09588441c7d9757a3a0222ca120f8db73791f5169b18c4308f8d2
Stable URL of this page
https://metraipolis.com/documento/dc_916e38fbffd6

How to cite

Circular regular dessins with underlying graphs ${\bf K}_{2^e,2^f}^{(2^d)}$: the metacyclic case — arXiv:2610.41123 — arXiv (en), https://arxiv.org/abs/2610.41123 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_916e38fbffd6 (Metraipolis archive dc_916e38fbffd6, sha256 5b751bcff8e09588441c7d9757a3a0222ca120f8db73791f5169b18c4308f8d2)
BibTeX
@misc{dc916e38fbffd6,
  title = {Circular regular dessins with underlying graphs $bf K_2^e,2^f^(2^d)$: the metacyclic case — arXiv:2610.41123},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41123},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_916e38fbffd6; sha256 5b751bcff8e09588441c7d9757a3a0222ca120f8db73791f5169b18c4308f8d2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41123. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A dessin is a 2-cell embedding of a connected bipartite graph into an orientable closed surface. It is regular if the colour- and orientation-preserving automorphism group acts regularly on edges, and circular if every face boundary is a simple cycle. We classify and enumerate circular regular dessins of the complete bipartite multigraph ${\bf K}_{2^e,2^f}^{(2^d)}$ ($e\ge f\ge 2$, $d\ge 1$) whose automorphism group is {\it metacyclic}. This extends the work of Fan (circular, metacyclic) and Cai--Hu (regular, metacyclic) from simple graphs ${\bf K}_{2^e,2^f}$ to multigraphs ${\bf K}_{2^e,2^f}^{(2^d)}$. Such dessins correspond to non-exact bicyclic factorisations $G=ła\rłb\r\cong\ZZ_{2^{e+d}}\ZZ_{2^{f+d}}$, where $ła\r\capłb\r\cong\ZZ_{2^d}$ and $łba\r\cap ła\r=łba\r\cap łb\r=1$. In general, a group admitting such a factorisation need not be metacyclic; in this paper we impose the additional condition that $G$ is a metacyclic 2-group. Under this assumption, we obtain explicit enumeration formulas for the number of such dessins up to isomorphism. Together with the known classifications for simple graphs (the case $d=0$), this completes the enumeration of the metacyclic case for 2-power complete bipartite multigraphs.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.41123 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:47:57.668Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).