Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings
Abstract
The following problem has been known since the 80s. Let be an Abelian group of order m (denoted ||=m), and let t and \mi\i=1t, be positive integers such that Σi=1t mi=m-1. Determine when *=\0\, the set of non-zero elements of , can be partitioned into disjoint subsets \Si\i=1t such that |Si|=mi and Σs∈ Sis=0 for every 1 ≤ i ≤ t. Such a subset partition is called a zero-sum partition. |I()|≠ 1, where I() is the set of involutions in , is a necessary condition for the existence of zero-sum partitions. In this paper, we show that the additional condition of mi≥ 4 for every 1 ≤ i ≤ t, is sufficient. Moreover, we present some applications of zero-sum partitions to magic- and antimagic-type labelings of graphs.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.