Search arXivSearch

arXiv · 2607.09799

Affine monodromy and exact value distributions over finite fields

Abstract

We study finite field value distributions through the fixed-point statistics of monodromy groups. For a regular degree-\(n\) cover, omitted values are controlled by derangements. Thus natural symmetric monodromy gives support density \(1-D_n/n!\to 1-e^{-1}\), while the Cameron--Cohen bound gives the universal ceiling \(1-1/n\), attained by sharply \(2\)-transitive affine monodromy. We give an explicit polynomial realization of this optimal mechanism. For \(N=p^e\) and \(h\mid N-1\), set \[ Λ_{N,h}(U)=U\bigl(U^{(N-1)/h}-1\bigr)^h . \] Its geometric Galois closure is rational, \[ U=z^h, \qquad T=(z^N-z)^h, \] and its geometric monodromy is the affine group \((\F_N,+)\rtimes H_h\). For every extension \(\F_Q/\F_p\) we compute the complete fibre enumerator of \(Λ_{N,h}\) exactly, including the nonregular cases. In the full affine case \(h=N-1\), the polynomial \[ U(U-1)^{N-1} \] attains the Wan--Shiue--Chen upper bound for non-permutation polynomials over every finite field containing \(\F_N\); over arbitrary extensions we compute the exact defect from that bound.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Kumallagov. 2026-07-09. Affine monodromy and exact value distributions over finite fields. https://arxiv.org/abs/2607.09799

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