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 ,...

Full description

Bibliographic Details

Published in:	Annales Henri Lebesgue Vol. 4; pp. 1061 - 1102
Main Authors:	Poteaux, Adrien, Weimann, Martin
Format:	Journal Article
Language:	English
Published:	UFR de Mathématiques - IRMAR 2021
Subjects:	Commutative Algebra Computer Science Mathematics Symbolic Computation complexity Puiseux series
ISSN:	2644-9463, 2644-9463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!