Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings (2203.09395v5)
Abstract: The following problem has been known since the 80s. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and ${m_i}{i=1}{t}$, be positive integers such that $\sum{i=1}t m_i=m-1$. Determine when $\Gamma*=\Gamma\setminus{0}$, the set of non-zero elements of $\Gamma$, can be partitioned into disjoint subsets ${S_i}{i=1}{t}$ such that $|S_i|=m_i$ and $\sum{s\in S_i}s=0$ for every $1 \leq i \leq t$. Such a subset partition is called a \textit{zero-sum partition}. $|I(\Gamma)|\neq 1$, where $I(\Gamma)$ is the set of involutions in $\Gamma$, is a necessary condition for the existence of zero-sum partitions. In this paper, we show that the additional condition of $m_i\geq 4$ for every $1 \leq i \leq t$, is sufficient. Moreover, we present some applications of zero-sum partitions to magic- and antimagic-type labelings of graphs.
- Group distance magic and antimagic hypercubes. Discrete Mathematics, 344(12):112625, 2021.
- Magic and Antimagic Graphs. Springer, 2019.
- Graph Classes: A Survey. SIAM, 1999.
- L. Caccetta and R.-Z. Jia. Binary labeling of graphs. Graphs and Combinatorics, 13(2):119–137, 1997.
- S. Cichacz. On zero sum-partition of Abelian groups into three sets and group distance magic labeling. Ars Mathematica Contemporanea, 13(2):417–425, 2017.
- S. Cichacz. Zero sum partition of Abelian groups into sets of the same order and its applications. The Electronic Journal of Combinatorics, 25(1):1–20, 2018.
- S. Cichacz and K. Suchan. Zero-sum partitions of Abelian groups of order 2nsuperscript2𝑛2^{n}2 start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT. Discrete Mathematics & Theoretical Computer Science, 25(1):#6, 2023.
- S. Cichacz and Z. Tuza. Realization of digraphs in Abelian groups and its consequences. Journal of Graph Theory, 100(2):331–345, 2022.
- Magic labellings of graphs over finite Abelian groups. Australasian Journal of Combinatorics, 29:259–272, 2004.
- R. Diestel. Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer, 2017.
- Y. Egawa. Graph labelings in elementary Abelian 2-groups. Tokyo Journal of Mathematics, 20(2):365–379, 1997.
- D. Froncek. Group distance magic labeling of cartesian product of cycles. Australasian Journal of Combinatorics, 55:167–174, 2013.
- J. Gallian. Contemporary Abstract Algebra. Cengage Learning, 2016.
- M. Habib and C. Paul. A survey of the algorithmic aspects of modular decomposition. Computer Science Review, 4(1):41–59, 2010.
- H. Hanani. Note on steiner triple systems. Mathematica Scandinavica, 8:154–156, 1960.
- On zero-sum partitions and anti-magic trees. Discrete Mathematics, 309(8):2010–2014, 2009.
- H. Mann. On orthogonal latin squares. Bull. Amer. Math. Soc., 50:249–257, 1944.
- A. Müyesser and A. Pokrovskiy. A random Hall-Paige conjecture. arXiv preprint, 2022. https://arxiv.org/abs/2204.09666.
- G. Sabidussi. Graph derivatives. Mathematische Zeitschrift, 76:385–401, 1961.
- T. Skolem. On certain distributions of integers in pairs with given differences. Mathematica Scandinavica, 5(1):57–68, 1957.
- T. Skolem. Some remarks on the triple systems of Steiner. Mathematica Scandinavica, 6:273–280, 1958.
- P. Tannenbaum. Partitions of Abelian groups into sets with zero sums. Congressus Numerantium, 33:341–348, 1981.
- P. Tannenbaum. Partitions of ℤ2nsuperscriptsubscriptℤ2𝑛\mathbb{Z}_{2}^{n}blackboard_Z start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT. SIAM Journal on Algebraic Discrete Methods, 4(1):22–29, 1983.
- X. Zeng. On zero-sum partitions of Abelian groups. Integers, 15:Paper No. A44: 16 pp, 2015.