The intersection of opposed big cells in real flag varieties

Konstanze Rietsch

Abstract

For any reductive algebraic group over C split over R a graph is defined. In type Aand D it is shown that the number of connected components of the graph coincides with the number of connected components of the intersection of two opposed big cells in the corresponding real flag variety. This gives a combinatorial description for the number of connected components of such a variety.