English
Related papers

Related papers: Arithmetic Progressions in the Graphs of Slightly …

200 papers

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

Number Theory · Mathematics 2007-09-23 Ben Green , Terence Tao

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

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…

Number Theory · Mathematics 2015-10-26 David Conlon , Jacob Fox , Yufei Zhao

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…

Combinatorics · Mathematics 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different…

Combinatorics · Mathematics 2014-11-11 Erik Sjöland

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

Number Theory · Mathematics 2007-05-23 Chunlei Liu

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

Number Theory · Mathematics 2016-11-21 Mei-Chu Chang

Szemer\'edi's theorem implies that there are $2^{o(n)}$ subsets of $[n]$ which do not contain a $k$-term arithmetic progression. A sparse analogue of this statement was obtained by Balogh, Morris, and Samotij, using the hypergraph container…

Combinatorics · Mathematics 2021-09-08 Rajko Nenadov

We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset…

Number Theory · Mathematics 2015-09-17 Xuancheng Shao

B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…

Dynamical Systems · Mathematics 2007-05-23 Bernard Host

Let the integers $1,\ldots,n$ be assigned colors. Szemer\'edi's theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing…

Combinatorics · Mathematics 2016-05-25 Maria Axenovich , Ryan R. Martin

Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…

Combinatorics · Mathematics 2020-11-26 Ben Green , Terence Tao

I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum…

Number Theory · Mathematics 2014-04-08 Gabor Korvin

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

Recently Conlon, Fox, and the author gave a new proof of a relative Szemer\'edi theorem, which was the main novel ingredient in the proof of the celebrated Green-Tao theorem that the primes contain arbitrarily long arithmetic progressions.…

Number Theory · Mathematics 2019-02-20 Yufei Zhao

Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…

Number Theory · Mathematics 2023-09-12 Brian Cook , Ákos Magyar , Tatchai Titichetrakun

In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic…

Differential Geometry · Mathematics 2018-12-24 Jean-François Lafont , D. B. McReynolds

It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…

Classical Analysis and ODEs · Mathematics 2023-04-21 Laurestine Bradford , Hannah Kohut , Yuveshen Mooroogen

A simultaneous arithmetic progression (s.a.p.) of length k consists of k points (x_i, y_\sigma(i)), where x_i and y_i are arithmetic progressions and \sigma is a permutation. Garcia-Selfa and Tornero asked whether there is a bound on the…

Number Theory · Mathematics 2014-04-22 Ryan Schwartz , József Solymosi , Frank de Zeeuw
‹ Prev 1 2 3 10 Next ›