Conference Proceedings

Enumerating Galois representations in Sage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6327 LNCS 256-259
DOI: 10.1007/978-3-642-15582-6_44
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an algorithm for enumerating all odd semisimple two-dimensional mod p Galois representations unramified outside p. We also discuss the implementation of this algorithm in Sage and give a summary of the results we obtained. © 2010 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Citro, C., & Ghitza, A. (2010). Enumerating Galois representations in Sage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 256–259). https://doi.org/10.1007/978-3-642-15582-6_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free