Graph theory and classical invariant theory (Q1263642): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3740666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5336331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The invariant theory of binary forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperjacobians, determinantal ideals and weak solutions to variational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem and canonical forms for quadratic Lagrangians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical invariant theory and the equivalence problem for particle Lagrangians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183796 / rank
 
Normal rank

Latest revision as of 10:56, 20 June 2024

scientific article
Language Label Description Also known as
English
Graph theory and classical invariant theory
scientific article

    Statements

    Graph theory and classical invariant theory (English)
    0 references
    0 references
    0 references
    1989
    0 references
    The contents of the paper follows: In Section 2 a survey on the basic concepts of invariants and covariants of binary forms is given. Section 3 introduces the symbolic method of Aronhold. The bracket polynomials, which play a fundamental role in the symbolic computations, are discussed in Section 4. Section 5 begins the heart of the paper and presents the molecular/graphical representation of invariants and covariants based on their symbolic bracket expressions. The syzygies or relations among bracket polynomials translate into operations with their graphical equivalents, leading to an ``algebra of digraphs''; these are discussed in Section 6. The remaining two sections are devoted to a simplified explanation of the constructive method of Gordan for the determination of the Hilbert basis of covariants for binary forms of a given degree. This method is based on the idea of ``transvection'', which can be reinterpreted as a way of reacting two different molecules or digraphs together to produce more complicated molecules/digraphs. The construction of the basis of covariants is illustrated in the final section by the simplest cases of a binary quadratic, cubic, and quartic polynomial.
    0 references
    invariants
    0 references
    covariants
    0 references
    binary forms
    0 references
    bracket polynomials
    0 references
    symbolic computations
    0 references
    molecular/graphical representation
    0 references
    syzygies
    0 references
    algebra of digraphs
    0 references
    Hilbert basis
    0 references
    transvection
    0 references
    basis of covariants
    0 references

    Identifiers