English
Related papers

Related papers: Popular progression differences in vector spaces I…

200 papers

In the random geometric graph model $\mathsf{Geo}_d(n,p)$, we identify each of our $n$ vertices with an independently and uniformly sampled vector from the $d$-dimensional unit sphere, and we connect pairs of vertices whose vectors are…

Probability · Mathematics 2021-11-23 Siqi Liu , Sidhanth Mohanty , Tselil Schramm , Elizabeth Yang

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

Combinatorics · Mathematics 2022-12-20 Adrian Dumitrescu , Csaba D. Tóth

We study the sizes of delta-additive sets of unit vectors in a d-dimensional normed space: the sum of any two vectors has norm at most delta. One-additive sets originate in finding upper bounds of vertex degrees of Steiner Minimum Trees in…

Metric Geometry · Mathematics 2010-06-08 Konrad J. Swanepoel

Which finite sets $P \subseteq \mathbb{Z}^r$ with $|P| \ge 3$ have the following property: for every $A \subseteq [N]^r$, there is some nonzero integer $d$ such that $A$ contains $(\alpha^{|P|} - o(1))N^r$ translates of $d \cdot P = \{d p :…

Combinatorics · Mathematics 2021-08-02 Ashwin Sah , Mehtaab Sawhney , Yufei Zhao

Despite the widespread use of boosting in structured prediction, a general theoretical understanding of aggregation beyond scalar prediction remains incomplete. We study vector-valued prediction under a target divergence and identify a…

Machine Learning · Computer Science 2026-05-12 Jian Qian , Shu Ge

We establish the following quantitative form of the Green--Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions of length $k\geq 4$, then $\delta\ll…

Number Theory · Mathematics 2026-03-11 Joni Teräväinen , Mengdi Wang

In the present paper we prove a certain lemma about the structure of "lower level-sets of convolutions", which are sets of the form $\{x \in \Z_N : 1_A*1_A(x) \leq \gamma N\}$ or of the form $\{x \in \Z_N : 1_A*1_A(x) < \gamma N\}$, where…

Combinatorics · Mathematics 2012-02-23 Ernie Croot

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

Number Theory · Mathematics 2025-12-23 Anup B. Dixit , Nikhil S Kumar

We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…

Combinatorics · Mathematics 2013-09-04 Xuancheng Shao

For any integer $n \geq 2$, let $(m_{1},\ldots,m_{n})$ be a strictly increasing $n$-tuple of positive integers. We show that any subset $A\subset [N]^n$ of density at least $(\log N)^{-c}$ contains a nontrivial configuration of the form…

Number Theory · Mathematics 2026-05-08 Jingwei Guo , Changxing Miao , Guoqing Zhan

We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…

Combinatorics · Mathematics 2020-04-07 Ross Berkowitz , Ashwin Sah , Mehtaab Sawhney

For $\alpha>1$, set $\beta=1/(\alpha-1)$. We show that, for every $1<\alpha<(\sqrt{21}+4)/5\approx1.717$, the number of pairs $(m,n)$ of positive integers with $d=\lfloor{n^\alpha}\rfloor - \lfloor{m^\alpha}\rfloor$ is equal to…

Number Theory · Mathematics 2025-03-18 Yuuya Yoshida

We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…

Metric Geometry · Mathematics 2019-05-14 Jonathan M. Fraser , Han Yu

Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…

Combinatorics · Mathematics 2019-04-12 Jacob Fox , László Miklós Lovász , Yufei Zhao

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

Classical Analysis and ODEs · Mathematics 2015-01-20 Marc Carnovale

It is a well-known fact that in a Lipschitz domain \Omega\subset R^n a p-Hardy inequality, with weight d(x,\partial\Omega)^\beta, holds for all u\in C_0^\infty(\Omega) whenever \beta<p-1. We show that actually the same is true under the…

Functional Analysis · Mathematics 2015-12-23 Juha Lehrbäck

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

Number Theory · Mathematics 2019-02-20 Eric Naslund

In this paper we show that if $A$ is a subset of the primes with positive relative density $\delta$, then $A+A$ must have positive upper density $C_1\delta e^{-C_2(\log(1/\delta))^{2/3}(\log\log(1/\delta))^{1/3}}$ in $\mathbb{N}$. Our…

Number Theory · Mathematics 2014-02-26 Karsten Chipeniuk , Mariah Hamel

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

Let $\mathcal{P}(n)$ denote the power set of $[n]$, ordered by inclusion, and let $\mathcal{P}(n,p)$ be obtained from $\mathcal{P}(n)$ by selecting elements from $\mathcal{P}(n)$ independently at random with probability $p$. A classical…

Combinatorics · Mathematics 2014-10-06 József Balogh , Richard Mycroft , Andrew Treglown