Zero-sum partitions of Abelian groups of order $2^n$
Sylwia Cichacz, Karol Suchan

TL;DR
This paper investigates conditions for partitioning the non-zero elements of Abelian groups of order 2^n into zero-sum subsets, extending previous results and applying findings to graph labelings.
Contribution
It generalizes the sufficiency of the condition m_i ≥ 3 for Abelian groups of order 2^n with more than one involution, filling a gap in existing group partition theory.
Findings
Proves m_i ≥ 3 is sufficient for all Abelian groups of order 2^n with |I(Γ)| > 1.
Extends previous results from specific groups to all groups of order 2^n.
Applies the theoretical results to graph magic and anti-magic labelings.
Abstract
The following problem has been known since the 80's. Let be an Abelian group of order (denoted ), and let and , , be positive integers such that . Determine when , the set of non-zero elements of , can be partitioned into disjoint subsets , , such that and for every , . It is easy to check that (for every , ) and are necessary conditions for the existence of such partitions, where is the set of involutions of . It was proved that the condition is sufficient if and only if . For other groups (i.e., for which and ), only the case of any group with…
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
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · graph theory and CDMA systems
