Some results on counting roots of polynomials and the Sylvester resultant

zbMath1434.11227arXiv1609.08712MaRDI QIDQ5111015

Baris Tuncer, Michael B. Monagan

Publication date: 26 May 2020

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

zbMATH Keywords

finite fieldsroots of polynomialsSylvester resultantunlucky evaluation points

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polynomials over finite fields (11T06)

Related Items (1)

The complexity of sparse Hensel lifting and sparse polynomial factorization

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Counting irreducible factors of polynomials over a finite field
• Equations over finite fields. An elementary approach
• The Probability of Relatively Prime Polynomials
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Algorithms for the non-monic case of the sparse modular GCD algorithm
• Using sparse interpolation to solve multivariate diophantine equations

This page was built for publication: Some results on counting roots of polynomials and the Sylvester resultant