Weakly mixing sets of integers and polynomial equations

DOI10.1093/QMATH/HAW013zbMATH Open1426.37009arXiv1602.00343OpenAlexW2264312669MaRDI QIDQ2987017FDOQ2987017

Authors: Jakub Konieczny 

Publication date: 17 May 2017

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Abstract: We investigate polynomial patterns which can be guaranteed to appear in emph{weakly mixing} sets introduced by introduced by Furstenberg and studied by Fish. In particular, we prove that if $AsubsetmathbbN$ is a weakly mixing set and $p(x)inmathbbZ[x]$ a polynomial of odd degree with positive leading coefficient, then all sufficiently large integers $N$ can be represented as $N=n_1+n_2$, where $p(n_1)+m,p(n_2)+minA$ for some $minA$.

Full work available at URL: https://arxiv.org/abs/1602.00343

Recommendations

• Iterated differences sets, Diophantine approximations and applications
• Generalized Polynomials and Mild Mixing
• Sets of recurrence as bases for the positive integers
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials

zbMATH Keywords

positive densityweakly mixing setsnormal sets

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25) Density, gaps, topology (11B05)

Cited In (6)

• Generalized Polynomials and Mild Mixing
• Factors of generalised polynomials and automatic sequences
• Ergodic theorems for nonconventional arrays and an extension of the Szemerédi theorem
• Solvability of linear equations within weak mixing sets
• Iterated differences sets, Diophantine approximations and applications
• Some open problems on multiple ergodic averages

This page was built for publication: Weakly mixing sets of integers and polynomial equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2987017)