Papers › Explicit non-Gorenstein R=T via rank bounds II: Computational aspects
Explicit non-Gorenstein R=T via rank bounds II: Computational aspects
Catherine Hsu, Preston Wake, Carl Wang-Erickson
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This is the second in a pair of papers about residually reducible Galois deformation rings with non-optimal level. In the first paper, we proved a Galois-theoretic criterion for the deformation ring to be as small as possible. This paper focuses on the computations needed to verify this criterion. We adapt a technique developed by Sharifi to compute number fields with twisted-Heisenberg Galois group and prescribed ramification, and compute the splitting behavior of primes in these extensions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections