Criteria for rational smoothness of some symmetric orbit closures

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages

Scientific paper

Let $G$ be a connected reductive linear algebraic group over $\C$ with an involution $\theta$. Denote by $K$ the subgroup of fixed points. In certain cases, the $K$-orbits in the flag variety $G/B$ are indexed by the twisted identities $\iot = \{\theta(w^{-1})w\mid w\in W\}$ in the Weyl group $W$. Under this assumption, we establish a criterion for rational smoothness of orbit closures which generalises classical results of Carrell and Peterson for Schubert varieties. That is, whether an orbit closure is rationally smooth at a given point can be determined by examining the degrees in a ``Bruhat graph'' whose vertices form a subset of $\iot$. Moreover, an orbit closure is rationally smooth everywhere if and only if its corresponding interval in the Bruhat order on $\iot$ is rank symmetric. In the special case $K=\Sp_{2n}(\C)$, $G=\SL_{2n}(\C)$, we strengthen our criterion by showing that only the degree of a single vertex, the ``bottom one'', needs to be examined. This generalises a result of Deodhar for type $A$ Schubert varieties.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Criteria for rational smoothness of some symmetric orbit closures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Criteria for rational smoothness of some symmetric orbit closures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Criteria for rational smoothness of some symmetric orbit closures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-27317

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.