A proof of the Brill-Noether method from scratch

08/26/2022
by   Elena Berardini, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2023

Computer-assisted proofs of "Kariya's theorem" with computer algebra

We demonstrate computer-assisted proofs of "Kariya's theorem," a theorem...
research
10/31/2019

A note on commutative Kleene algebra

In this paper we present a detailed proof of an important result of alge...
research
02/28/2023

A short proof for the parameter continuation theorem

The Parameter Continuation Theorem is the theoretical foundation for pol...
research
07/12/2019

Elementary proofs of generalized continued fraction formulae for e

In this short note we prove two elegant generalized continued fraction f...
research
02/08/2022

Symbolic Comparison of Geometric Quantities in GeoGebra

Comparison of geometric quantities usually means obtaining generally tru...
research
10/27/2019

Formalising perfectoid spaces

Perfectoid spaces are sophisticated objects in arithmetic geometry intro...
research
08/13/2020

An Elementary Linear-Algebraic Proof without Heavy Computation for the Group Law on Elliptic Curves

The group structure on the rational points of elliptic curves plays seve...

Please sign up or login with your details

Forgot password? Click here to reset