Thom polynomials and Schur functions: the singularities \(A_3(-)\) (Q963071): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161526
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Lascoux, Alain / rank
 
Normal rank

Revision as of 20:25, 9 February 2024

scientific article
Language Label Description Also known as
English
Thom polynomials and Schur functions: the singularities \(A_3(-)\)
scientific article

    Statements

    Thom polynomials and Schur functions: the singularities \(A_3(-)\) (English)
    0 references
    0 references
    0 references
    8 April 2010
    0 references
    Consider singularities of map germs from \(C^n\) to \(C^{n+k}\). To such a singularity one can assign its Thom polynomial, a polynomial in several variables, whose degree is the codimension of the singularity. Knowing the Thom polynomial of \(S\) one can compute the cohomology class represented by the \(S\)-singular points of a global map. The topic of the paper under review is the Thom polynomial of the singularities called \(A_3: C^* \to C^{*+k}\). For a concrete \(k\) one can consider a system of linear equations whose only solution is the Thom polynomial in question. However, considering all \(k\) at the same time, one faces an infinite set of systems of linear equations. The authors of the present paper consider this infinite set, and present the solution in a geometrically motivated basis (the basis of supersymmetric Schur functions). One feature of the Schur expansion is that coefficients satisfy finite recurrences, another feature is that the coefficients are positive (Pragacz-Weber theorem). In the proof the authors use extensively the functorial \(\lambda\)-ring approach to symmetric functions, developed in earlier works of the first author.
    0 references
    Thom polynomial
    0 references
    Schur functions
    0 references
    \(A_3\) singularity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references