English
Related papers

Related papers: The Erd\H{o}s-Szemer\'edi problem on sum set and p…

200 papers

The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y :…

Number Theory · Mathematics 2014-01-21 Steven J. Miller , Kevin Vissuet

Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja

Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and…

Number Theory · Mathematics 2020-02-28 Qinghai Zhong

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

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…

Combinatorics · Mathematics 2020-11-17 Pablo Candela , Diego González-Sánchez , David J. Grynkiewicz

The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In…

Combinatorics · Mathematics 2013-05-07 J. A. Dias da Silva , Pedro J. Freitas

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Classical Analysis and ODEs · Mathematics 2024-06-17 Paige Bright , Caleb Marshall

Given a subset of real numbers $A$ with small product $AA$ we obtain a new upper bound for the additive energy of $A$. The proof uses a natural observation that level sets of convolutions of the characteristic function of $A$ have small…

Combinatorics · Mathematics 2019-11-28 Konstantin I. Olmezov , Aliaksei S. Semchankau , Ilya D. Shkredov

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…

Combinatorics · Mathematics 2025-04-15 Dingyuan Liu , Letícia Mattos , Tibor Szabó

Let $A, B\subseteq \mathbb{R}^2$ be finite, nonempty subsets, let $s\geq 2$ be an integer, and let $h_1(A,B)$ denote the minimal number $t$ such that there exist $2t$ (not necessarily distinct) parallel lines,…

Combinatorics · Mathematics 2007-10-17 David J. Grynkiewicz , Oriol Serra

The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors.…

Number Theory · Mathematics 2021-11-08 Peter J. Bradshaw

Following a growing number of studies that, over the past 15 years, have established entropy inequalities via ideas and tools from additive combinatorics, in this work we obtain a number of new bounds for the differential entropy of sums,…

Information Theory · Computer Science 2025-11-20 Rupert Li , Lampros Gavalakis , Ioannis Kontoyiannis

Let $G$ be a multiplicative finite group and $S=a_1\cdot\ldots\cdot a_k$ a sequence over $G$. We call $S$ a product-one sequence if $1=\prod_{i=1}^ka_{\tau(i)}$ holds for some permutation $\tau$ of $\{1,\ldots,k\}$. The small Davenport…

Combinatorics · Mathematics 2018-11-27 Dongchun Han , Hanbin Zhang

In this paper we study sum-free subsets of the set $\{1,...,n\}$, that is, subsets of the first $n$ positive integers which contain no solution to the equation $x + y = z$. Cameron and Erd\H{o}s conjectured in 1990 that the number of such…

Combinatorics · Mathematics 2014-02-26 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij

We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…

Combinatorics · Mathematics 2016-05-17 Anne de Roton

We obtain a bounded generation theorem over $\mathcal O/\mathfrak a$, where $\mathcal O$ is the ring of integers of a number field and $\mathfrak a$ a general ideal of $\mathcal O$. This addresses a conjecture of Salehi-Golsefidy. Along the…

Number Theory · Mathematics 2024-12-10 Jincheng Tang , Xin Zhang

The Erd\H{o}s primitive set conjecture states that the sum $f(A) = \sum_{a\in A}\frac{1}{a\log a}$, ranging over any primitive set $A$ of positive integers, is maximized by the set of prime numbers. Recently Laib, Derbal, and Mechik proved…

Number Theory · Mathematics 2023-05-09 Jared Duker Lichtman

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set…

Combinatorics · Mathematics 2017-04-05 Brendan Murphy , Oliver Roche-Newton , Ilya Shkredov

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