Computing Puiseux series: a fast divide and conquer algorithm

Let F ∈ [ X , Y ] be a polynomial of total degree D defined over a perfect field of characteristic zero or greater than D . Assuming F separable with respect to Y , we provide an algorithm that computes all singular parts of Puiseux series of F above X = 0 in an expected Ø ˜ ( D δ ) operations in ,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annales Henri Lebesgue Ročník 4; s. 1061 - 1102
Hlavní autoři: Poteaux, Adrien, Weimann, Martin
Médium: Journal Article
Jazyk:angličtina
Vydáno: UFR de Mathématiques - IRMAR 2021
Témata:
Commutative Algebra
Computer Science
Mathematics
Symbolic Computation
complexity
Puiseux series
ISSN:2644-9463, 2644-9463
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Let F ∈ [ X , Y ] be a polynomial of total degree D defined over a perfect field of characteristic zero or greater than D . Assuming F separable with respect to Y , we provide an algorithm that computes all singular parts of Puiseux series of F above X = 0 in an expected Ø ˜ ( D δ ) operations in , where δ is the valuation of the resultant of F and its partial derivative with respect to Y . To this aim, we use a divide and conquer strategy and replace univariate factorisation by dynamic evaluation. As a first main corollary, we compute the irreducible factors of F in [ [ X ] ] [ Y ] up to an arbitrary precision X N with Ø ˜ ( D ( δ + N ) ) arithmetic operations. As a second main corollary, we compute the genus of the plane curve defined by F with Ø ˜ ( D 3 ) arithmetic operations and, if = ℚ , with Ø ˜ ( ( h + 1 ) D 3 ) bit operations using probabilistic algorithms, where h is the logarithmic height of F .
ISSN:2644-9463
2644-9463
DOI:10.5802/ahl.97