Multiplicity-free permutation representations of the symmetric group.

DOI10.1007/s00026-009-0035-8zbMath1234.20015arXivmath/0612567OpenAlexW2126843216MaRDI QIDQ659813

Karen Meagher, Chris D. Godsil

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0612567

zbMATH Keywords

association schemespermutation representationsfinite symmetric groupsmultiplicity-free representations

Mathematics Subject Classification ID

Related Items (7)

Erdős-Ko-Rado for perfect matchings ⋮ On the type of the von Neumann algebra of an open subgroup of the Neretin group ⋮ Finite primitive groups of small rank: symmetric and sporadic groups ⋮ An extension of the Erdős-Ko-Rado theorem to uniform set partitions ⋮ Unnamed Item ⋮ Strong Gelfand pairs of symmetric groups ⋮ Strong Gelfand subgroups of F ≀ Sn

Uses Software

• GAP

Cites Work

• A new strongly regular graph
• Independent sets in association schemes
• Multiplicity-free representations of symmetric groups.
• On qualitatively independent partitions and related problems
• On the maximum number of qualitative independent partitions
• Qualitative independence and Sperner problems for directed graphs
• Characters of multiply transitive permutation groups
• Covering arrays on graphs
• Distance transitive graphs with symmetric or alternating automorphism group
• Set-Transitive Permutation Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiplicity-free permutation representations of the symmetric group.