Combinatorics of symplectic invariant tensors
An important problem from invariant theory is to describe the subspace of a tensor power of a representation invariant under the action of the group. According to Weyl's classic, the first main (later: 'fundamental') theorem of invariant theory states that all invariants are expressib...
Main Authors: | Martin Rubey, Bruce W. Westbury |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2015-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2508/pdf |
Similar Items
-
The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words
by: Manfred Kufleitner, et al.
Published: (2012-06-01) -
Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday
by: Akos Seress, et al.
Published: (2010-03-01) -
Computing tensor decompositions of finite matrix groups
by: Nurullah Ankaralioglu, et al.
Published: (2011-11-01) -
On the sensitivity of cyclically-invariant Boolean functions
by: Sourav Chakraborty
Published: (2011-12-01) -
Tableaux combinatorics for two-species PASEP probabilities
by: Olya Mandelshtam
Published: (2015-01-01)