Experimental Mathematics

Recognition of {${\scr K}$}-singularities of functions

Farid Tari


We describe a computer program, based on Maple, that decides whether or not a polynomial function has a simple or unimodal singularity at the origin, and determines the $\KK$-class of this singularity. The program applies the splitting lemma to the function, in an attempt to reduce the number of variables. Then, in the more interesting cases, linear coordinate changes reduce the 3-jet of the function (or the 4-jet if necessary) to a standard form, and auxiliary procedures complete the classification by looking at higher-order terms. In particular, the reduction procedure classifies cubic curves in $\P^2$.

Article information

Experiment. Math., Volume 1, Issue 3 (1992), 225-229.

First available in Project Euclid: 25 March 2003

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 32S05: Local singularities [See also 14J17]
Secondary: 32-04: Explicit machine computation and programs (not the theory of computation or programming) 58C27


Tari, Farid. Recognition of {${\scr K}$}-singularities of functions. Experiment. Math. 1 (1992), no. 3, 225--229. https://projecteuclid.org/euclid.em/1048622025

Export citation