Related papers: Caps and progression-free sets in $\mathbb{Z}_m^n$

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Let $G$ be a finite group, and let $r_{3}(G)$ represent the size of the largest subset of $G$ without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that $r_{3}(C_{4}^{n}) \leqslant (3.61)^{n}$,…

A subset $S$ of an abelian group $G$ is called $3$-$\mathrm{AP}$ free if it does not contain a three term arithmetic progression. Moreover, $S$ is called complete $3$-$\mathrm{AP}$ free, if it is maximal w.r.t. set inclusion. One of the…

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…

We study subsets of $\mathbb{F}_p^n$ that do not contain progressions of length $k$. We denote by $r_k(\mathbb{F}_p^n)$ the cardinality of such subsets containing a maximal number of elements. In this paper we focus on the case $k=p$ and…

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…

Let $k$ and $n$ be fixed positive integers. For each prime power $q\geqslant k\geqslant 3$, we show that any subset $A\subseteq \mathbb{Z}_q^n$ free of $k$-term arithmetic progressions has size $|A|\leqslant c_k(q)^n$ with a constant…

We show that for integer $n>0$, any subset $A \subset Z_4^n$ free of three-term arithmetic progressions has size $|A| < 4^{c n}$, with an absolute constant $c \approx 0.926$.

We address a problem posed by Nathan Kaplan in the 2014 Combinatorial and Additive Number Theory session: finding the largest subset $H \subseteq (\mathbb{Z}/4\mathbb{Z})^n$ with no distinct $x, y, z \in H$ such that $x + y + z \equiv 0…

Balogh, Liu, Sharifzadeh and Treglown [Journal of the European Mathematical Society, 2018] recently gave a sharp count on the number of maximal sum-free subsets of $\{1, \dots, n\}$, thereby answering a question of Cameron and Erd\H{o}s. In…

For a sequence $S$ over a finite abelian group, let $MZ(S)$ denote the length of the shortest nonempty zero-sum subsequence of $S$. We prove that if $G$ is finite abelian of order $n$ and $S$ has length $n$, then $MZ(S)\le n-|\supp(S)|+1$.…

We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval…

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of the (additive) abelian group $G$ {\it $t$-free} if for all…

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…

In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of $F_q^n$ with no three terms in arithmetic progression by $c^n$ with $c < q$. For $q=3$, the problem of finding the largest subset…

A subset $A$ of a given finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not necessarily distinct) elements of $A$ does not equal the sum of $l$ (not necessarily distinct) elements of $A$. We are interested in finding…

In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…