2004/11/29 by Roger Howe, Eng-Chye Tan, Jeb F. Willenbring · 2 citations
Mathematics · #Algebraic structures and combinatorial models #Advanced Combinatorial Mathematics #Advanced Algebra and Geometry #Mathematics #Branching (polymer chemistry) #Combinatorics #Pure mathematics
paper · pdf · doi:10.1090/s0002-9947-04-03722-5
openalex publication_date 2004/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/15
We approach the problem of obtaining branching rules from the point of view of dual reductive pairs. Specifically, we obtain a stable branching rule for each of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="10"> <mml:semantics> <mml:mn>10</mml:mn> <mml:annotation encoding="application/x-tex">10</mml:annotation> </mml:semantics> </mml:math> </inline-formula> classical families of symmetric pairs. In each case, the branching multiplicities are expressed in terms of Littlewood-Richardson coefficients. Some of the formulas are classical and include, for example, Littlewood’s restriction rule as a special case.