arXiv (All)
open access
A Morris recursion rule for values of the spin characters of wreath products
The classical Murnaghan-Nakayama rule is a recursive formula for computing the values of complex irreducible characters of the symmetric group $S_n$. Alun Morris proved a recursive formula for evaluating the values of irreducible spin characters of $\widetilde{S}_n$, where $\widetilde{S}_n$ is one o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Global patterns in signed permutations#1110087
- Conjugation invariants determine the metacommutation permutation only up to relabelling#610015
- Conjugation invariants determine the metacommutation permutation only up to relabelling#608953
- Simultaneous nonvanishing of quadratic twists via Rankin-Cohen brackets#1014238
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles#1109169
Record · ID 1215656
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive