English
Related papers

Related papers: A polylogarithmic bound in the nonlinear Roth theo…

200 papers

We show that there exists $c>0$ such that any subset of $\{1, \dots, N\}$ of density at least $(\log\log{N})^{-c}$ contains a nontrivial progression of the form $x,x+y,x+y^2$. This is the first quantitatively effective version of the…

Number Theory · Mathematics 2022-01-10 Sarah Peluse , Sean Prendiville

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

Number Theory · Mathematics 2024-07-12 Sarah Peluse , Sean Prendiville , Xuancheng Shao

We give two Roth theorems, related to the nonlinear configuration $x$, $x+P_1(t)$, $x+P_2(t)$ involving two polynomials, for sets in $\mathbb{R}$ of positive density and of fractional dimensions. The proof uses Fourier analysis.

Classical Analysis and ODEs · Mathematics 2020-09-01 Xuezhi Chen , Jingwei Guo , Xiaochun Li

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

Classical Analysis and ODEs · Mathematics 2019-01-08 Ben Krause

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

Number Theory · Mathematics 2025-11-12 Xuancheng Shao , Mengdi Wang

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

Classical Analysis and ODEs · Mathematics 2023-07-04 Xuezhi Chen , Jingwei Guo

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

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

Combinatorics · Mathematics 2014-08-13 Tomasz Schoen , Olof Sisask

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

For a polynomial $P$ of degree greater than one, we show the existence of patterns of the form $(x,x+t,x+P(t))$ with a gap estimate on $t$ in positive density subsets of the reals. This is an extension of an earlier result of Bourgain. Our…

Combinatorics · Mathematics 2019-07-02 Polona Durcik , Shaoming Guo , Joris Roos

We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an…

Number Theory · Mathematics 2011-06-09 Tomasz Schoen , Ilya D. Shkredov

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

Number Theory · Mathematics 2019-02-20 Eric Naslund

We prove that for any function $f$ satisfying certain mild conditions and any Cantor set $K$ with Newhouse thickness greater than $1$, there exists $x\in K$ and $t>0$ such that \[ \{x-t,x,x+f(t)\}\subset K. \] This is an extension of…

Classical Analysis and ODEs · Mathematics 2026-01-23 Alex McDonald , Micah Nguyen

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ containing no nontrivial configurations of the form $(x,y),(x,y+z),(x,y+2z),(x+z,y)$ must have density…

Combinatorics · Mathematics 2023-12-14 Sarah Peluse

Let $E\subset \mathbb{R}$ be a closed set of Hausdorff dimension $\alpha\in (0, 1)$. Let $P: \mathbb{R}\to \mathbb{R}$ be a polynomial without a constant term whose degree is bigger than one. We prove that if $E$ supports a probability…

Classical Analysis and ODEs · Mathematics 2019-04-26 Robert Fraser , Shaoming Guo , Malabika Pramanik

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

Number Theory · Mathematics 2021-01-06 Sarah Peluse

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

We give a new proof of logarithmic bounds for Roth's theorem on arithmetic progressions, namely that if $A \subset \{1,2,\ldots,N\}$ is free of three-term progressions, then $\lvert A\rvert \leq N/(\log N)^{1-o(1)}$. Unlike previous proofs,…

Combinatorics · Mathematics 2019-05-10 Thomas F. Bloom , Olof Sisask
‹ Prev 1 2 3 10 Next ›