A general algorithm computes Selmer groups for finite Galois modules using permutation-module resolutions and Hecke operators.
Constructions using Galois Theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group computations for this task. We also describe the computation of geometric Galois groups (monodromy groups) and their use in computing absolute factorizations.
fields
cs.SC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An algorithm to compute Selmer groups via resolutions by permutations modules
A general algorithm computes Selmer groups for finite Galois modules using permutation-module resolutions and Hecke operators.