Skip to content
DraconiticResearch
Search Sources API
181,716 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

Symmetry and solvability: Galois groups of equivariant enumerative problems

Abstract

At the genesis of Galois theory at the end of the 19th century, enumerative geometers were concerned with the solvability of various problems: for instance whether one can express lines on a cubic surface in radicals in terms of the coefficients that define it. By work of Hermite and a celebrated theorem of Harris, this is equivalent to determining whether the monodromy group of a certain finite étale cover is solvable. This problem, as well as the related problem of computing bitangents to plane quartics, are both unsolvable. When one restricts to the locus of G-symmetric cubic surfaces, monodromy will drop and can become solvable. In this setting there are four flavors of monodromy one can consider: the one from restricting the classical cover, the one over the GIT quotient after modding out by projective transformations, and two related notions of "monodromy" coming from the stacky cover of G-symmetric lines on G-symmetric cubic surfaces - unlike in the non-symmetric setting these are all different. In this paper we characterize the relationships between all four notions of monodromy in the general setting of quotient stacks, and use these connections to compute all these monodromy groups for all 11 possible automorphism groups of smooth cubic surfaces, as well as for all 12 possible automorphism groups for smooth planar quartics. We demonstrate that, in the presence of any symmetry whatsoever, the problem of solving for lines on cubic surfaces or bitangents to plane quartics is solvable.

Related

  1. Bulk-deformed enumerative mirror symmetry for toric Fano surfaces
    Xuanchun Lu
    arXivPreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryGeometry & topologyarXiv
  2. A Galois-equivariant Dade-Glauberman-Nagao correspondence with central defect
    Shi Chen
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. On the W2,p solvability for mixed boundary value problems
    Rohit Khandelwal, Zongyuan Li
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  4. Solvability of a New Class of ψ-Fractional Unilateral Constrained Friction Problems
    Furi Guo, Fang Luo, Shugui Kang
    Fractal and FractionalPeer-reviewedCC BY 4.0Analysis & PDEsCrossref
  5. Boundary value problems for linear differential-algebraic equations: solvability via the Kronecker canonical form
    Anar Assanova, Carsten Trunk, Roza Uteshova +1
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{brazelton2026symmetry,
  title = {{Symmetry and solvability: Galois groups of equivariant enumerative problems}},
  author = {Thomas Brazelton and Alberto Landi and Sidhanth Raman},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.30442},
  eprint = {2609.30442},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.30442},
}
RIS
TY  - UNPB
TI  - Symmetry and solvability: Galois groups of equivariant enumerative problems
AU  - Thomas Brazelton
AU  - Alberto Landi
AU  - Sidhanth Raman
PY  - 2026
DA  - 2026/09/24
PB  - arXiv
DO  - 10.48550/arxiv.2609.30442
UR  - https://arxiv.org/abs/2609.30442
AB  - At the genesis of Galois theory at the end of the 19th century, enumerative geometers were concerned with the solvability of various problems: for instance whether one can express lines on a cubic surface in radicals in terms of the coefficients that define it. By work of Hermite and a celebrated theorem of Harris, this is equivalent to determining whether the monodromy group of a certain finite étale cover is solvable. This problem, as well as the related problem of computing bitangents to plane quartics, are both unsolvable. When one restricts to the locus of G-symmetric cubic surfaces, monodromy will drop and can become solvable. In this setting there are four flavors of monodromy one can consider: the one from restricting the classical cover, the one over the GIT quotient after modding out by projective transformations, and two related notions of "monodromy" coming from the stacky cover of G-symmetric lines on G-symmetric cubic surfaces - unlike in the non-symmetric setting these are all different. In this paper we characterize the relationships between all four notions of monodromy in the general setting of quotient stacks, and use these connections to compute all these monodromy groups for all 11 possible automorphism groups of smooth cubic surfaces, as well as for all 12 possible automorphism groups for smooth planar quartics. We demonstrate that, in the presence of any symmetry whatsoever, the problem of solving for lines on cubic surfaces or bitangents to plane quartics is solvable.
ER  -