Computing Galois groups of Fano problems
Reviewed by Pithpith:RUL42F4Copen to challenge →
read the original abstract
A Fano problem consists of enumerating linear spaces of a fixed dimension on a variety, generalizing the classical problem of 27 lines on a cubic surface. Those Fano problems with finitely many linear spaces have an associated Galois group that acts on these linear spaces and controls the complexity of computing them in coordinates via radicals. Galois groups of Fano problems were first studied by Jordan, who considered the Galois group of the problem of 27 lines on a cubic surface. Recently, Hashimoto and Kadets nearly classified all Galois groups of Fano problems by determining them in a special case and by showing that all other Fano problems have Galois group containing the alternating group. We use computational tools to prove that several Fano problems of moderate size have Galois group equal to the symmetric group, each of which were previously unknown.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.