Finite groups admitting a regular tournament $m$-semiregular representation
Dein Wong, Songnian Xu, Chi Zhang, Jinxing Zhao

TL;DR
This paper proves that all finite groups of odd order greater than one admit a regular tournament m-semiregular representation for any odd integer m ≥ 3, extending previous results and solving an open classification problem.
Contribution
It establishes that every finite group of odd order admits a regular TmSR for all odd m ≥ 3, providing a complete classification for this case.
Findings
All finite groups of odd order > 1 admit a regular TmSR for any odd m ≥ 3.
The result extends previous partial classifications and confirms the conjecture for odd order groups.
The paper solves an open problem posed by Du regarding the classification of such groups.
Abstract
For a positive integer , a finite group is said to admit a tournament -semiregular representation (TmSR for short) if there exists a tournament such that the automorphism group of is isomorphic to and acts semiregularly on the vertex set of with orbits. Clearly, every finite group of even order does not admit a TmSR for any positive integer , 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 and . More recently, Du \cite{du} proved that every finite group of odd order has a TmSR for every . The author of \cite{du} observed that a finite group of odd order has no regular TmSR when is an even integer, a group of order has no regular T3SR,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Matrix Theory and Algorithms · Graph theory and applications
