ABOUT GORDAN'S ALGORITHM FOR BINARY FORMS

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00952988
Contributor : Marc Olive <>
Submitted on : Friday, June 19, 2015 - 8:49:05 AM
Last modification on : Monday, March 4, 2019 - 2:04:18 PM
Long-term archiving on : Tuesday, September 15, 2015 - 7:27:49 PM

Files

AlgoGordan.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Identifiers

  • HAL Id : hal-00952988, version 4

Collections

Citation

Marc Olive. ABOUT GORDAN'S ALGORITHM FOR BINARY FORMS. 2014. ⟨hal-00952988v4⟩

Share

Metrics

Record views

278

Files downloads

206