Erratum: ``On the heuristic of approximating polynomials over finite fields by random mappings

DOI10.1142/S1793042116920020MaRDI QIDQ2828375zbMATH OpenFDO

Authors Rodrigo S. V. Martins, Daniel Panario

Publication date 25 October 2016

Published in International Journal of Number Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps (37P05)

Recommendations

• On the heuristic of approximating polynomials over finite fields by random mappings
• Errata to: ``Settled polynomials over finite fields
• Erratum: Factoring Polynomials over Algebraic Number Fields
• Erratum to ``Bertini irreducibility theorems over finite fields
• Erratum to “How many zeros of a random polynomial are real?”
• On the pseudorandomness of the Liouville function of polynomials over a finite field
• Erratum to: ``Large sieve inequality with power moduli for function field
• On random polynomials over finite fields
• On some approximation problems concerning sparse polynomials over finite fields
• On the \(k\)-error linear complexity of sequences from function fields

Cites work

• Note on a problem of Chowla
• The distribution of polynomials over finite fields

This page was built for publication: Erratum: ``On the heuristic of approximating polynomials over finite fields by random mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828375)