English
Related papers

Related papers: Bounds in a popular multidimensional nonlinear Rot…

200 papers

We obtain smoothing estimates for certain nonlinear convolution operators on prime fields, leading to quantitative nonlinear Roth type theorems. Compared with the usual linear setting (i.e. arithmetic progressions), the nonlinear nature of…

Number Theory · Mathematics 2016-08-22 Jean Bourgain , Mei-Chu Chang

A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…

Metric Geometry · Mathematics 2007-05-23 Martin Grötschel , Martin Henk

The problem of looking for subsets of the natural numbers which contain no 3-term arithmetic progressions has a rich history. Roth's theorem famously shows that any such subset cannot have positive upper density. In contrast, Rankin in 1960…

Number Theory · Mathematics 2013-10-10 Nathan McNew

Green used an arithmetic analogue of Szemer\'edi's celebrated regularity lemma to prove the following strengthening of Roth's theorem in vector spaces. For every $\alpha>0$, $\beta<\alpha^3$, and prime number $p$, there is a least positive…

Combinatorics · Mathematics 2019-11-22 Jacob Fox , Huy Tuan Pham

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

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 $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

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

Classical Analysis and ODEs · Mathematics 2010-10-27 Neil Lyall , Akos Magyar

We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…

Combinatorics · Mathematics 2022-04-12 Vitaly Bergelson , Jake Huryn , Rushil Raghavan

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

Dynamical Systems · Mathematics 2015-11-19 Nikos Frantzikinakis , Bernard Host

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

We study the Ramsey properties of equations $a_1P(x_1) + \cdots + a_sP(x_s) = b$, where $a_1,\ldots,a_s,b$ are integers, and $P$ is an integer polynomial of degree $d$. Provided there are at least $(1+o(1))d^2$ variables, we show that…

Number Theory · Mathematics 2022-10-11 Jonathan Chapman , Sam Chow

We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…

Number Theory · Mathematics 2020-01-16 Borys Kuca

In this article we describe all possible infinite linear configurations that can be found in a shift of any set of positive upper Banach density. This simultaneously generalizes Szemer\'edi's theorem on arithmetic progressions and the…

Dynamical Systems · Mathematics 2026-03-11 Felipe Hernández

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

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

Consider multiple sums $S_n$ on the $d$-dimensional integer grid,which are generated by i.i.d.\ random variables with a positive expectation. We prove the strong law of large numbers, the law of the iterated logarithm and the distributional…

Probability · Mathematics 2017-09-05 Andrii Ilienko , Ilya Molchanov

We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…

Number Theory · Mathematics 2025-04-22 Andrew Lott , Ákos Magyar , Giorgis Petridis , János Pintz

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

Algebraic Geometry · Mathematics 2024-02-21 Arthur Bik , Jan Draisma , Rob Eggermont , Andrew Snowden

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

Computational Complexity · Computer Science 2013-09-24 Armin Hemmerling