Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/159607
DC Field | Value | |
---|---|---|
dc.title | Quantum invariants for decomposition problems in type A rings of representations | |
dc.contributor.author | MAXIM GUREVICH | |
dc.date.accessioned | 2019-09-27T06:36:41Z | |
dc.date.available | 2019-09-27T06:36:41Z | |
dc.date.issued | 2017 | |
dc.identifier.citation | MAXIM GUREVICH (2017). Quantum invariants for decomposition problems in type A rings of representations. arXiv. ScholarBank@NUS Repository. | |
dc.identifier.uri | https://scholarbank.nus.edu.sg/handle/10635/159607 | |
dc.description.abstract | We prove a combinatorial rule for a complete decomposition, in terms of Langlands parameters, for representations of p-adic GL_n that appear as parabolic induction from a large family (ladder representations). Our rule obviates the need for computation of Kazhdan-Lusztig polynomials in these cases, and settles a conjecture posed by Lapid. These results are transferrable into various type A frameworks, such as the decomposition of convolution products of homogeneous KLR-algebra modules, or tensor products of snake modules over quantum affine algebras. The method of proof applies a quantization of the problem into a question on Lusztig's dual canonical basis and its embedding into a quantum shuffle algebra, while computing numeric invariants which are new to the p-adic setting. | |
dc.source | Elements | |
dc.type | Article | |
dc.date.updated | 2019-09-27T06:15:17Z | |
dc.contributor.department | MATHEMATICS | |
dc.description.sourcetitle | arXiv | |
dc.published.state | Published | |
Appears in Collections: | Staff Publications Elements |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
Selecta-submission-MGurevich.pdf | Submitted version | 598.97 kB | Adobe PDF | OPEN | Pre-print | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.