Search arXivSearch

arXiv · 2510.07787

Minimal Denominators Lying in Subsets of the Ring of Polynomials over a Finite Field

Abstract

Given a subset $\mathcal{S}\subseteq \mathbb{F}_q[x]$ and fixed integers $n,m\in \mathbb{N}$, we study the distribution of the smallest denominator $Q\in \mathcal{S}$ for which there exists $\mathbf{P}\in \mathbb{F}_q[x]^m$ such that $\left\Vert\frac{\mathbf{P}}{Q}-\boldsymbolα\right\Vert<q^{-n}$, where $\boldsymbolα\in x^{-1}\mathbb{F}_q((x^{-1}))^m$ is chosen randomly. We also consider the discrete analogue obtained by fixing a polynomial $N\in \mathbb{F}_q[x]$ with $°(N)=n$ and sampling $\boldsymbolα$ uniformly from $\frac{1}{N}\mathbb{F}_q[x]^m$. We prove that for any infinite subset $\mathcal{S}\subseteq \mathbb{F}_q[x]$, for every $n\in \mathbb{N}$ and every dimension $m$, the probability distributions of these two random variables coincide. This result is significantly stronger than the corresponding statement in the real setting, where Balazard and Martin showed that the averages of the discrete and continuous smallest denominator functions are asymptotically close.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noy Soffer Aranov. 2026-03-24. Minimal Denominators Lying in Subsets of the Ring of Polynomials over a Finite Field. https://arxiv.org/abs/2510.07787

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