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

Bessel $F$-isocrystals for reductive groups

Daxin Xu,
Xinwen Zhu

Abstract: We construct the Frobenius structure on a rigid connection Be Ǧ on Gm for a split reductive group Ǧ introduced by Frenkel-Gross. These data form a Ǧ-valued overconvergent F -isocrystal Be † Ǧ on G m,Fp , which is the p-adic companion of the Kloosterman Ǧ-local system Kl Ǧ constructed by Heinloth-Ngô-Yun. By studying the structure of the underlying differential equation, we calculate the monodromy group of Be † Ǧ when Ǧ is almost simple (which recovers the calculation of monodromy group of Kl Ǧ due to Katz and … Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 49 publications
0
1
0
Order By: Relevance
“…Actually, for the diagonal Laurent polynomial, Wan [15] got some criterions to decide when the Newton polygon and the Hodge polygon coincide. For the non-diagonal Laurent polynomial, one main technique is Wan's decomposition theorem, that is, decomposing ∆ into small pieces which is diagonal and easy to deal with, the related work can be found in [2], [3], [15], [17], [18]. Further decomposition methods for Newton polygons are developed in [8].…”
Section: Introductionmentioning
confidence: 99%
“…Actually, for the diagonal Laurent polynomial, Wan [15] got some criterions to decide when the Newton polygon and the Hodge polygon coincide. For the non-diagonal Laurent polynomial, one main technique is Wan's decomposition theorem, that is, decomposing ∆ into small pieces which is diagonal and easy to deal with, the related work can be found in [2], [3], [15], [17], [18]. Further decomposition methods for Newton polygons are developed in [8].…”
Section: Introductionmentioning
confidence: 99%