Some results on counting roots of polynomials and the Sylvester resultant
From MaRDI portal
Publication:5111015
zbMATH Open1434.11227arXiv1609.08712MaRDI QIDQ5111015FDOQ5111015
Authors: Baris Tuncer, Michael Monagan
Publication date: 26 May 2020
Abstract: We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second result has application to polynomial GCD computation and solving polynomial diophantine equations.
Full work available at URL: https://arxiv.org/abs/1609.08712
Recommendations
Cites Work
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Algebraic coding theory
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Equations over finite fields. An elementary approach
- The Probability of Relatively Prime Polynomials
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- Counting irreducible factors of polynomials over a finite field
- Using sparse interpolation to solve multivariate Diophantine equations
Cited In (5)
Uses Software
This page was built for publication: Some results on counting roots of polynomials and the Sylvester resultant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111015)