Minimal Denominators Lying in Subsets of the Ring of Polynomials over a Finite Field
Abstract
Given a subset S⊂eq Fq[x] and fixed integers n,m∈ N, we study the distribution of the smallest denominator Q∈ S for which there exists P∈ Fq[x]m such that PQ-α<q-n, where α∈ x-1Fq((x-1))m is chosen randomly. We also consider the discrete analogue obtained by fixing a polynomial N∈ Fq[x] with (N)=n and sampling α uniformly from 1NFq[x]m. We prove that for any infinite subset S⊂eq Fq[x], for every n∈ 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.