Some results on counting roots of polynomials and the Sylvester resultant

09/27/2016
by   Michael Monagan, et al.
0

We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo n 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2017

Beyond Polyhedral Homotopies

We present a new algorithmic framework which utilizes tropical geometry ...
research
07/21/2022

On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts

We say that two given polynomials f, g ∈ R[X], over a ring R, are equiva...
research
02/01/2020

Efficient q-Integer Linear Decomposition of Multivariate Polynomials

We present two new algorithms for the computation of the q-integer linea...
research
03/24/2023

Chebyshev and Equilibrium Measure Vs Bernstein and Lebesgue Measure

We show that Bernstein polynomials are related to the Lebesgue measure o...
research
07/14/2020

Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Model

At CRYPTO 2017, Rosca, Sakzad, Stehle and Steinfeld introduced the Middl...
research
03/08/2022

On the complexity of invariant polynomials under the action of finite reflection groups

Let 𝕂[x_1, …, x_n] be a multivariate polynomial ring over a field 𝕂. Let...
research
11/16/2019

New Polynomial Preconditioned GMRES

A new polynomial preconditioner is given for solving large systems of li...

Please sign up or login with your details

Forgot password? Click here to reset