Search arXivSearch

arXiv · 2405.06523

Forms in prime variables and differing degrees

Abstract

Let $F_1,\ldots,F_R$ be homogeneous polynomials with integer coefficients in $n$ variables with differing degrees. Write $\boldsymbol{F}=(F_1,\ldots,F_R)$ with $D$ being the maximal degree. Suppose that $\boldsymbol{F}$ is a nonsingular system and $n\ge D^2 4^{D+6}R^5$. We prove an asymptotic formula for the number of prime solutions to $\boldsymbol{F}(\boldsymbol{x})=\boldsymbol{0}$, whose main term is positive if (i) $\boldsymbol{F}(\boldsymbol{x})=\boldsymbol{0}$ has a nonsingular solution over the $p$-adic units $\mathbb{U}_p$ for all primes $p$, and (ii) $\boldsymbol{F}(\boldsymbol{x})=\boldsymbol{0}$ has a nonsingular solution in the open cube $(0,1)^n$. This can be viewed as a smooth local-global principle for $\boldsymbol{F}(\boldsymbol{x})=\boldsymbol{0}$ with differing degrees. It follows that, under (i) and (ii), the set of prime solutions to $\boldsymbol{F}(\boldsymbol{x})=\boldsymbol{0}$ is Zariski dense in the set of its solutions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianya Liu, Sizhe Xie. 2024-05-10. Forms in prime variables and differing degrees. https://arxiv.org/abs/2405.06523

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT