Approximate computations with modular curves
From MaRDI portal
(Redirected from Publication:5264246)
Software, source code, etc. for problems pertaining to number theory (11-04) Galois representations (11F80) Arithmetic aspects of modular and Shimura varieties (11G18) Algebraic number theory computations (11Y40) Modular and Shimura varieties (14G35) Computational aspects of algebraic curves (14Q05) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Abstract: This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations with modular curves and their Jacobians. These approximations are done in polynomial time in the dimension and the required number of significant digits. We explain the main ideas of how the approximations are done, illustrating them with examples, and we sketch some applications in number theory.
Recommendations
Cited in
(3)
This page was built for publication: Approximate computations with modular curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264246)