ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A natural question is how to compute efficiently such Galois representations in the exceptional case. 3. Computing the projective representation The first step is to compute the number field cut by the projective representation of the Galois group. There are known algorithms using computational class field theory to build all fields of Galois group A4 or S4 of a given discriminant, by using towers of Abelian extensions. Aurel Page modified them to build all fields leading to a representation of a given conductor. These algorithms are subexponential in the logarithm of the conductor. 3.1. The A5 case. For the case A5 a full table of all number fields with Galois group A5 with conductor less than 106 has been computed by the authors, by using a targeted Hunter search and using the ratpoints[5] program to find the values of the last coefficient that makes the discriminant a square. This required about 300 core\timesmonths. For this computation we worked with Michael Stoll to improve ratpoints to take advantage of the new SIMD capabilities (AVX256) in modern CPUs.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.