English
Related papers

Related papers: Abundance of arithmetic progressions in $\mathcal{…

200 papers

A geometric progression of length $k$ and integer ratio is a set of numbers of the form $\{a,ar,\dots,ar^{k-1}\}$ for some positive real number $a$ and integer $r\geq 2$. For each integer $k \geq 3$, a greedy algorithm is used to construct…

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson , Kevin O'Bryant

In this paper we study ergodic $\mathbb{Z}^r$-actions and investigate expansion properties along cyclic subgroups. We show that under some spectral conditions there are always directions which expand significantly a given measurable set…

Dynamical Systems · Mathematics 2024-12-11 Michael Björklund , Alexander Fish

Given two sets $\cA, \cB \subseteq \F_q$ of elements of the finite field $\F_q$ of $q$ elements, we show that the productset $$ \cA\cB = \{ab | a \in \cA, b \in\cB\} $$ contains an arithmetic progression of length $k \ge 3$ provided that…

Number Theory · Mathematics 2007-11-13 Igor E. Shparlinski

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

We present a new model of homogeneous aggregation that contains the essential physical ideas of the classical predecessors, the Becker-Doring and Lifshitz-Slyovoz models. These classical models, which give different predictions, are…

Statistical Mechanics · Physics 2008-10-23 Yossi Farjoun

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ó

The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…

Combinatorics · Mathematics 2018-10-19 Arpita Ghosh

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

Number Theory · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

We study some variants of the Erd\H{o}s similarity problem. We pose the question if every measurable subset of the real line with positive measure contains a similar copy of an infinite geometric progression. We construct a compact subset…

Metric Geometry · Mathematics 2023-10-20 Alex Burgin , Samuel Goldberg , Tamás Keleti , Connor MacMahon , Xianzhi Wang

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 shown that for a finite set $A$ of four or more complex numbers, the cardinality of the set $C[A]$ of all cross-ratios generated by quadruples of pair-wise distinct elements of $A$ is $|C[A]|\gg…

Combinatorics · Mathematics 2017-05-05 Misha Rudnev

We prove that if a Bessel sequence in a Hilbert space, that is indexed by a countably infinite group in an invariant manner, can be partitioned into finitely many Riesz basic sequences, then each of the sets in the partition can be chosen…

Operator Algebras · Mathematics 2010-01-26 Vern I. Paulsen

Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…

Dynamical Systems · Mathematics 2007-05-23 Nikos Frantzikinakis , Bryna Kra

Beiglboeck, Bergelson and Fish proved that if subsets A,B of a countable discrete amenable group G have positive Banach densities a and b respectively, then the product set AB is piecewise syndetic, i.e. there exists k such that the union…

Combinatorics · Mathematics 2016-05-06 Mauro Di Nasso , Martino Lupini

Let $p$ be a prime number, and $h$ a positive integer such that $\gcd(p,h)=1$. We prove, without invoking Dirichlet's theorem, that the arithmetic progression $p\left(\mathbf{N}\cup \{0\}\right)+h$ contains infinitely many prime numbers.…

General Mathematics · Mathematics 2023-11-21 Jhixon Macías

Consider a stochastic process $(S_{[a_i,b_i]})_{[a_i,b_i] \subset \mathbb{N}}$, which is indexed by the collection of all nonempty intervals $[a_i,b_i] \subset \mathbb{N}$ and which is stationary under translations of the intervals. It was…

Dynamical Systems · Mathematics 2016-12-19 Nikita Moriakov

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…

Classical Analysis and ODEs · Mathematics 2017-11-13 Itay Londner

The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…

Combinatorics · Mathematics 2022-09-20 Leonardo N. Coregliano , Maryanthe Malliaris

We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs…

Combinatorics · Mathematics 2008-04-01 Ernie Croot , Olof Sisask