On the linear equation method for the subduction problem in symmetric groups

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} \times 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.

13 pages, 2 figures, iopart class; reference added

Cited by in corpus (5)

• A reduced subduction graph and higher multiplicity in S_n transformation coefficients
• Three-point Functions in $\mathcal{N}=4$ SYM at Finite $N_c$ and Background Independence
• On subgroup adapted bases for representations of the symmetric group
• Selection and identity rules for subductions of type A quantum Iwahori-Hecke algebras
• Combinatorics of transformations from standard to non-standard bases in Brauer algebras