Counting reducible and singular bivariate polynomials (Q958607)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5378795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting reducible and singular bivariate polynomials |
scientific article; zbMATH DE number 5378795 |
Statements
Counting reducible and singular bivariate polynomials (English)
0 references
5 December 2008
0 references
\textit{L. Carlitz} provided the first count of irreducible multivariate polynomials [ Ill. J. Math. 7, 371--375 (1963; Zbl 0118.26002)]. Following Carlitz, several authors studied several counting of some classes of special multivariate polynomials, for example, see \textit{M. L. Fredman} [ Proc. Am. Math. Soc. 31, 387--390 (1972; Zbl 0263.12011)]. In this paper, the author presents counting the reducible, the ``relatively irreducible'' and the singular bivariate polynomials over a finite field.
0 references
bivariate polynomials
0 references
finite fields
0 references
counting problems
0 references
0 references
0 references
0.8957895040512085
0 references
0.8438564538955688
0 references
0.8433961868286133
0 references
0.8418321013450623
0 references
0.7949312329292297
0 references
