Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 97 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 100 tok/s Pro
GPT OSS 120B 464 tok/s Pro
Kimi K2 186 tok/s Pro
2000 character limit reached

Character deflations and a generalization of the Murnaghan--Nakayama rule (1202.0067v3)

Published 1 Feb 2012 in math.RT and math.CO

Abstract: Given natural numbers m and n, we define a deflation map from the characters of the symmetric group S_{mn} to the characters of S_n. This map is obtained by first restricting a character of S_{mn} to the wreath product S_m \wr S_n, and then taking the sum of the irreducible constituents of the restricted character on which the base group S_m \times ... \times S_m acts trivially. We prove a combinatorial formula which gives the values of the images of the irreducible characters of S_{mn} under this map. We also prove an analogous result for more general deflation maps in which the base group is not required to act trivially. These results generalize the Murnaghan--Nakayama rule and special cases of the Littlewood--Richardson rule. As a corollary we obtain a new combinatorial formula for the character multiplicities that are the subject of the long-standing Foulkes' Conjecture. Using this formula we verify Foulkes' Conjecture in some new cases.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.