From Polynomials to Databases: Arithmetic Structures in Galois Theory

November 20, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jurgen Mezinaj arXiv ID 2511.16622 Category math.AC Cross-listed cs.LG Citations 0 Venue arXiv.org Last Checked 3 months ago
Abstract
We develop a computational framework for classifying Galois groups of irreducible degree-7 polynomials over~$\mathbb{Q}$, combining explicit resolvent methods with machine learning techniques. A database of over one million normalized projective septics is constructed, each annotated with algebraic invariants~$J_0, \dots, J_4$ derived from binary transvections. For each polynomial, we compute resolvent factorizations to determine its Galois group among the seven transitive subgroups of~$S_7$ identified by Foulkes. Using this dataset, we train a neurosymbolic classifier that integrates invariant-theoretic features with supervised learning, yielding improved accuracy in detecting rare solvable groups compared to coefficient-based models. The resulting database provides a reproducible resource for constructive Galois theory and supports empirical investigations into group distribution under height constraints. The methodology extends to higher-degree cases and illustrates the utility of hybrid symbolic-numeric techniques in computational algebra.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.AC

R.I.P. πŸ‘» Ghosted

The dual of an evaluation code

Hiram H. LΓ³pez, Ivan Soprunov, Rafael H. Villarreal

math.AC πŸ› DCC πŸ“š 20 cites 5 years ago

Died the same way β€” πŸ‘» Ghosted