Metraipolis › archive › dc_4e94adb6836e
A Morris recursion rule for values of the spin characters of wreath products — arXiv:2610.06558
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06558
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:53:42.232Z
- SHA-256 of the archived text
a8fa7fc02cdd21b61228ccb979b5d5361d98950c964f73c6627ee09936a62cbe- Stable URL of this page
https://metraipolis.com/documento/dc_4e94adb6836e
How to cite
A Morris recursion rule for values of the spin characters of wreath products — arXiv:2610.06558 — arXiv (en), https://arxiv.org/abs/2610.06558 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4e94adb6836e (Metraipolis archive dc_4e94adb6836e, sha256 a8fa7fc02cdd21b61228ccb979b5d5361d98950c964f73c6627ee09936a62cbe)
BibTeX
@misc{dc4e94adb6836e,
title = {A Morris recursion rule for values of the spin characters of wreath products — arXiv:2610.06558},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06558},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4e94adb6836e; sha256 a8fa7fc02cdd21b61228ccb979b5d5361d98950c964f73c6627ee09936a62cbe},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06558. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 of the Schur covers of $S_n$ defined by $\widetilde{S}_n:=\langle t_1,t_2,\cdots,t_{n-1},z\ |\ z^2=1,\ t_i^2=z,\ (t_it_{i+1})^3=z, \ t_it_j=zt_jt_i\ \text{if}\ |i-j|>1\rangle$. A recursive formula for evaluating the values of complex irreducible characters of the wreath product $G\wr S_n$, where $G$ is a finite group, was proved by J. Stembridge. In this article, we state and prove a recursive formula to compute the values of the irreducible spin characters of the wreath product $G\wr \widetilde{S}_n$. For the convenience of implementing these recursive formulas, we extend the notion of 0-1 boundary sequence of a Young diagram to shifted Young diagrams.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Representation Theory (math.RT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.06558 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:19:20.081Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).