Discrete Mathematics & Theoretical Computer Science |

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.

Source: arXiv.org:2203.09395

Volume: vol. 26:3

Section: Combinatorics

Published on: October 25, 2024

Accepted on: September 25, 2024

Submitted on: October 3, 2023

Keywords: Mathematics - Combinatorics,Mathematics - Group Theory,05E16, 20K01, 05C25, 05C78,G.2.1,G.2.2

This page has been seen 59 times.

This article's PDF has been downloaded 35 times.