On coefficients of polynomials over finite fields (Q650833): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bit-serial Reed - Solomon encoders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit theorems on generator polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive polynomials with a prescribed coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hansen-Mullen primitivity conjecture: completion of proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive normal polynomials with multiple coefficients prescribed: an asymptotic result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible polynomials with consecutive zero coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern computer algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating permutation polynomials over finite fields by degree. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating permutation polynomials. II: \(k\)-cycles with minimal degree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3582533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the coefficients of inverse polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generators and irreducible polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inverse permutation polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degrees of permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible polynomials over finite fields with prescribed trace/prescribed constant term / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible polynomials over GF(2) with prescribed coefficients. / rank
 
Normal rank

Revision as of 18:03, 4 July 2024

scientific article
Language Label Description Also known as
English
On coefficients of polynomials over finite fields
scientific article

    Statements

    On coefficients of polynomials over finite fields (English)
    0 references
    0 references
    7 December 2011
    0 references
    Let \(\mathbb F_q\) be a finite field and let \(f(x)\) be a polynomial over \(\mathbb F_q\) of degree \(\leq q-1\). The authors begin by giving a formula for the coefficients of \(f(x)\) in terms of the elements of \(\mathbb F_q\) moved by \(f\). This extends a result of \textit{G. L. Mullen} and \textit{B. G. Vioreanu} [Bull. Inst. Comb. Appl. 57, 99--106 (2009; Zbl 1228.11175)] for permutation polynomials. Numerous consequences follow. For example, if \(f\) fixes \(k<q\) elements of \(\mathbb F_q\) then \(\deg f\geq k\). If \(f(0)=0\) then no \(m\) consecutive coefficients of \(f\) are all zero. Further, there are at least \((q-1)/m-1\) non-zero coefficients if \(m\mid q-1\) and at least \((q-1)/m\) if \(m\nmid q-1\).
    0 references
    finite fields
    0 references
    coefficients
    0 references
    permutation polynomials
    0 references

    Identifiers