English
Related papers

Related papers: On the Furstenberg-Katznelson constant for the IP …

200 papers

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

Let $\mathcal C= \{k_1<k_2 < \cdots\}$ be Cantor set of integers, that is a set of integers with restricted digits modulo a base $b$, and suppose $0$ is one of the restricted digits. We show that $$ \liminf_N \Expectation_{n\in [N]} m(A\cap…

Number Theory · Mathematics 2026-02-18 Alex Burgin , Anastasios Fragkos , Michael T. Lacey , Dario Mena , Maria Carmen Reguera

In their proof of the IP Szemer\'edi theorem, a far reaching extension of the classic theorem of Szemer\'edi on arithmetic progressions, Furstenberg and Katznelson introduced an important class of additively large sets called…

Combinatorics · Mathematics 2016-11-01 Vitaly Bergelson , Daniel Glasscock

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

Dynamical Systems · Mathematics 2012-08-23 Nikos Frantzikinakis , Mate Wierdl

We develop a framework for the study of the limiting behavior of multiple ergodic averages with commuting transformations when all iterates are given by the same sparse sequence; this enables us to partially resolve several longstanding…

Dynamical Systems · Mathematics 2025-11-20 Nikos Frantzikinakis , Borys Kuca

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

Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0…

Combinatorics · Mathematics 2014-02-26 Ben Green , Terence Tao

We exhibit proofs of two ergodic-theoretic results in the study of multiple recurrence using an analog of the density-increment argument of Roth and Gowers: Furstenberg's Multiple Recurrence Theorem (which implies Szemer\'edi's Theorem),…

Dynamical Systems · Mathematics 2013-07-23 Tim Austin

The paper is primarily concerned with the asymptotic behavior as $N\to\infty$ of averages of nonconventional arrays having the form $N^{-1}\sum_{n=1}^N\prod_{j=1}^\ell T^{P_j(n,N)}f_j$ where $f_j$'s are bounded measurable functions, $T$ is…

Dynamical Systems · Mathematics 2017-11-30 Yuri Kifer

Furstenberg's multiple recurrence result for measure theoretic dynamical systems is proved for compact C*-dynamical systems for which the evolution is given by a semigroup with the right cancellation property, a right invariant measure and…

Operator Algebras · Mathematics 2007-05-23 Conrad Beyers , Rocco Duvenhage , Anton Stroh

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

In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…

Dynamical Systems · Mathematics 2010-06-09 Tim Austin

A remarkable result of Bergelson, Tao and Ziegler implies that if $c>0$, $k$ is a positive integer, $p\geq k$ is a prime, $n$ is sufficiently large, and $f:\mathbb F_p^n\to\mathbb C$ is a function with $\|f\|_\infty\leq 1$ and…

Combinatorics · Mathematics 2017-12-04 W. T. Gowers , Luka Milićević

Furstenberg, Katznelson and Weiss proved in the early 1980s that every measurable subset of the plane with positive density at infinity has the property that all sufficiently large real numbers are realised as the Euclidean distance between…

Combinatorics · Mathematics 2013-01-18 Ian D. Morris

We establish improved finite field Szemeredi-Trotter and Beck type theorems. First we show that if P and L are a set of points and lines respectively in the plane F_p^2, with |P|,|L| \leq N and N<p, then there are at most C_1…

Combinatorics · Mathematics 2012-06-21 Timothy G. F. Jones

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T_1, T_2, >..., T_d: \bbZ\curvearrowright (X,\S,\mu), and so, via the Furstenberg correspondence…

Dynamical Systems · Mathematics 2009-03-09 Tim Austin

The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem) can be formulated in the language of von Neumann algebras as follows: given an integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an…

Operator Algebras · Mathematics 2010-07-21 Tim Austin , Tanja Eisner , Terence Tao

We show the $L^2$-convergence of continuous time ergodic averages of a product of functions evaluated at return times along polynomials. These averages are the continuous time version of the averages appearing in Furstenberg's proof of…

Dynamical Systems · Mathematics 2010-09-30 Amanda Potts

We establish a version of the Furstenberg-Katznelson multi-dimensional Szemer\'edi in the primes ${\mathcal P} := \{2,3,5,\ldots\}$, which roughly speaking asserts that any dense subset of ${\mathcal P}^d$ contains constellations of any…

Number Theory · Mathematics 2013-12-03 Terence Tao , Tamar Ziegler

Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…

Combinatorics · Mathematics 2017-08-30 Jacob Fox , Huy Tuan Pham
‹ Prev 1 2 3 10 Next ›