SearcharxivSearch

arXiv · 2605.20663

On $m$-partite oriented semiregular representations of finite groups

Abstract

The study of ORR was inspired by L\'{a}zsl\'{o} Babai in 1980 when he asked a question: Which [finite] groups admit an oriented graph as a DRR? And it has been solved by Joy Morris and Pablo Spiga through a series of papers in 2018. In this paper, we will extend the concept of ORR to $m$-partite oriented graphs for $m\geq 2$. We say that a finite group $G$ admits an \emph{$m$-partite oriented semiregular representation} ($m$-POSR) if there exists an $m$-partite oriented graph $\G$ such that its automorphism group is isomorphic to $G$ and acts semiregularly with the $m$ orbits giving the partition. Moreover, if $\G$ is regular, that is, each vertex has the same in- and out-valency, it can be viewed as the oriented version of an $m$-Haar graph of $G$ and we call $\G$ is an \emph{$m$-Haar oriented representation} ($m$-HOR) of $G$. Our main result is a complete classification of finite groups $G$ without $m$-HORs or $m$-POSRs for $m\geq 2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Jia-Li Du. 2026-05-20. On $m$-partite oriented semiregular representations of finite groups. https://arxiv.org/abs/2605.20663

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR