English
Related papers

Related papers: Intersective polynomials and polynomial Szemeredi …

200 papers

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

Dynamical Systems · Mathematics 2014-09-29 Vitaly Bergelson , Donald Robertson

The polynomial Szemer\'{e}di theorem implies that, for any $\delta \in (0,1)$, any family $\{P_1,\ldots, P_m\} \subset \mathbb{Z}[y]$ of nonconstant polynomials with constant term zero, and any sufficiently large $N$, every subset of…

Combinatorics · Mathematics 2025-03-21 Vitaly Bergelson , Andrew Best

Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…

Dynamical Systems · Mathematics 2016-09-28 Andreas Koutsogiannis

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

Number Theory · Mathematics 2025-06-17 Daniel Altman , Mehtaab Sawhney

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

We prove a low characteristic counterpart to the main result in (Peluse, 2019), establishing power saving bounds for the polynomial Szemer\'{e}di theorem for certain families of polynomials. Namely, we show that if $P_1, \dots, P_m \in…

Number Theory · Mathematics 2023-03-03 Ethan Ackelsberg , Vitaly Bergelson

Intersective polynomials are polynomials in $\Z[x]$ having roots every modulus. For example, $P_1(n)=n^2$ and $P_2(n)=n^2-1$ are intersective polynomials, but $P_3(n)=n^2+1$ is not. The purpose of this note is to deduce, using results of…

Number Theory · Mathematics 2009-10-13 Thai Hoang Le

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

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Number Theory · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter

We present a structure theorem for the multiple non-cyclotomic irreducible factors appearing in the family of all univariate polynomials with a given set of coefficients and varying exponents. Roughly speaking, this result shows that the…

Number Theory · Mathematics 2015-09-04 F. Amoroso , M. Sombra , U. Zannier

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Number Theory · Mathematics 2016-02-08 Tigran Hakobyan

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Combinatorics · Mathematics 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

We demonstrate that the phenomenon of popular differences (aka the phenomenon of large intersections) holds for natural families of polynomial patterns in rings of integers of number fields. If $K$ is a number field with ring of integers…

Dynamical Systems · Mathematics 2024-04-29 Ethan Ackelsberg , Vitaly Bergelson

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

Number Theory · Mathematics 2019-05-29 Sarah Peluse

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

In this article, we investigate polynomial generalizations of the van der Waerden theorem with a focus on largeness properties of recurrence patterns. We prove an $IP_r^\star$-strengthened version of the polynomial van der Waerden theorem,…

Combinatorics · Mathematics 2025-07-31 Sayan Goswami

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

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

Number Theory · Mathematics 2023-01-10 Hong Liu , Péter Pál Pach , Csaba Sándor

Let $p_1,...,p_L\in Z[x_1,...,x_d]$ be non-constant polynomials with zero constant term. The ergodic theoretical proofs of the polynomial and the IP-polynomial Szemeredi theorems as well as some of the ergodic-theoretical and combinatorial…

Dynamical Systems · Mathematics 2026-05-25 Vitaly Bergelson , Rigoberto Zelada

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman
‹ Prev 1 2 3 10 Next ›