Semi-simplified modulo p of semi-stable representations: an algorithmic approach

From MaRDI portal
Semi-simplified modulo $p$ of semi-stable representations: an algorithmic approach




Abstract: The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo p of a semi-stable Qp-representation of the absolute Galois group of a p-adic field (emph{i.e.} a finite extension of Qp). In order to do so, we use abundantly the p-adic Hodge theory and, in particular, the Breuil-Kisin modules theory.














This page was built for publication: Semi-simplified modulo $p$ of semi-stable representations: an algorithmic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6244852)