SearcharxivSearch

arXiv · 2501.13406

Finite groups admitting a regular tournament $m$-semiregular representation

Abstract

For a positive integer $m$, a finite group $G$ is said to admit a tournament $m$-semiregular representation (TmSR for short) if there exists a tournament $\Gamma$ such that the automorphism group of $\Gamma$ is isomorphic to $G$ and acts semiregularly on the vertex set of $\Gamma$ with $m$ orbits. Clearly, every finite group of even order does not admit a TmSR for any positive integer $m$, and T1SR is the well-known tournament regular representation (TRR for short). In 1986, Godsil \cite{god} proved, by a probabilistic approach, that the only finite groups of odd order without a TRR are $\mathbb{Z}_3^2$ and $\mathbb{Z}_3^3$ . More recently, Du \cite{du} proved that every finite group of odd order has a TmSR for every $m \geq 2$. The author of \cite{du} observed that a finite group of odd order has no regular TmSR when $m$ is an even integer, a group of order $1$ has no regular T3SR, and $\mathbb{Z}_3^2$ admits a regular T3SR. At the end of \cite{du}, Du proposed the following problem. \noindent{\sf\it Problem.} \ \ {\it For every odd integer $m\geq 3$, classify finite groups of odd order which have a regular TmSR.} The motivation of this paper is to give an answer for the above problem. We proved that if $G$ is a finite group with odd order $n>1$, then $G$ admits a regular TmSR for any odd integer $m\geq 3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Dein Wong, Songnian Xu, Chi Zhang, Jinxing Zhao. 2025-01-23. Finite groups admitting a regular tournament $m$-semiregular representation. https://arxiv.org/abs/2501.13406

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