Counting irreducible polynomials with prescribed coefficients over a finite field
Combinatorics
2021-09-07 v1 Number Theory
Abstract
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by equivalent classes of polynomials with prescribed coefficients. Simplified expressions are derived for some special cases. Our results extend some earlier results.
Keywords
Cite
@article{arxiv.2109.02000,
title = {Counting irreducible polynomials with prescribed coefficients over a finite field},
author = {Zhicheng Gao and Simon Kuttner and Qiang Wang},
journal= {arXiv preprint arXiv:2109.02000},
year = {2021}
}
Comments
29 pages