arXiv (All)
open access
Graded multiplicities in the Kostant-Rallis setting
This paper contains two main results. First, we provide combinatorial branching rules for $\mathrm{GL}_n \downarrow \mathrm{O}_n$ and $\mathrm{GL}_{2n} \downarrow \mathrm{Sp}_{2n}$ extending the Littlewood restriction rules. Second, we use these branching rules and the combinatorics of $\mathrm{GL}_
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
- Graded multiplicities in the Kostant-Rallis setting#797134
- Override and Update in Restriction Categories#926391
- On the Expressive Power of Implicit Line-Graph Higher-Order Weisfeiler--Leman#1110772
- Algebraic Decomposition Theory for Transformer Length Generalization#451333
- Dominant-Degree Conditions for Ramsey--Turán Factors of Non-Directed Cycle Orientations#820891
Record · ID 798547
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