Elimination ideal and bivariate resultant over finite fields
Open Access
- 24 July 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 526-534
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 which have no non-trivial common divisors. The algorithm is randomized of the Monte Carlo type and requires (delog q)1 + o(1) bit operations, where d and 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 (or ), as long 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 . 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.Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Fast computation of special resultantsJournal of Symbolic Computation, 2006
- Subquadratic-time factoring of polynomials over finite fieldsMathematics of Computation, 1998
- Inversion components of block Hankel-like matricesLinear Algebra and its Applications, 1992
- Solving zero-dimensional algebraic systemsJournal of Symbolic Computation, 1992
- Gröbner bases and primary decomposition of polynomial idealsJournal of Symbolic Computation, 1988
- Discrete logarithms inGF(p)Algorithmica, 1986
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- Ideal Bases and Primary Decomposition: Case of Two VariablesJournal of Symbolic Computation, 1985
- Resolution des systemes d'equations algebriquesTheoretical Computer Science, 1981
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978