2011
DOI: 10.48550/arxiv.1109.6879
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Modular forms applied to the computational inverse Galois problem

Johan Bosman

Abstract: For each of the groups PSL 2 (F 25 ), PSL 2 (F 32 ), PSL 2 (F 49 ), PGL 2 (F 25 ), and PGL 2 (F 27 ), we display the first explicitly known polynomials over Q having that group as Galois group. Each polynomial is related to a Galois representation associated to a modular form. We indicate how computations with modular Galois representations were used to obtain these polynomials. For each polynomial, we also indicate how to use Serre's conjectures to determine the modular form giving rise to the related Galois … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…It would be interesting to compute explicitly these Galois representations ρ f,l for several reasons: first, simply for the sake of the Galois representation itself, next, because the number field L will often 1 be an explicit solution to the inverse Galois problem for GL 2 (F ℓ ) (cf [Bos07a], [Bos11]) with controlled ramification, and even for the Gross problem, and, last but not least, because it gives a fast way of computing the q-expansion coefficients a p of f modulo l. Letting ℓ vary, we thus obtain a Schoof-like algorithm (cf [Sch95]) to compute q-expansions of newforms, as bounds on the coefficients a p are well-known.…”
Section: Introductionmentioning
confidence: 99%
“…It would be interesting to compute explicitly these Galois representations ρ f,l for several reasons: first, simply for the sake of the Galois representation itself, next, because the number field L will often 1 be an explicit solution to the inverse Galois problem for GL 2 (F ℓ ) (cf [Bos07a], [Bos11]) with controlled ramification, and even for the Gross problem, and, last but not least, because it gives a fast way of computing the q-expansion coefficients a p of f modulo l. Letting ℓ vary, we thus obtain a Schoof-like algorithm (cf [Sch95]) to compute q-expansions of newforms, as bounds on the coefficients a p are well-known.…”
Section: Introductionmentioning
confidence: 99%