Estimating the number of roots of trinomials over finite fields

DOI10.1016/j.jsc.2016.08.008zbMath1382.11089arXiv1510.01758OpenAlexW2962792438MaRDI QIDQ321285

Zander Kelley, Sean W. Owen

Publication date: 13 October 2016

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.01758

zbMATH Keywords

finite fieldPoisson distributionChebotarev densitysparse polynomialtrinomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)

Related Items

Sparse univariate polynomials with many roots over finite fields, Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields, On the number of distinct roots of a lacunary polynomial over finite fields

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roots of random polynomials over a finite field
• The Galois group of a polynomial with two indeterminate coefficients
• Prime polynomials in short intervals and in arithmetic progressions
• The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
• Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
• Roots of sparse polynomials over a finite field
• A note on Poisson maxima
• Extreme value theory for a class of discrete distributions with applications to some stochastic processes
• On the statistical properties of Diffie-Hellman distributions