Counting polynomials with zeros of given multiplicities in finite fields

Finite Fields and their Applications

Volumn 5, Issue 3, 1999, Pages 219-231

  Ragot, Jean François ^a  

^a UNIVERSITY OF LIMOGES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033164145     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.1999.0244     Document Type: Article

References (6)

1. G. Berman and K. D. Fryer, "Introduction to Combinatorics," Academic Press, New York, 1972.
2. D. Cox, J. Little, D. O'Shea, "Ideals, varieties and algorithms (an introduction to computational algebraic geomety and commutative, algebra)," Undergraduate Texts in Mathematics, Springer-Verlag, New York/Berlin, 1992.
3. S. Lang, "Algebra," Series in Maths, Addison-Wesley, Reading, MA, 1965.
4. R. W. K. Odoni, "Zeros of random polynomials over finite fields," in Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 111, March 1992, Part, 2. pp. 193-197.
5. J. F. Ragot, "Sur la Factorisation Absolue des Polynômes," Thèse de doctorat de l'université de Limoges, 1997.
6. W. M. Schmidt, "Equations over finite fields, an elementary approach," Lectures Notes in Math., Vol. 536, Springer-Verlag, 1976.