Article Dans Une Revue Journal of Symbolic Computation Année : 2025

Bivariate polynomial reduction and elimination ideal over finite fields

Résumé

Given two polynomials a and b in Fq[x,y] which have no non-trivial common divisors, we prove that a generator of the elimination ideal ⟨a, b⟩ ∩ Fq [x] can be computed in quasi-linear time. To achieve this, we propose a randomized algorithm of the Monte Carlo type which requires (de log q)1+o(1) bit operations, where d and e bound the input degrees in x and in y respectively. The same complexity estimate applies to the computation of the largest degree invariant factor of the Sylvester matrix associated with a and b (with respect to either x or y), and of the resultant of a and b if they are sufficiently generic, in particular such that the Sylvester matrix has a unique non-trivial invariant factor. Our approach is to exploit reductions to problems of minimal polynomials in quotient algebras of the form Fq [x, y]/⟨a, b⟩. By proposing a new method based on structured polyno- mial matrix division for computing with the elements of the quotient, we succeed in improving the best-known complexity bounds.

Fichier principal
Vignette du fichier
elimin.pdf (410.5 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04542799 , version 1 (11-04-2024)

Licence

Identifiants

Citer

Gilles Villard. Bivariate polynomial reduction and elimination ideal over finite fields. Journal of Symbolic Computation, 2025, 127, pp.102367. ⟨10.1016/j.jsc.2024.102367⟩. ⟨hal-04542799⟩
246 Consultations
1021 Téléchargements

Altmetric

Partager

  • More