Computing the equisingularity type of a pseudo-irreducible polynomial

DOI10.1007/S00200-020-00451-XMaRDI QIDQ2025447zbMATH OpenOpenAlexFDO

Authors Adrien Poteaux, Martin Weimann

Publication date 14 May 2021

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.05596

zbMATH Keywords

approximate rootsequisingularityplane curvespolynomialspseudo-irreduibility

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Polynomials, factorization in commutative rings (13P05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Symbolic computation and algebraic computation (68W30)

Abstract: 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.

Review text

In the paper under review, the authors characterize a class of germs of plane curve singularities, containing irreducible ones, whose equisingularity type can be computed in an expected quasi-linear time with respect to the discriminant valuation of a Weierstrass equation.

Recommendations

• Equisingular calculations for plane curve singularities
• scientific article; zbMATH DE number 589099
• scientific article; zbMATH DE number 5030279
• On the analytic classification of irreducible plane curve singularities
• Determining plane curve singularities from its polars

Cites work

• A fast algorithm for computing the truncated resultant
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
• A regularization method for computing approximate invariants of plane curves singularities
• Accelerated tower arithmetic
• Algebroid curves in positive characteristic
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
• scientific article; zbMATH DE number 4146129 (Why is no real title available?)
• scientific article; zbMATH DE number 3496316 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 2070370 (Why is no real title available?)
• scientific article; zbMATH DE number 1497487 (Why is no real title available?)
• scientific article; zbMATH DE number 2120365 (Why is no real title available?)
• Improving complexity bounds for the computation of Puiseux series over finite fields
• Introduction to Singularities and Deformations
• Invariants polaires des courbes planes
• Irreducibility criterion for germs of analytic functions of two complex variables
• Modern computer algebra
• Studies in Equisingularity I Equivalent Singularities of Plane Algebroid Curves
• Studies in Equisingularity II. Equisingularity in Codimension 1 (and Characteristic Zero)
• Studies in Equisingularity III: Saturation of Local Rings and Equisingularity
• The Computational Complexity of the Resolution of Plane Curve Singularities
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Topological invariants of plane curve singularities: polar quotients and Łojasiewicz gradient exponents

Cited in

(3)

• [[:Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
• Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts
• Improvements of convex-dense factorization of bivariate polynomials

This page was built for publication: Computing the equisingularity type of a pseudo-irreducible polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025447)