Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/122564
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baraglia, D. | - |
dc.contributor.author | Kamgarpour, M. | - |
dc.contributor.author | Varma, R. | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | International Mathematics Research Notices, 2019; 2019(21):6499-6528 | - |
dc.identifier.issn | 1073-7928 | - |
dc.identifier.issn | 1687-0247 | - |
dc.identifier.uri | http://hdl.handle.net/2440/122564 | - |
dc.description.abstract | Let G be a parahoric group scheme over a complex projective curve X of genus greater than one. Let BunG denote the moduli stack of G-torsors on X. We prove several results concerning the Hitchin map on TBunG. We first show that the parahoric analogue of the global nilpotent cone is isotropic and use this to prove that BunG is “very good” in the sense of Beilinson–Drinfeld. We then prove that the parahoric Hitchin map is a Poisson map whose generic fibres are abelian varieties. Together, these results imply that the parahoric Hitchin map is a completely integrable system. | - |
dc.description.statementofresponsibility | David Baraglia, Masoud Kamgarpour, Rohith Varma | - |
dc.language.iso | en | - |
dc.publisher | Oxford University Press | - |
dc.rights | © The Author(s) 2018. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permission@oup.com. | - |
dc.source.uri | http://dx.doi.org/10.1093/imrn/rnx313 | - |
dc.title | Complete Integrability of the Parahoric Hitchin System | - |
dc.type | Journal article | - |
dc.identifier.doi | 10.1093/imrn/rnx313 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Baraglia, D. [0000-0002-8450-1165] | - |
Appears in Collections: | Aurora harvest 4 Mathematical Sciences publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.