2020
DOI: 10.48550/arxiv.2002.01900
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Semisimplification of the category of tilting modules for GL_n

Jonathan Brundan,
Inna Entova-Aizenbud,
Pavel Etingof
et al.

Abstract: We describe the semisimplification of the monoidal category of tilting modules for the algebraic group GLn in characteristic p > 0. In particular, we compute the dimensions of the indecomposable tilting modules modulo p.

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…In fact, the pair (S, U ) is universal among pairs, cf. for example [AK02,EtO18], and also [H15,BEEO20].…”
Section: Notationmentioning
confidence: 99%
“…In fact, the pair (S, U ) is universal among pairs, cf. for example [AK02,EtO18], and also [H15,BEEO20].…”
Section: Notationmentioning
confidence: 99%
“…In this section we describe a linear monoidal category called the polynomial web category for GL n over a field k [CKM14], [BEAEO20]. Our presentation closely follows [BEAEO20].…”
Section: Polynomial Gl N Websmentioning
confidence: 99%
“…In this section we describe a linear monoidal category called the polynomial web category for GL n over a field k [CKM14], [BEAEO20]. Our presentation closely follows [BEAEO20]. Indeed, in the description below, our presentation is easily derived as the quotient of Web [BEAEO20, Definition 4.7] by the monoidal ideal generated by the identities of objects of weight m, where m > n. If k is algebraically closed, the monoidal category described below is equivalent to the monoidal category of polynomial representations of Gl n , which can be equivalently described as the full subcategory of tilting modules for GL n generated by wedge powers of the standard n-dimensional representation (see [BEAEO20, Remark 4.15]).…”
Section: Polynomial Gl N Websmentioning
confidence: 99%