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 87 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 105 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Kimi K2 193 tok/s Pro
2000 character limit reached

A recursion formula for the irreducible characters of the symmetric group (1712.08023v1)

Published 21 Dec 2017 in math.GR

Abstract: The branching theorem expresses irreducible character values for the symmetric group $S_n$ in terms of those for $S_{n-1}$, but it gives the values only at elements of $S_n$ having a fixed point. We extend the theorem by providing a recursion formula that handles the remaining cases. It expresses these character values in terms of values for $S_{n-1}$ together with values for $S_n$ that are already known in the recursive process. This provides an alternative to the Murnaghan-Nakayama formula.

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.

Authors (1)