Multiplicity-free permutation representations of the symmetric group.

DOI10.1007/S00026-009-0035-8zbMATH Open1234.20015arXivmath/0612567OpenAlexW2126843216MaRDI QIDQ659813FDOQ659813

Authors: K. Meagher, Chris Godsil 

Publication date: 24 January 2012

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

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.

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

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.

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)

Cites Work

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

Cited In (13)

• On the type of the von Neumann algebra of an open subgroup of the Neretin group
• Title not available (Why is that?)
• 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
• Multiplicity-free induced characters of symmetric groups
• Strange permutation representations of free groups
• Title not available (Why is that?)
• Strong Gelfand subgroups of F ≀ Sn
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions

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)