Counting irreducible skew polynomials
arXiv:2611.04767
Abstract
We give a counting formula for the coefficients $a\in\F_{p^h}$ for which is irreducible in $\F_{p^h}[x;σ]$, for arbitrary positive integers and , where and is an arbitrary prime power. The proof reduces the problem to quadratic reduced norms, establishes a uniformity statement for every Frobenius generator, and counts the remaining coefficients by Möbius inversion.
arXiv comment23 pages