# Generating series for irreducible polynomials over finite fields

**Authors:** Arnaud Bodin

arXiv: 0910.1680 · 2009-10-16

## TL;DR

This paper develops generating series and formulas to count irreducible polynomials over finite fields in multiple variables, providing exact and asymptotic results for various cases including multi-degree and indecomposability.

## Contribution

It introduces new generating series and formulas for counting irreducible polynomials over finite fields in multiple variables, extending previous work.

## Key findings

- Derived explicit formulas for counting irreducible polynomials
- Provided asymptotic approximations for large degrees
- Analyzed cases of multi-degree and indecomposable polynomials

## Abstract

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the case of the multi-degree and the case of indecomposable polynomials.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/0910.1680/full.md

## References

15 references — full list in the complete paper: https://tomesphere.com/paper/0910.1680/full.md

---
Source: https://tomesphere.com/paper/0910.1680