A proof of the Brill-Noether method from scratch
From MaRDI portal
Publication:6408937
arXiv2208.12725MaRDI QIDQ6408937FDOQ6408937
Authors: Elena Berardini, Alain Couvreur, Grégoire Lecerf 
Publication date: 26 August 2022
Abstract: In 1874 Brill and Noether designed a seminal geometric method for computing bases of Riemann-Roch spaces. From then, their method has led to several algorithms, some of them being implemented in computer algebra systems. The usual proofs often rely on abstract concepts of algebraic geometry and commutative algebra. In this paper we present a short self-contained and elementary proof that mostly needs Newton polygons, Hensel lifting, bivariate resultants, and Chinese remaindering.
This page was built for publication: A proof of the Brill-Noether method from scratch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408937)
