Symbolic method

For the method in analytic combinatorics, see Symbolic method (combinatorics).

In mathematics, the symbolic method in invariant theory is an algorithm developed by Arthur Cayley,[1] Siegfried Heinrich Aronhold,[2] Alfred Clebsch,[3] and Paul Gordan[4] in the 19th century for computing invariants of algebraic forms. It is based on treating the form as if it were a power of a degree one form, which corresponds to embedding a symmetric power of a vector space into the symmetric elements of a tensor product of copies of it.

  1. ^ Cite error: The named reference Cayley1846 was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference Aronhold1858 was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference Clebsch1861 was invoked but never defined (see the help page).
  4. ^ Gordan 1887.