arXiv Open Access 2025

An algorithm to compute Selmer groups via resolutions by permutations modules

Fabrice Etienne
Lihat Sumber

Abstrak

Given a number field with absolute Galois group $\mathcal{G}$, a finite Galois module $M$, and a Selmer system $\mathcal{L}$, this article gives a method to compute Sel$_\mathcal{L}$, the Selmer group of $M$ attached to $\mathcal{L}$. First we describe an algorithm to obtain a resolution of $M$ where the morphisms are given by Hecke operators. Then we construct another group $H^1_S(\mathcal{G}, M)$ and we prove, using the properties of Hecke operators, that $H^1_S(\mathcal{G}, M)$ is a Selmer group containing Sel$_\mathcal{L}$. Then, we discuss the time complexity of this method.

Penulis (1)

F

Fabrice Etienne

Format Sitasi

Etienne, F. (2025). An algorithm to compute Selmer groups via resolutions by permutations modules. https://arxiv.org/abs/2504.13506

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2025
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓