Search arXivSearch

arXiv · 2412.19728

On the distribution of polynomial Farey points and Chebyshev's bias phenomenon

Abstract

We study two types of problems for polynomial Farey fractions. For a positive integer $Q$, and polynomial $P(x)\in\mathbb{Z}[X]$ with $P(0)=0$, we define polynomial Farey fractions as \[\mathcal{F}_{Q,P}:=\left\{\frac{a}{q}: 1\leq a\leq q\leq Q,\ \gcd (P(a),q)=1\right\}.\] The classical Farey fractions are obtained by considering $P(x)=x$. In this article, we determine the global and local distribution of the sequence of polynomial Farey fractions via discrepancy and pair correlation measure, respectively. In particular, we establish that the sequence of polynomial Farey fractions is uniformly distributed modulo one and show that the limit superior of the pair correlation measure of $(\mathcal{F}_{Q,P})_{Q\ge1}$ is bounded. For the specific polynomial $P(x)=x(x+1)$, we show the existence of the limiting pair correlation measure of $(\mathcal{F}_{Q,P})_{Q\ge1}$ and also provide an explicit formula for the pair correlation function which is non-Poissonian. Further, restricting the polynomial Farey denominators to certain subsets of primes, we explicitly find the pair correlation measure and show it to be Poissonian. Finally, we study Chebyshev's bias type of questions for the classical and polynomial Farey denominators along arithmetic progressions and obtain an $Ω$-result for the error term of its counting function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bittu Chahal, Sneha Chaubey. 2025-09-02. On the distribution of polynomial Farey points and Chebyshev's bias phenomenon. https://arxiv.org/abs/2412.19728

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