Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

Explicit computation of Galois p-groups unramified at p

Descargar SCORM

Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).

Para poder solicitar este recurso debe identificarse como usuario de la biblioteca

 
Ver

Detalles del recurso

Marcadores Sociales
Explicit computation of Galois p-groups unramified at p
Id. 20816320
Titulo Explicit computation of Galois p-groups unramified at p
Autor(es) Boston, Nigel
Leedham-Green, Charles
Localización http://arxiv.org/abs/math/0009255
Versión 1.0
Estado Final
Descripción In this paper we introduce a new method for finding Galois groups by computer. This is particularly effective in the case of Galois groups of p-extensions ramified at finitely many primes but unramified at the primes above p. Such Galois groups have been regarded as amongst the most mysterious objects in number theory. Very little has hitherto been discovered regarding them despite their importance in studying p-adic Galois representations unramified at p. The conjectures of Fontaine-Mazur say that they should have no p-adic analytic quotients (equivalently, the images of the Galois representations should always be finite), and there are generalizations due to the first author, suggesting that they should instead have `large' actions on certain trees. The idea is to modify the p-group generation algorithm so that as it goes along, it uses number-theoretical information to eliminate groups that cannot arise as suitable quotients of the Galois group under investigation. In the best cases we obtain a short list of candidates for the Galois group. This leads to various conjectures.
Palabras clave Mathematics - Number Theory
Tipo de recurso Texto Narrativo
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
Requerimientos técnicos Browser: Any
Fecha de contribución 26-mar-2007
Contacto

Valoración de los usuarios

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.