scientific article
From MaRDI portal
Publication:3901672
zbMath0454.20010MaRDI QIDQ3901672
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
irreducible representationlinear representationtransitive permutation groupsfinite linear groupsfinite symmetric groupsmultiplicity-free permutation group
Representations of finite symmetric groups (20C30) Subgroups of symmetric groups (20B35) Multiply transitive finite groups (20B20)
Related Items (18)
Distance-transitive representations of the symmetric groups ⋮ Statistical enumeration of groups by double cosets ⋮ Stein's method, heat kernel, and linear functions on the orthogonal groups ⋮ Finite primitive distance-transitive graphs ⋮ The perfect matching association scheme ⋮ Finite primitive groups of small rank: symmetric and sporadic groups ⋮ Unnamed Item ⋮ Multiplicity-free induced characters of symmetric groups ⋮ Time to reach stationarity in the Bernoulli-Laplace diffusion model with many urns ⋮ Gelfand models for diagram algebras ⋮ Association schemes and permutation groups ⋮ The character table of the Hecke algebra \({\mathcal H}(GL_{2n}(\mathbb{F}_ q),Sp_{2n}(\mathbb{F}_ q))\) ⋮ Distance-transitive representations of groups G with \(PSL_ 2(q)\trianglelefteq G\leq P\Gamma L_ 2(q)\) ⋮ Strong Gelfand pairs of symmetric groups ⋮ An association scheme for the 1-factors of the complete graph ⋮ Strong Gelfand subgroups of F ≀ Sn ⋮ Appendix: On some Gelfand pairs and commutative association schemes. ⋮ Multiplicity-free permutation representations of finite linear groups
This page was built for publication:
