Software and databases
This section lists software documentation and arithmetic databases. The articles on algorithms explain the computations.
Open the method guide →References
- A database for field extensions of the rationalsKlüners, Jürgen and Malle, Gunter · 2001
Explains the arithmetic database, its construction methods, and its emphasis on Galois groups and signatures. Consult the live database separately, since its coverage has grown beyond the original paper.
- FLINT documentation: polynomial factorization algorithmsThe FLINT Team
Official explanations of finite-field and integer-polynomial factorization, connecting Berlekamp, Cantor–Zassenhaus, Hensel lifting, and lattice recombination with library routines. These are implementation guides; use the cited original papers for theorem statements and complexity proofs.
- A database for number fieldsKlüners, Jürgen and Malle, Gunter
A source of defining polynomials indexed by Galois group and signature. At access, the site reports coverage through degree twenty-three for all transitive groups except M23, with stated limitations on signatures and discriminant minima.
- The L-functions and Modular Forms Database: number fields and Galois groupsThe LMFDB Collaboration
Searchable number-field records and transitive-group data, with labels, invariants, and links between objects. Consult the completeness and reliability pages for each collection; a group appearing in a transitive-group catalogue does not by itself prove its realization over the rationals.
- Magma Handbook: Galois groupsMagma Computational Algebra System
Official documentation for the Stauduhar-based GaloisGroup implementation, with no fixed degree cap for the documented integer, rational and number-field polynomial inputs. GaloisGroup does not itself certify its conditional steps; the documented GaloisProof overloads attempt certification for integer polynomials or absolute number fields. Record a successful result and the exact input/options.
- PARI/GP reference manual: general number fields and polgaloisThe PARI Group
Official reference for polgalois and number-field computations. PARI/GP 2.19 requires irreducible rational input of degree at most seven, or eleven with galdata. The manual explicitly warns that insufficient initial precision can rarely produce a wrong result; record precision, output convention, and version.
- SageMath reference manual: polynomial and number-field Galois groupsThe Sage Developers
Official interfaces for polynomial and number-field Galois groups. SageMath 10.10 documents PARI through degree 11, GAP fallback with a documented range through degree 15 and some higher examples, and a Magma wrapper limited by group identification through degree 30. The number-field interface distinguishes original-root and Galois-closure actions and warns about absolute versus relative ground fields. A wrapper is not an independent backend proof.
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.