Related papers: Maximal sets with no solution to x+y=3z
By a theorem proved by Erdos, Kunen and Mauldin, for any nonempty perfect set $P$ on the real line there exists a perfect set $M$ of Lebesgue measure zero such that $P+M=\mathbb{R}$. We prove a stronger version of this theorem in which the…
This survey is based on a series of lectures given by the authors at the working seminar "Convexit\'e et Probabilit\'es" at UPMC Jussieu, Paris, during the spring 2013. It is devoted to maximal inequalities associated to symmetric convex…
Let $\mathscr{M}_{(2,1)}(N)$ be the infimum of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there is a constant $c=c(2,1)$ and a function $\omega(N)\to\infty$ as…
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 establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…
A subset $A$ of a finite abelian group is called $(k,\ell)$-sum-free if $kA \cap \ell A=\emptyset.$ In this paper, we extend this concept to compact abelian groups and study the question of how large a measurable $(k,\ell)$-sum-free set can…
We say that $(x,y,z)\in Q^3$ is an associative triple in a quasigroup $Q(*)$ if $(x*y)*z=x*(y*z)$. Let $a(Q)$ denote the number of associative triples in $Q$. It is easy to show that $a(Q)\ge |Q|$, and we call the quasigroup maximally…
The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary sets (ZCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations for this conjectured bound. A ZCS is optimal when…
In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of $\mathbb{F}^n_q$ with no three-term arithmetic progression. This problem has received much mathematical attention, particularly in the case $q = 3$,…
The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called…
Early results by Borel and Cantelli and Erd\H{o}s and Chung have provided bounds for the measure of a limsup set in terms of measures of its constituent sets and their intersections. Recent work by Beresnevich and Velani \cite{Velanipaper}…
We construct an $S_3$-symmetric probability distribution on $\{(a,b,c) \in \mathbb{Z}_{\geq 0}^3 \: : \: a+b+c =n \}$ such that its marginal achieves the maximum entropy among all probability distributions on $\{0,1,\ldots,n\}$ with mean…
The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…
In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…
A subset of a group is said to be product-free if it does not contain three elements satisfying the equation $xy=z$. We give a negative answer to a question of Babai and S\'os on the existence of large product-free sets by model theoretic…
Ellenberg and Gijswijt gave the best known asymptotic upper bound for the cardinality of subsets of $\mathbb F_q^n$ without 3-term arithmetic progressions. We improve this bound by a factor $\sqrt{n}$. In the case $q=3$, we also obtain more…
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 present a strengthening of the lemma on the lower bound of the slice rank by Tao (2016) motivated by the Croot-Lev-Pach-Ellenberg-Gijswijt bound on cap sets (2017, 2017). The Croot-Lev-Pach-Ellenberg-Gijswijt method and the lemma of Tao…
We prove that every subset of $\{1,\dots, N\}$ which does not contain any solutions to the equation $x+y+z=3w$ has at most $\exp(-c(\log N)^{1/5+o(1)})N$ elements, for some $c>0$. This theorem improves upon previous estimates. Additionally,…
We connect two classical results in extremal graph theory concerning the number of maximal independent sets. The maximum number mis$(n)$ of maximal independent sets in an $n$-vertex graph was determined by Moon and Moser. The maximum number…