English
Related papers

Related papers: Iterated sumset expansion in $\mathbb{F}_p^n$

200 papers

The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…

Number Theory · Mathematics 2017-06-27 Heng Zhou , Zhiqiang Xu

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Combinatorics · Mathematics 2024-08-20 Noah Kravitz

For $p$ prime, $A \subseteq \mathbb{Z}/p\mathbb{Z}$ and $\lambda \in \mathbb{Z}$, the sum of dilates $A + \lambda \cdot A$ is defined by \[A + \lambda \cdot A = \{a + \lambda a' : a, a' \in A\}.\] The basic problem on such sums of dilates…

Combinatorics · Mathematics 2024-09-26 David Conlon , Jeck Lim

Let $\mathfrak{g}$ be an algebra over $K$ with a bilinear operation $[\cdot,\cdot]:\mathfrak{g}\times\mathfrak{g}\rightarrow\mathfrak{g}$ not necessarily associative. For $A\subseteq\mathfrak{g}$, let $A^{k}$ be the set of elements of…

Rings and Algebras · Mathematics 2023-07-14 Daniele Dona

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

Let A and B be subsets of an elementary abelian 2-group G, none of which are contained in a coset of a proper subgroup. Extending onto potentially distinct summands a result of Hennecart and Plagne, we show that if |A+B|<|A|+|B|, then…

Combinatorics · Mathematics 2018-06-07 Chaim Even-Zohar , Vsevolod F. Lev

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

Dynamical Systems · Mathematics 2024-04-22 Ioannis Kousek , Tristán Radić

Let $\mathbb{F}_p$ be a prime field of order $p>2$, and $A$ be a set in $\mathbb{F}_p$ with very small size in terms of $p$. In this note, we show that the number of distinct cubic distances determined by points in $A\times A$ satisfies…

Combinatorics · Mathematics 2018-07-03 Doowon Koh , Hossein Nassajian Mojarrad , Thang Pham , Claudiu Valculescu

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Number Theory · Mathematics 2007-05-23 Ernie Croot

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

Combinatorics · Mathematics 2018-08-09 Pierre-Yves Bienvenu , Thái Hoàng Lê

We prove a Berry-Esseen theorem and Edgeworth expansions for partial sums of the form $S_N=\sum_{n=1}^{N}f_n(X_n,X_{n+1})$, where $\{X_n\}$ is a uniformly elliptic inhomogeneous Markov chain and $\{f_n\}$ is a sequence of uniformly bounded…

Probability · Mathematics 2021-11-09 Dmitry Dolgopyat , Yeor Hafouta

Existence of long arithmetic progression in sumsets and subset sums has been studied extensively in the field of additive combinatorics. These additive combinatorics results play a central role in the recent progress of fundamental problems…

Data Structures and Algorithms · Computer Science 2025-04-08 Lin Chen , Yuchen Mao , Guochuan Zhang

Given a subset $A$ of the $n$-dimensional Boolean hypercube $\mathbb{F}_2^n$, the sumset $A+A$ is the set $\{a+a': a, a' \in A\}$ where addition is in $\mathbb{F}_2^n$. Sumsets play an important role in additive combinatorics, where they…

Data Structures and Algorithms · Computer Science 2021-07-27 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f .…

Classical Analysis and ODEs · Mathematics 2026-05-07 Ushangi Goginava

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

Number Theory · Mathematics 2021-10-29 Oleksiy Klurman , Alexander P. Mangerel , Cosmin Pohoata , Joni Teräväinen

Let $G$ be a compact abelian group and $\phi_1, \phi_2, \phi_3$ be continuous endomorphisms on $G$. Under certain natural assumptions on the $\phi_i$'s, we prove the existence of Bohr sets in the sumset $\phi_1(A) + \phi_2(A) + \phi_3(A)$,…

Combinatorics · Mathematics 2025-09-03 Anh N. Le , Thái Hoàng Lê

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

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

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

Probability · Mathematics 2016-05-17 Iddo Ben-Ari , Steven J. Miller

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann