Disjoint zero-sum subsets in Abelian groups and its application -- survey
Sylwia Cichacz

TL;DR
This survey summarizes research on disjoint zero-sum subsets in finite Abelian groups, highlighting recent solutions to conjectures and applications in graph labeling within additive and combinatorial number theory.
Contribution
It provides a solution to a conjecture on orthomorphisms for specific group orders and explores applications of zero-sum sets in graph labeling.
Findings
Solved the conjecture for k=3 and groups with order ≡ 4 mod 24.
Connected zero-sum sets to orthomorphisms in Abelian groups.
Demonstrated applications in graph labeling.
Abstract
We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group is defined as a bijection such that the mapping is also bijective. In 1981, Friedlander, Gordon, and Tannenbaum conjectured that when is Abelian, for any dividing , there exists an orthomorphism of fixing the identity and permuting the remaining elements as products of disjoint -cycles. Using the idea of disjoint-zero sum subset we provide a solution of this conjecture for and . We also present some applications of zero-sum sets in graph labeling.
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
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Cooperative Communication and Network Coding
