ABOUT GORDAN'S ALGORITHM FOR BINARY FORMS
Résumé
In this paper, we present a modern version of Gordan's algorithm on binary forms. Symbolic method is reinterpreted in terms of SL(2, C)–equivariant homomorphisms defined upon Cayley operator and polarization operator. A graphical approach is thus developed to obtain Gordan's ideal, a central key to get covariant basis of binary forms. To illustrate the power of this method, we obtain for the first time a minimal covariant bases for S6 ⊕ S4, S6 ⊕ S4 ⊕ S2 and a minimal invariant bases of S8 ⊕ S4 ⊕ S4.
Origine : Fichiers produits par l'(les) auteur(s)