相关论文: The Erd\H{o}s-Ginzburg-Ziv constant and progressio…

Naslund used Tao's slice rank bounding method to give new exponential upper bounds for the Erd\H{o}s--Ginzburg-Ziv constant of finite Abelian groups of high rank. In our short manuscript we improve slightly Naslund's upper bounds. We extend…

For a finite abelian group $G$, the Erd\H{o}s-Ginzburg-Ziv constant $\mathfrak{s}(G)$ is the smallest $s$ such that every sequence of $s$ (not necessarily distinct) elements of $G$ has a zero-sum subsequence of length…

The Erd\H{o}s-Ginzburg-Ziv constant of an abelian group $G$, denoted $\mathfrak{s}(G)$, is the smallest $k\in\mathbb{N}$ such that any sequence of elements of $G$ of length $k$ contains a zero-sum subsequence of length $\exp(G)$. In this…

Adapting Reiher's proof of Kemnitz's conjecture, we obtain two refinements of a theorem of Schmid and Zhuang. Our main results provide improved upper bounds for the Erd\H{o}s-Ginzburg-Ziv constant of rank-two-like $p$-groups, and their…

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

Pach and Palincza proved the following generalization of Ellenberg and Gijswijt's bound for the size of $k$-term arithmetic progression-free subsets, where $k\in \{4,5,6\}$: Let $m>0$ be an integer such that $6$ divides $m$ and let $k\in…

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…

For a finite abelian group $G$ and a positive integer $k$, let $s_{k}(G)$ denote the smallest integer $\ell\in\mathbb{N}$ such that any sequence $S$ of elements of $G$ of length $|S|\geq\ell$ has a zero-sum subsequence with length $k$. The…

In Ellenberg and Gijswijt's groundbreaking work, the authors show that a subset of $\mathbb{Z}_3^{n}$ with no arithmetic progression of length 3 must be of size at most $2.755^n$ (no prior upper bound was known of $(3-\epsilon)^n)$), and…

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 $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…

The classical Erd\H{o}s-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $\ell$ such that any sequence $S$ of length at least $\ell$ contains a zero-sum subsequence of length $\exp(G)$. In a recent paper, Caro and…

Let $G$ be a finite abelian group. The Erd{\H o}s--Ginzburg--Ziv constant $\mathsf s (G)$ of $G$ is defined as the smallest integer $l \in \mathbb N$ such that every sequence \ $S$ \ over $G$ of length $|S| \ge l$ \ has a zero-sum…

Denote by ${\mathfrak s}({\mathbb F}_p^d)$ the Erd{\H o}s--Ginzburg--Ziv constant of ${\mathbb F}_p^d$, that is, the minimum $s$ such that any sequence of $s$ vectors in ${\mathbb F}_p^d$ contains $p$ vectors whose sum is zero. Let…

Let us fix a prime $p$. The Erd\H{o}s-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$.…

We characterize the structure of maximum-size sum-free subsets of a random subset of an Abelian group $G$. In particular, we determine the threshold $p_c \approx \sqrt{\log n / n}$ above which, with high probability as $|G| \to \infty$,…

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…

We show that any subset of $\mathbb{Z}_p^n$ ($p$ an odd prime) without $3$-term arithmetic progression has size $O(p^{cn})$, where $c:=1-\frac{1}{18\log p}<1$. In particular, we find an upper bound of $O(2.84^n)$ on the maximum size of an…

Croot, Lev and Pach used a new polynomial technique to give a new exponential upper bound for the size of three-term progression-free subsets in the groups $(\mathbb Z _4)^n$. The main tool in proving their striking result is a simple lemma…

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…