7 citations · 19 across the 8 of their papers we have counts for
10 papers
Local polynomial factorisation: improving the Montes algorithm
Poteaux Adrien, Weimann Martin
We improve significantly the Nart-Montes algorithm for factoring polynomials over a complete discrete valuation ring . Our first contribution is to extend the Hensel le…
Fast computation of integral bases
Adrien Poteaux, Martin Weimann
We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to t…
Algorithm for connectivity queries on real algebraic curves
Md Nazrul Islam, Adrien Poteaux, Rémi Prébet
We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position,…
Polynomial factorization over henselian fields
Maria Alberich-Carramiñana, Jordi Guàrdia, Enric Nart +3
Given a valued field and an irreducible polynomial , we survey the ideas of Ore, Maclane, Okutsu, Montes, Vaquié and Herrera-Olalla-Mahboub-Spivakovsky, leading…
Computing the equisingularity type of a pseudo-irreducible polynomial
Adrien Poteaux, Martin Weimann
Germs of plane curve singularities can be classified accordingly to their equisingularity type. For singularities over C, this important data coincides with the topological class.…
A quasi-linear irreducibility test in K[[x]][y]
Adrien Poteaux, Martin Weimann
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F square-free and…