Related papers: An infinitary Zero sum theorem

The Erd\H{o}s-Ginzburg-Ziv theorem states that every sequence of 2n - 1 integers contains a subsequence of length n whose sum is divisible by n. Choi, Kang, and Lim gave a simple deterministic O(n log n) algorithm for finding such a…

A cornerstone result of Erd\H os, Ginzburg, and Ziv (EGZ) states that any sequence of $2n-1$ elements in $\mathbb{Z}/n$ contains a zero-sum subsequence of length $n$. While algebraic techniques have predominated in deriving many deep…

The Erd\H{o}s-Ginzburg-Ziv theorem states that for any sequence of $2n-1$ integers, there exists a subsequence of $n$ elements whose sum is divisible by $n$. In this article, we provide a simple, practical $O(n\log\log n)$ algorithm and a…

What is the maximum number of $r$-term sums admitting rational values in $n$-element sets of irrational numbers? We determine the maximum when $r<4$ or $r\geq n/2$ and also in case when we drop the condition on the number of summands. It…

Zero-sum problems for abelian groups and covers of the integers by residue classes, are two different active topics initiated by P. Erdos more than 40 years ago and investigated by many researchers separately since then. In an earlier…

Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant $s_r(G)$ is the smallest integer $s$ such that every sequence of length $s$ over $G$ has a zero-sum subsequence of…

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…

Let $G$ be a multiplicatively written finite group of order $n$. The Erd\H{o}s-Ginzburg-Ziv Theorem constant of the group $G$, denoted $\mathsf E(G)$, is defined as the smallest positive integer $\ell$ with the following property: for any…

We prove finiteness results on integral points on complements of large divisors in projective varieties over finitely generated fields of characteristic zero. To do so, we prove a function field analogue of arithmetic finiteness results of…

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

Let $G$ be a finite abelian group written additively, and let $r$ be a multiple of its exponent. The modified Erd\H{o}s-Ginzburg-Ziv constant $\mathsf{s}_r'(G)$ is the smallest integer $s$ such that every zero-sum sequence of length $s$…

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

Let $(G_n)_{n\geqslant 0}$ be a linear recurrence sequence defining a numeration system and satisfying mild structural hypotheses. For real-valued G-additive functions (additive in the greedy G-digits), we establish an…

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are…

We prove that if $\sum_n n! c_n z^n$ is entire and $c_n$ does not terminate, then $\sum_n c_n z^n$ has infinitely many zeros. We then use this result to give alternative proofs that the Le Roy functions $f_r(z)=\sum_{n=0}^\infty…

The Erd\H{o}s--Ginzburg--Ziv Problem is a classical extremal problem in discrete geometry. Given $m$ and $n$, the problem asks about the smallest number $s$ such that among any $s$ points in the integer lattice $\mathbb{Z}^n$ one can find…

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…