Proof of an algorithm for the evaluation of the branching multiplicity SO(2n)→SO(2n−2)⊗U(1)
From MaRDI portal
Publication:3701674
Recommendations
- On resolving the multiplicity of the branching rule GL(2k+1,C) down arrow SO(2k+1,C)
- A Robinson-Schensted-type algorithm for \(SO(2n,\mathbb{C})\)
- On the \(\mathrm{SO}(n+3)\) to \(\mathrm{SO}(n)\) branching multiplicity space
- Distinguished representations of \(\mathrm{SO}(n+1,1)\times \mathrm{SO}(n,1)\), periods and branching laws
- A representation-theoretic proof of the branching rule for Macdonald polynomial
- Computing of the combinatorial rank of \(u_{q}(\mathfrak {so}_{2n+1})\)
- A representation-theoretic proof of the branching rule for Macdonald polynomials
- Branching of some holomorphic representations of SO(2,N)
- A new algorithm for computing branching rules and Clebsch-Gordan coefficients of unitary representations of compact groups
- On resolving the multiplicity of the branching rule GL(2k,C) down arrow Sp(2k,C)
Cites work
Cited in
(2)
This page was built for publication: Proof of an algorithm for the evaluation of the branching multiplicity SO(2n)→SO(2n−2)⊗U(1)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701674)