Counting reducible and singular bivariate polynomials (Q958607): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.ffa.2008.05.005 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.FFA.2008.05.005 / rank | |||
Normal rank |
Latest revision as of 09:55, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting reducible and singular bivariate polynomials |
scientific article |
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 references