Computational details on the disproof of modularity
Ralf Gerkmann, Mao Sheng, Kang Zuo
TL;DR
This paper details the computational methods used to disprove modularity by performing Jacobian ring calculations with Magma, providing insights into the algebraic techniques involved.
Contribution
It offers a comprehensive account of the Jacobian ring computations essential for the disproof of modularity, utilizing computer algebra systems.
Findings
Successful implementation of Jacobian ring calculations in Magma
Clarification of algebraic steps in disproof of modularity
Enhanced reproducibility of complex algebraic computations
Abstract
The purpose of these notes is to provide the details of the Jacobian ring computations carried out in [1], based on the computer algebra system Magma [2].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Differential Equations and Dynamical Systems · Homotopy and Cohomology in Algebraic Topology