English
Related papers

Related papers: Abundance of arithmetic progressions in some combi…

200 papers

We investigate the relationship between the dynamical properties of minimal topological dynamical systems and the multiplicative combinatorial properties of return time sets arising from those systems. In particular, we prove that for a…

Dynamical Systems · Mathematics 2019-09-17 Daniel Glasscock , Andreas Koutsogiannis , Florian K. Richter

The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…

Logic · Mathematics 2024-08-29 Rahman Mohammadpour

Renling Jin proved that if A and B are two subsets of the natural numbers with positive Banach density, then A+B is piecewise syndetic. In this paper, we prove that, under various assumptions on positive lower or upper densities of A and B,…

Number Theory · Mathematics 2017-08-09 Mauro Di Nasso , Isaac Goldbring , Renling Jin , Steven Leth , Martino Lupini , Karl Mahlburg

There are several notions of size for semigroups that have natural analogues for partial semigroups. Among these are thick, syndetic, central, piecewise syndetic, IP, J, and the more recently introduced notion of combinatorially rich,…

Combinatorics · Mathematics 2025-02-07 Arpita Ghosh , Neil Hindman

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

The goal of this paper is to make a surprising connection between several central conjectures in algebraic geometry: the Nonvanishing Conjecture, the Abundance Conjecture, and the Semiampleness Conjecture for nef line bundles on K-trivial…

Algebraic Geometry · Mathematics 2020-04-07 Vladimir Lazić , Thomas Peternell

A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…

Number Theory · Mathematics 2007-05-23 Terence Tao

In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present a simple modification to their method that strengthens…

Number Theory · Mathematics 2023-09-06 Thomas F. Bloom , Olof Sisask

If $A$ and $B$ are subsets of an abelian group, their sumset is $A+B:=\{a+b:a\in A, b\in B\}$. We study sumsets in discrete abelian groups, where at least one summand has positive upper Banach density. Renling Jin proved that if $A$ and $B$…

Number Theory · Mathematics 2025-07-15 John T. Griesmer

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

Combinatorics · Mathematics 2007-05-23 Terence Tao

Following the works of Furstenberg and Glasner on stationary means, we strengthen and extend in this paper some recent results by Di Nasso, Goldbring, Jin, Leth, Lupini and Mahlburg on piecewise syndeticity of product sets in countable…

Dynamical Systems · Mathematics 2016-06-03 Michael Björklund

We define and undertake a systematic study of thick, syndetic, and piecewise syndetic subsets of a Fra\"iss\'e structure. Each of these collections forms a family in the sense of Akin and Glasner [AG], and we define and study ultrafilters…

Dynamical Systems · Mathematics 2017-03-21 Andy Zucker

M. Beiglb\"ock, V. Bergelson, and A. Fish proved that if $G$ is a countable amenable group and $A$ and $B$ are subsets of $G$ with positive Banach density, then the product set $AB$ is piecewise syndetic. This means that there is a finite…

Combinatorics · Mathematics 2015-08-10 Mauro Di Nasso , Isaac Goldbring , Renling Jin , Steven Leth , Martino Lupini , Karl Mahlburg

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

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

We let $\mathcal{F}$ be a finite family of sets closed under taking unions and $\emptyset \not \in \mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\mathcal{F}$. In this notation, the classical…

Combinatorics · Mathematics 2023-05-31 Adam Kabela , Michal Polák , Jakub Teska

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

Group Theory · Mathematics 2010-04-22 Ben Fairbairn

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

A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…

Combinatorics · Mathematics 2007-05-23 Terence Tao