中文
相关论文

相关论文: Roth's theorem for four variables and additive str…

200 篇论文

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…

数论 · 数学 2010-04-19 Mariah Hamel , Neil Lyall , Katherine Thompson , Nathan Walters

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

组合数学 · 数学 2026-05-08 Ruben Carpenter , Colin Defant , Noah Kravitz

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…

数论 · 数学 2026-05-06 Christian Táfula

Let $E\subset \mathbb{R}$ be a closed set of Hausdorff dimension $\alpha\in (0, 1)$. Let $P: \mathbb{R}\to \mathbb{R}$ be a polynomial without a constant term whose degree is bigger than one. We prove that if $E$ supports a probability…

经典分析与常微分方程 · 数学 2019-04-26 Robert Fraser , Shaoming Guo , Malabika Pramanik

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

数论 · 数学 2021-01-01 Adam J. Harper

For a polynomial $P$ of degree greater than one, we show the existence of patterns of the form $(x,x+t,x+P(t))$ with a gap estimate on $t$ in positive density subsets of the reals. This is an extension of an earlier result of Bourgain. Our…

组合数学 · 数学 2019-07-02 Polona Durcik , Shaoming Guo , Joris Roos

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

数论 · 数学 2024-02-26 David J. Grynkiewicz

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

数论 · 数学 2007-05-23 Jozsef Solymosi

Let $A,B$ be nonempty subsets of a an abelian group $G$. Let $N_i(A,B)$ denote the set of elements of $G$ having $i$ distinct decompositions as a product of an element of $A$ and an element of $B$. We prove that $$ \sum _{1\le i \le t} |N_i…

数论 · 数学 2008-04-17 Y. O. Hamidoune , O. Serra

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…

组合数学 · 数学 2018-06-01 Pablo Candela , Oriol Serra , Christoph Spiegel

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg…

组合数学 · 数学 2016-11-17 Antal Balog , Oliver Roche-Newton , Dmitry Zhelezov

Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The…

组合数学 · 数学 2021-08-19 Shalom Eliahou , Pastora Revuelta

This short note gives an upper bound on the measure of sets $A\subset [0,1]$ such that $x+y=3z$ has no solutions in $A$.

组合数学 · 数学 2012-01-04 Mate Matolcsi , Imre Z. Ruzsa

Let A be a subset of Z / NZ, and let R be the set of large Fourier coefficients of A. Properties of R have been studied in works of M.-C. Chang and B. Green. Our result is the following : the number of quadruples (r_1, r_2, r_3, r_4) \in…

数论 · 数学 2007-05-23 I. D. Shkredov

For a set $A$ of integers, the sumset $lA =A+...+A$ consists of those numbers which can be represented as a sum of $l$ elements of $A$ $$lA =\{a_1+... a_l| a_i \in A_i \}. $$ A closely related and equally interesting notion is that of…

数论 · 数学 2007-05-23 E. Szemeredi , V. Vu

We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…

数论 · 数学 2019-08-19 Khalid Younis

$R_+^{n\times n}$ denotes the set of $n\times n$ non-negative matrices. For $A\in R_+^{n\times n}$ let $\Omega(A)$ be the set of all matrices that can be formed by permuting the elements within each row of $A$. Formally: $$\Omega(A)=\{B\in…

环与代数 · 数学 2023-05-29 Gernot Michael Engel , Sergei Sergeev

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

组合数学 · 数学 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

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…

数据结构与算法 · 计算机科学 2025-04-08 Lin Chen , Yuchen Mao , Guochuan Zhang

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…

数论 · 数学 2026-01-14 Bhuwanesh Rao Patil , Mohan