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 SL2 (C)-equivariant homomorphisms defined upon Cayley operator and polarization process. A graphical approach is thus developed to obtain Gordan's ideal, a central key to get covariant bases of binary forms. To illustrate the power of the method, we compute a covariant basis of S6 ⊕ S2 and S8 .
Domaines
Mathématiques générales [math.GM]
Origine : Fichiers produits par l'(les) auteur(s)