Related papers: Thresholds for zero-sums with small cross numbers …

For any finite abelian group $G$ and commutative unitary ring $R$, by $R[G]$ we denote the group algebra over $R$. Let $T=(g_1,\ldots,g_{\ell})$ be a sequence over the group $G$. We say $T$ is algebraically zero-sum free over R if…

A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one…

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

The power graph $\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\Gamma$ is an assignment of labels from…

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. In this paper, we classify all connected quintic Cayley graphs…

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

In this short note we prove that a graph product $G_\Gamma$ of finitely generated abelian groups is semicomplete -- that is the kernel of the natural homomorphism ${\rm Aut}(G_\Gamma)\to{\rm Aut}(G_\Gamma^{ab})$ induced by the…

In 1990, Alon and Kleitman proposed an argument for the sum-free subset problem: every set of n nonzero elements of a finite Abelian group contains a sum-free subset A of size |A|>\frac{2}{7}n. In this note, we show that the argument…

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

For a finite (not necessarily Abelian) group $(\Gamma,\cdot)$, let $n(\Gamma) \in \mathbb{N}$ denote the smallest positive integer $n$ such that for every labelling of the arcs of the complete digraph of order $n$ using elements from…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

A piece of a labelled graph $\Gamma$ defined by D. Gruber is a labelled path that embeds into $\Gamma$ in two essentially different ways. We prove that graphical $Gr'(\frac{1}{6})$ small cancellation groups whose associated pieces have…

A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors…

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

Given a finite group $G$ with identity $e$ and a normal subgroup $H$ of $G$, the subgroup sum graph $\Gamma_{G,H}$ (resp. extended subgroup sum graph $\Gamma_{G,H}^+$) of $G$ with respect to $H$ is the graph with vertex set $G$, in which…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements $x,y,z$ with $x+y=z$. The study of how large the largest sum-free subset of a given abelian group is had started more…

Let $\mathcal S$ be a multiset of integers. We say $\mathcal S$ is a $\textit{zero-sum sequence}$ if the sum of its elements is 0. We study zero-sum sequences whose elements lie in the interval $[-k,k]$ such that no subsequence of length…