An algorithm to compute Selmer groups via resolutions by permutations modules

Documenti analoghi

• PySymmetry: A Sage/Python Framework for the Symmetry Reduction of Linear G-Equivariant Systems
  di: da Silva, Leon D., et al.
  Pubblicazione: (2025)
• Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
  di: Caruso, Xavier, et al.
  Pubblicazione: (2023)
• Finite groups of matrices over quadratic number fields
  di: Yurshevich, Daniil
  Pubblicazione: (2025)
• Generalised Burnside and Dixon algorithms for irreducible projective representations
  di: Szabó, Attila
  Pubblicazione: (2025)
• An algorithm to recognize regular singular Mahler systems
  di: Faverjon, Colin, et al.
  Pubblicazione: (2021)