On the sum of digits of $1/M$ in $\mathbb{F}_q[x]$
Zeev Rudnick

TL;DR
This paper investigates the digit sum behavior of 1/M in polynomial rings over finite fields, revealing no bias and contrasting with known phenomena over integers related to class numbers.
Contribution
It demonstrates that, unlike the integer case, the polynomial case over finite fields exhibits no bias in digit sums, using an elementary argument.
Findings
No bias in digit sums of 1/M over finite fields.
Contrast with integer case where bias relates to class numbers.
Elementary proof technique used.
Abstract
For certain primes , the average digit in the expansion of was found to have a deviation from random behaviour related to the class number of the imaginary quadratic field (Girstmair 1994). In this short note, we observe that for the corresponding problem when we replace the integers by polynomials over a finite field, there is never any bias. The argument is elementary.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Coding theory and cryptography
