English
Related papers

Related papers: On sets with small additive doubling in product se…

200 papers

We obtain a Poisson Limit for return times to small sets for product systems. Only one factor is required to be hyperbolic while the second factor is only required to satisfy polynomial deviation bounds for ergodic sums. In particular, the…

Dynamical Systems · Mathematics 2023-12-13 Max Auer

We establish that every set of $k=10$ natural numbers determines at least $30$ distinct pairwise sums or at least $30$ distinct pairwise products, as well as the analogous result for $k=11$ and at least $34$ sums/products, with sharpness…

Combinatorics · Mathematics 2026-03-06 Phillip Antis , Holden Britt , Caleigh Chapman , Elizabeth Hawkins , Alex Rice , Elyse Warren

In their proof of the IP Szemer\'edi theorem, a far reaching extension of the classic theorem of Szemer\'edi on arithmetic progressions, Furstenberg and Katznelson introduced an important class of additively large sets called…

Combinatorics · Mathematics 2016-11-01 Vitaly Bergelson , Daniel Glasscock

Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove…

Combinatorics · Mathematics 2026-04-30 Lampros Gavalakis , Marcel K. Goh , Ioannis Kontoyiannis

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

Number Theory · Mathematics 2024-09-25 Kaimin Cheng , Shuhong Gao

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

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ó

This study delves into the exploration of the limiting shape theorem for subadditive processes on finitely generated groups with polynomial growth, commonly referred to as virtually nilpotent groups. Investigating the algebraic structures…

Probability · Mathematics 2024-04-26 Cristian F. Coletti , Lucas R. de Lima

In 1993, Fishburn and Graham established the following qualitative extension of the classical Erd\H{o}s-Szekeres theorem. If $N$ is sufficiently large with respect to $n$, then any $N\times N$ real matrix contains an $n\times n$ submatrix…

Combinatorics · Mathematics 2023-05-12 Recep Altar Çiçeksiz , Zhihan Jin , Eero Räty , István Tomon

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

Combinatorics · Mathematics 2021-08-19 Shalom Eliahou , Cédric Lecouvey

Let $(G_n)_{n\geqslant 0}$ be a linear recurrence sequence defining a numeration system and satisfying mild structural hypotheses. For real-valued G-additive functions (additive in the greedy G-digits), we establish an…

Number Theory · Mathematics 2026-01-23 Johann Verwee

Given a sequence of integers $a_j, j\ge 1,$ a multiset is a combinatorial object composed of unordered components, such that there are exactly $a_j$ one-component multisets of size $j.$ When $a_j\asymp j^{r-1} y^j$ for some $r>0$, $y\geq…

Combinatorics · Mathematics 2007-06-13 Boris L. Granovsky , Dudley Stark

This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…

Combinatorics · Mathematics 2017-01-09 Brendan Murphy , Giorgis Petridis

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositions of polynomial sequences. In particular, they showed that when $k \geq 3$, each infinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicatively irreducible.…

Number Theory · Mathematics 2025-04-22 Chi Hoi Yip

In this note, we prove that if $A$ is a finite set of real numbers such that $|AA| = K|A|$, then for every polynomial $f \in \mathbb{R}[x,y]$ we have that $|f(A,A)| = \Omega_{K,\operatorname{deg} f}(|A|^2)$, unless $f$ is of the form…

Combinatorics · Mathematics 2019-05-10 Cosmin Pohoata

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p…

Number Theory · Mathematics 2016-10-04 Ilya D. Shkredov

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…

Number Theory · Mathematics 2016-10-10 Khristo N. Boyadzhiev

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

Combinatorics · Mathematics 2015-06-02 Przemysław Mazur

In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2…

Number Theory · Mathematics 2018-03-06 Ilya D. Shkredov