Semi-simplified modulo $p$ of semi-stable representations: an algorithmic approach
Number Theory
2013-09-18 v1
Abstract
The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo of a semi-stable -representation of the absolute Galois group of a -adic field (\emph{i.e.} a finite extension of ). In order to do so, we use abundantly the -adic Hodge theory and, in particular, the Breuil-Kisin modules theory.
Cite
@article{arxiv.1309.4194,
title = {Semi-simplified modulo $p$ of semi-stable representations: an algorithmic approach},
author = {Xavier Caruso and David Lubicz},
journal= {arXiv preprint arXiv:1309.4194},
year = {2013}
}
Comments
35 pages, in French