Related papers: Sets with no solutions to $x+y=3z$

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

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…

We prove that if $A\subseteq \{ 1,2,\dots, N \}$ does not contain any solution to the equation $x_1+\dots+x_k=y_1+\dots+y_k$ with distinct $x_1,\dots,x_k,y_1,\dots,y_k\in A$, then $|A|\ll {k^{3/2}}N^{1/k}.$

We refine previous results to provide examples, and in some cases precise classifications, of extremal subsets of {1,...,n} containing no solutions to a wide class of non-invariant, homogeneous linear equations in three variables, i.e.:…

We say that a set is a multiplicative 3-Sidon set if the equation $s_1s_2s_3=t_1t_2t_3$ does not have a solution consisting of distinct elements taken from this set. In this paper we show that the size of a multiplicative 3-Sidon subset of…

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

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a+b: a in A, b in B, and P(a,b) not=0}| where $P(x,y)\in F[x,y]$.

We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

The $3k-4$ conjecture in groups $\mathbb{Z}/p\mathbb{Z}$ for $p$ prime states that if $A$ is a nonempty subset of $\mathbb{Z}/p\mathbb{Z}$ satisfying $2A\neq \mathbb{Z}/p\mathbb{Z}$ and $|2A|=2|A|+r \leq \min\{3|A|-4,\;p-r-4\}$, then $A$ is…

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

In the Collatz 3x+1 problem, there are 3 possibilities: Starting from any positive number, we either reach the trivial loop (1,4,2), end up in a non-trivial loop, or go until infinity. In this paper, we shall show that if a non-trivial loop…

Let $p$ a large enough prime number. When $A$ is a subset of $\mathbb{F}_p\smallsetminus\{0\}$ of cardinality $|A|> (p+1)/3$, then an application of Cauchy-Davenport Theorem gives $\mathbb{F}_p\smallsetminus\{0\}\subset A(A+A)$. In this…

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

We derive exact and sharp lower bounds for the number of monochromatic generalized Schur triples $(x,y,x+ay)$ whose entries are from the set $\{1,\dots,n\}$, subject to a coloring with two different colors. Previously, only asymptotic…

We show that if G is a finite group and A is a subset of G with no non-trivial solutions to xz=yy then |A| < |G|/(log log |G|)^c.