2000 character limit reached
Polynomial configurations in dense subsets of the prime lattice
Published 19 Apr 2025 in math.NT | (2504.14424v1)
Abstract: 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 relative upper density. We show that A contains all polynomial configurations of the form $x+P_0(y)v_0,\ldots, x+P_l(y)v_l$, for some $x$ in $\mathbb{Z}d$ and $y$ in $\mathbb{N}$, which satisfy a certain non-degeneracy condition. We also obtain quantitative bounds on the size of such polynomial configuration, if $A$ is a subset of the first $N$ positive integers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.