✦ LIBER ✦

Counting Polynomials with Zeros of Given Multiplicities in Finite Fields

✍ Scribed by Jean-François Ragot

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 136 KB
Volume: 5
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1999.0244

No coin nor oath required. For personal study only.

✦ Synopsis

We consider the set of polynomials in r indeterminates over a "nite "eld and with bounded degree. We give here a way to count the number of elements of some of its subsets, namely those sets de"ned by the multiplicities of their elements at some points of %P O . The number of polynomials having at least one zero in a given "nite "eld is computed as a particular applications.

📜 SIMILAR VOLUMES

Compositions of Polynomials with Coeffic

Compositions of Polynomials with Coefficients in a Given Field

✍ Alan Horwitz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Let F ⊂ K be fields of characteristic 0, and let K x denote the ring of polynomials with coefficients in K. ∈ F for some j ≥ 1. Suppose that p ∈ K x , q ∈ K x \F x p not constant. Our main result is that p • q / ∈ F x and D F p • q = D F q . With only the assumption that a n b m ∈ F, we prove the i