Cyclic groups are CI-groups for balanced configurations
Hiroki Koike, Istv\'an Kov\'acs, Dragan Maru\v{s}i\v{c}, Mikhail, Muzychuk

TL;DR
This paper proves that all finite cyclic groups have the CI-property specifically for balanced configurations, advancing understanding of symmetry and isomorphism in combinatorial structures.
Contribution
It establishes that cyclic groups are CI-groups within the context of balanced configurations, a new result in algebraic combinatorics.
Findings
Finite cyclic groups satisfy the CI-property for balanced configurations.
The result extends the class of known CI-groups in combinatorics.
Provides a foundation for further research on symmetry in combinatorial designs.
Abstract
In this paper it is shown that every finite cyclic group satisfies the CI-property for the class of balanced configurations.
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 · Finite Group Theory Research · Coding theory and cryptography
