Semi-infinite combinatorics in representation theory
Representation Theory
2015-12-07 v2
Abstract
In this work we discuss some appearances of semi-infinite combinatorics in representation theory. We propose a semi-infinite moment graph theory and we motivate it by considering the (not yet rigorously defined) geometric side of the story. We show that it is possible to compute stalks of the local intersection cohomology of the semi-infinite flag variety, and hence of spaces of quasi maps, by performing an algorithm due to Braden and MacPherson.
Cite
@article{arxiv.1505.01046,
title = {Semi-infinite combinatorics in representation theory},
author = {Martina Lanini},
journal= {arXiv preprint arXiv:1505.01046},
year = {2015}
}
Comments
18 pages