Abstract
The codimension is an important invariant, which measures the complexity of map germs and play an important role in classification and recognition problems. The restricted A-equivalence was introduced to obtain a classification of reducible curves. The aim was to classify simple parameterized curves with two components, one of them being smooth with respect to the A-equivalence in characteristic p. In characteristic 0, the corresponding classification was given by Kolgushkin and Sadykov. The aim of this article is to present an algorithm to compute the codimension of germs of singularities under a restricted left–right equivalence (A-symmetry). We also give the implementation of this algorithm in the computer algebra system singular.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
