English
Related papers

Related papers: The sum-product problem for small sets

200 papers

Write $f_k({\boldsymbol \alpha};X)=\sum_{x\le X}e(\alpha_1x+\ldots +\alpha_kx^k)$ $(k\ge 3)$. We show that there is a set ${\mathfrak B}\subseteq [0,1)^{k-2}$ of full measure with the property that whenever $(\alpha_2,\ldots…

Number Theory · Mathematics 2023-09-29 Trevor D. Wooley

We study the extent to which sets A in Z/NZ, N prime, resemble sets of integers from the additive point of view (``up to Freiman isomorphism''). We give a direct proof of a result of Freiman, namely that if |A + A| < K|A| and |A| < c(K)N…

Number Theory · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

Let $G$ be a finite abelian group of order $n$ and let $\Delta_{n-1}$ denote the $(n-1)$-simplex on the vertex set $G$. The sum complex $X_{A,k}$ associated to a subset $A \subset G$ and $k < n$, is the $k$-dimensional simplicial complex…

Combinatorics · Mathematics 2018-01-22 Orr Beit-Aharon , Roy Meshulam

Let $\beta,\epsilon \in (0,1]$, and $k \geq \exp(122 \max\{1/\beta,1/\epsilon\})$. We prove that if $A,B$ are subsets of a prime field $\mathbb{Z}_{p}$, and $|B| \geq p^{\beta}$, then there exists a sum of the form $$S = a_{1}B \pm \ldots…

Combinatorics · Mathematics 2018-01-30 Tuomas Orponen , Laura Venieri

Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…

Number Theory · Mathematics 2015-05-18 Zhi-Wei Sun

We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…

Number Theory · Mathematics 2022-01-14 Dmitrii Zhelezov , Dömötör Pálvölgyi

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher…

Combinatorics · Mathematics 2018-06-20 G. Shakan , I. D. Shkredov

In the present paper we show that if A is a set of n real numbers, and the product set A.A has at most n^(1+c) elements, then the k-fold sumset kA has at least n^(log(k/2)/2 log 2 + 1/2 - f_k(c)) elements, where f_k(c) -> 0 as c -> 0. We…

Combinatorics · Mathematics 2009-04-15 Ernie Croot , Derrick Hart

Freiman's 2.4-Theorem states that any set $A \subset \mathbb{Z}_p$ satisfying $|2A| \leq 2.4|A| - 3 $ and $|A| < p/35$ can be covered by an arithmetic progression of length at most $|2A| - |A| + 1$. A more general result of Green and Ruzsa…

Combinatorics · Mathematics 2018-06-01 Pablo Candela , Oriol Serra , Christoph Spiegel

In this paper, we consider the sum-product problem of obtaining lower bounds for the size of the set $$\frac{A+A}{A+A}:=\left \{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right\},$$ for an arbitrary finite set $A$ of real numbers. The…

Combinatorics · Mathematics 2017-05-17 Oliver Roche-Newton

Fix integers a_1,...,a_d satisfying a_1 + ... + a_d = 0. Suppose that f : Z_N -> [0,1], where N is prime. We show that if f is ``smooth enough'' then we can bound from below the sum of f(x_1)...f(x_d) over all solutions (x_1,...,x_d) in Z_N…

Number Theory · Mathematics 2007-08-29 Ernie Croot

A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…

Number Theory · Mathematics 2018-08-28 Gregory A. Freiman , Oriol Serra , Christoph Spiegel

In this paper we obtain a new sum-product estimate in prime fields. In particular, we show that if $A\subseteq \mathbb{F}_p$ satisfies $|A|\le p^{64/117}$ then $$ \max\{|A\pm A|, |AA|\} \gtrsim |A|^{39/32}. $$ Our argument builds on and…

Combinatorics · Mathematics 2018-07-31 Changhao Chen , Bryce Kerr , Ali Mohammadi

For a finite set $A\subset\mathbb{N}$ and $k\in \mathbb{N}$, let $\omega_k(A) = \sum_{i\in A, i\neq k}1$. For each $n\in \mathbb{N}$, define $$a_{k, n}\ =\ |\{E\subset \mathbb{N}\,:\, E = \emptyset\mbox{ or } \omega_k(E) < \min E\leqslant…

Combinatorics · Mathematics 2024-05-31 Hung Viet Chu , Zachary Louis Vasseur

We make progress on two interrelated problems at the intersection of geometric measure theory, additive combinatorics and harmonic analysis: the discretised sum-product problem, and the dimension of Furstenberg sets. Along the way, we…

Classical Analysis and ODEs · Mathematics 2026-03-24 Tuomas Orponen , Pablo Shmerkin

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

Number Theory · Mathematics 2026-04-21 Xuancheng Shao

The sum of radii problem ($k$-MSR) asks, given a metric space on $n$ points, to place $k$ balls covering all points so as to minimize the sum of their radii. Despite extensive study from the perspectives of approximation and parameterized…

Data Structures and Algorithms · Computer Science 2026-05-08 Ameet Gadekar

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

In this paper we deduce some new supercongruences modulo powers of a prime $p>3$. Let $d\in\{0,1,\ldots,(p-1)/2\}$. We show that $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{2k}{k+d}}{8^k}\equiv 0\ (\mbox{mod}\ p)\ \ \ \mbox{if}\ d\equiv…

Number Theory · Mathematics 2013-10-31 Zhi-Wei Sun

In this paper we prove new bounds for sums of convex or concave functions. Specifically, we prove that for all $A,B \subseteq \mathbb R$ finite sets, and for all $f,g$ convex or concave functions, we have $$|A + B|^{38}|f(A) + g(B)|^{38}…

Combinatorics · Mathematics 2021-02-11 Sophie Stevens , Audie Warren