Geometry of coadjoint orbits and multiplicity-one branching laws for symmetric pairs (Q1792604): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1805.09713 / rank
 
Normal rank

Revision as of 22:12, 18 April 2024

scientific article
Language Label Description Also known as
English
Geometry of coadjoint orbits and multiplicity-one branching laws for symmetric pairs
scientific article

    Statements

    Geometry of coadjoint orbits and multiplicity-one branching laws for symmetric pairs (English)
    0 references
    0 references
    0 references
    12 October 2018
    0 references
    The paper mainly deals with the so-called Corwin-Greenleaf number; that is, the number of the \(H\)-orbits on the intersection of a \(G\)-coadjoint orbit on \(\sqrt{-1}\mathfrak{g}^*\) and the preimage of an \(H\)-coadjoint orbit on \(\sqrt{-1}\mathfrak{h}^*\) under the projection \(\sqrt{-1}\mathfrak{g}^*\rightarrow \sqrt{-1}\mathfrak{h}^*\). The results in this paper correspond to the branching rules of irreducible unitary representations for simple Lie groups, which were studied by the first author of the paper in recent years. Here the authors show that this number is at most one when \((G,H)\) is a symmetric pair of holomorphic type, which corresponds to the multiplicity-free decomposition of an irreducible unitary lowest weight representation of scalar type of a simple Lie group upon the restriction to its symmetric subgroup.
    0 references
    orbit method
    0 references
    Corwin-Greenleaf multiplicity function
    0 references
    multiplicity-free representations
    0 references
    highest weight representations
    0 references
    bounded symmetric domains
    0 references
    branching law
    0 references
    coadjoint orbit
    0 references
    geometric quantization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references