2018
DOI: 10.1142/s1793042118501117
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for computing the reduction of 2-dimensional crystalline representations of Gal(ℚ¯p/ℚp)

Abstract: We describe an algorithm to compute the reduction modulo p of a crystalline Galois representation of dimension 2 of Gal(Q p /Qp) with distinct Hodge-Tate weights via the semi-simple modulo p Langlands correspondence. We give some examples computed with an implementation of this algorithm in SAGE. Proposition 2.3.1. Let Q be a finite length quotient of I(σ a (b)). Then the Jordan-Hoelder factors of Q are of the form π (a, λ, ω Here is a slightly more precise statement, which follows immediatly the results of [… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…A conjecture. Based on these results for slopes 1 2 and 1, and some computations of Rozensztajn [Roz18] for some small half-integral slopes, one might guess that in the general exceptional case v ∈ 1 2 Z and b = 2v, there are b + 1 possibilities for Vk,ap , with various irreducible and reducible cases occurring alternately. More precisely, we make the following qualitative conjecture.…”
Section: Introductionmentioning
confidence: 86%
“…A conjecture. Based on these results for slopes 1 2 and 1, and some computations of Rozensztajn [Roz18] for some small half-integral slopes, one might guess that in the general exceptional case v ∈ 1 2 Z and b = 2v, there are b + 1 possibilities for Vk,ap , with various irreducible and reducible cases occurring alternately. More precisely, we make the following qualitative conjecture.…”
Section: Introductionmentioning
confidence: 86%
“…For other examples, for small values of k and p, we refer the reader to [Roz16], where an algorithm to computeV ss k,ap is described and implemented for all positive slopes.…”
mentioning
confidence: 99%
“…With some exceptions, V k,a has been computed when v p (a) < 2 in the work of Buzzard, Gee, Ganguli, Ghate, Bhattacharya, Rozensztajn, and Rai in [BG15], [BGR18], [BG09], [BG13], [GG15], and [GR]. Finally, Rozensztajn's work [Roz18] gives an algorithm that computes V k,a for given p, k, a, and her work [Roz20] gives an algorithm that finds the locus of all a such that V k,a = ρ for given p, k, and a modulo p representation ρ.…”
Section: Known Resultsmentioning
confidence: 99%