Counting Polynomials with Zeros of Given Multiplicities in Finite Fields
| Autor: | Jean-François Ragot |
|---|---|
| Jazyk: | angličtina |
| Předmět: |
Discrete mathematics
Algebra and Number Theory Applied Mathematics Discrete orthogonal polynomials General Engineering Factorization of polynomials over finite fields Theoretical Computer Science Classical orthogonal polynomials Finite field Difference polynomials Macdonald polynomials Bounded function Orthogonal polynomials Engineering(all) Mathematics |
| Zdroj: | Finite Fields and Their Applications. (3):219-231 |
| ISSN: | 1071-5797 |
| DOI: | 10.1006/ffta.1999.0244 |
| Popis: | We consider the set of polynomials inrindeterminates over a finite field and with bounded degree. We give here a way to count the number of elements of some of its subsets, namely those sets defined by the multiplicities of their elements at some points of Frq. The number of polynomials having at least one zero in a given finite field is computed as a particular applications. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|