Science Score: 44.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
    Found CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
    Found .zenodo.json file
  • DOI references
  • Academic publication links
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (7.7%) to scientific vocabulary
Last synced: 6 months ago · JSON representation ·

Repository

Basic Info
  • Host: GitHub
  • Owner: IgnasiSanchez
  • License: gpl-3.0
  • Language: M
  • Default Branch: main
  • Size: 49.8 KB
Statistics
  • Stars: 0
  • Watchers: 0
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created 8 months ago · Last pushed 6 months ago
Metadata Files
Readme License Citation

README.md

Comparing Reducible Representations with mod p image a p-group

Authors: Freitas, Nuno; Sánchez-Rodríguez, Ignasi.

Our Paper: this will be in Arxiv soon

Prerequisites

You need to download Edgar Costa's polred for Magma https://github.com/edgarcosta/MagmaPolred

In Magma's v2.28-5 version the function SmallestGeneratingSet was introduced. If your Magma version is one from before, you won't have this function and the code might run slower, depending on how many generators Magma finds for your Galois groups.

How to run

After installing the prerequisites and cloning the project, you need to change the spec path for Edgar Costa's code in the file GreniesAlgorithm.m.

AttachSpec("PathToSpec");

You should also change the default parisize as it is recommeneded in Edgar Costa's repository.

The examples in the paper correspond to the procedures Example3Adic for the 3-adic example (section 7) and ExampleOfGrenie for the validation of our code using Grenié's example (section 6). They are both in GreniesAlgorithm.m. So, for example, running the example of Grenié would look like this:

load "GreniesAlgorithm.m"; middleExtensions := []; ExampleOfGrenie(~middleExtensions);

This fills the list middleExtensions with the tower $K0 \subseteq K1\subseteq \dots K_S$ for this example.

To compute the minimal set of primes $T$ one can use FrobeniusWithRelativeDecGrp.m for the 3-adic example. Our code for the primes in Grenié's example is not uploaded yet, but it is the same as in the 3-adic example, using Magma's FrobeniusElement instead of computing the Decomposition Groups.


We thank John Voight and Stephan Elsenhans for the GaloisAutomorphismGroup.m file. This function uses the GaloisData from the GaloisGroup computations and recovers the automorphisms acting on the field. This function is much faster than using AutomorphismGroup in the Galois case.

Owner

  • Login: IgnasiSanchez
  • Kind: user

Citation (citation.bib)

@misc{git,
  accessed = {2025-07-10},
  author = {Sánchez-Rodríguez, Ignasi and Freitas, Nuno},
  title = {{Comparing Galois Representations in the residually Reducible Case}},
  howpublished = "\url{https://github.com/IgnasiSanchez/ComparingReducibleReps}",
}

GitHub Events

Total
  • Push event: 11
Last Year
  • Push event: 11