Elimination ideal and bivariate resultant over finite fields

DOI10.1145/3597066.3597100MaRDI QIDQ6081978zbMATH OpenWikidataFDO

Publication date 3 November 2023

Published in Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Abstract: A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to

x

or

y

) associated to two polynomials

a

and

b

in

m a t h b b F_{q} [x, y]

which have no non-trivial common divisors. The algorithm is randomized of the Monte Carlo type and requires

O ((d e)^{1 + e p s i l o n} l o g (q)^{1 + o (1)})

bit operations, where

d

an

e

respectively bound the input degrees in

x

and in

y

. It follows that the same complexity estimate is valid for computing: a generator of the elimination ideal

l a n g l e a, b a n g l e c a p m a t h b b F_{q} [x]

(or

m a t h b b F_{q} [y]

), as soon as the polynomial system

a = b = 0

has not roots at infinity; the resultant of

a

and

b

when they are sufficiently generic, especially so that the Sylvester matrix has a unique non-trivial invariant factor. Our approach is to use the reduction of the problem to a problem of minimal polynomial in the quotient algebra

m a t h b b F_{q} [x, y] / l a n g l e a, b a n g l e

. By proposing a new method based on structured polynomial matrix division for computing with the elements in the quotient, we manage to improve the best known complexity bounds.

Cites work

Cited in

(5)

This page was built for publication: Elimination ideal and bivariate resultant over finite fields

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