Computing the equisingularity type of a pseudo-irreducible polynomial

Adrien Poteaux (1) , Martin Weimann (2, 3)

1 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
2 UNICAEN - Université de Caen Normandie
3 GAATI - Laboratoire de Géométrie Algébrique et Applications à la Théorie de l'Information

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. In this paper, we characterise a family of singularities, containing irreducible ones, whose equisingularity type can be computed in quasi-linear time with respect to the discriminant valuation of a Weierstrass equation.

Domaines: Mathématiques [math]; Géométrie algébrique [math.AG]; Algèbre commutative [math.AC]; Informatique [cs]; Calcul formel [cs.SC]

Adrien Poteaux, Martin Weimann. Computing the equisingularity type of a pseudo-irreducible polynomial. Applicable Algebra in Engineering, Communication and Computing, 2020, 31, pp.435-460. ⟨10.1007/s00200-020-00451-x⟩. ⟨hal-02354930v2⟩