On the linear equation method for the subduction problem in symmetric groups
From MaRDI portal
Abstract: We focus on the tranformation matrices between the standard Young-Yamanouchi basis of an irreducible representation for the symmetric group S_n and the split basis adapted to the direct product subgroups S_{n_1} imes S_{n-n_1} . We introduce the concept of subduction graph and we show that it conveniently describes the combinatorial structure of the equation system arisen from the linear equation method. Thus we can outline an improved algorithm to solve the subduction problem in symmetric groups by a graph searching process. We conclude observing that the general matrix form for multiplicity separations, resulting from orthonormalization, can be expressed in terms of Sylvester matrices relative to a suitable inner product in the multiplicity space.
Recommendations
- A reduced subduction graph and higher multiplicity inSntransformation coefficients
- On subgroup adapted bases for representations of the symmetric group.
- Split bases and multiplicity separations in symmetric group transformation coefficients
- Combinatorics of transformations from standard to non-standard bases in Brauer algebras
- Split-standard transformation coefficients: the block-selective conjecture
Cited in
(5)- Selection and identity rules for subductions of type A quantum Iwahori-Hecke algebras
- Split bases and multiplicity separations in symmetric group transformation coefficients
- On subgroup adapted bases for representations of the symmetric group.
- Eigenvalue systems for integer orthogonal bases of multi-matrix invariants at finite N
- Three-point functions in \(\mathcal{N} = 4\) SYM at finite \(N_c\) and background independence
This page was built for publication: On the linear equation method for the subduction problem in symmetric groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5478350)
