Bivariate Factorization Using a Critical Fiber - Archive ouverte HAL Access content directly
Journal Articles Foundations of Computational Mathematics Year : 2017

Bivariate Factorization Using a Critical Fiber

(1, 2)
1
2

Abstract

We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors, depending on the complexity of the ramification. We show that working along a critical fiber leads in some cases to a good theoretical complexity, due to the smaller number of analytic factors to recombine. We pay a particular attention to the case of polynomials that are non-degenerate with respect to their P-adic Newton polytopes.
Fichier principal
Vignette du fichier
Weimann_FactoCritic_RevisedVersion.pdf (536.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01645143 , version 1 (22-05-2019)

Identifiers

Cite

Martin Weimann. Bivariate Factorization Using a Critical Fiber. Foundations of Computational Mathematics, 2017, 17 (5), pp.1219-1263. ⟨10.1007/s10208-016-9318-8⟩. ⟨hal-01645143⟩
34 View
29 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More