Uniform Cyclic Group Factorizations of Finite Groups
Kazuki Kanai, Kengo Miyamoto, Koji Nuida, Kazumasa Shinagawa

TL;DR
This paper introduces the concept of uniform group factorizations, generalizes exact factorizations, and shows that all finite solvable groups admit uniform cyclic factorizations, linking the problem to simple groups.
Contribution
It defines uniform group factorizations, proves all finite solvable groups have uniform cyclic factorizations, and relates the existence of such factorizations to simple groups.
Findings
All finite solvable groups admit uniform cyclic factorizations
The existence of uniform cyclic factorizations for all finite groups is linked to simple groups
Concrete examples of uniform cyclic group factorizations are provided
Abstract
In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group is said to admit a uniform group factorization if there exist subgroups such that and the number of ways to represent any element as () does not depend on the choice of . Moreover, a uniform group factorization consisting of cyclic subgroups is called a uniform cyclic group factorization. First, we show that any finite solvable group admits a uniform cyclic group factorization. Second, we show that whether all finite groups admit uniform cyclic group factorizations or not is equivalent to whether all finite simple groups admit uniform group factorizations or not. Lastly, we give some concrete examples of such…
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
Topicsgraph theory and CDMA systems
