Multiplicity-free permutation representations of the symmetric group.

DOI10.1007/S00026-009-0035-8MaRDI QIDQ659813zbMATH OpenOpenAlexFDO

Authors K. Meagher, Chris 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

Combinatorial aspects of representation theory (05E10) Association schemes, strongly regular graphs (05E30) Representations of finite symmetric groups (20C30)

Abstract: We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.

Recommendations

• Multiplicity-free representations of symmetric groups.
• scientific article; zbMATH DE number 1054568
• Multiplicity-free permutation representations of finite linear groups
• Publication:4486307
• Multiplicity-free permutation characters of covering groups of sporadic simple groups.

Cites work

• scientific article; zbMATH DE number 51906 (Why is no real title available?)
• scientific article; zbMATH DE number 1342086 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 3212917 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• scientific article; zbMATH DE number 3341276 (Why is no real title available?)
• A new strongly regular graph
• Characters of multiply transitive permutation groups
• Covering arrays on graphs
• Distance transitive graphs with symmetric or alternating automorphism group
• 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
• Set-Transitive Permutation Groups

Cited in

(13)

• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• On the type of the von Neumann algebra of an open subgroup of the Neretin group
• scientific article; zbMATH DE number 20331 (Why is no real title available?)
• Multiplicity-free representations of symmetric groups.
• Erdős-Ko-Rado for perfect matchings
• On cocliques in commutative Schurian association schemes of the symmetric group
• Gelfand pairs for affine Weyl groups
• Finite primitive groups of small rank: symmetric and sporadic groups
• Strong Gelfand pairs of symmetric groups
• Strange permutation representations of free groups
• Multiplicity-free induced characters of symmetric groups
• scientific article; zbMATH DE number 1465721 (Why is no real title available?)
• Strong Gelfand subgroups of F ≀ Sn

Describes a project that uses

Uses Software

• GAP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659813)