A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces

We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space \(L(D)\) associated to a divisor \(D\) on a projective nodal plane curve \(\mathcal C\) over a sufficiently large perfect field \(k\). Our main result shows that this algorithm requir...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Aude Le Gluher, Pierre-Jean Spaenlehauer
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 19.10.2020
Subjects:	Algorithms Complexity Computation Computer algebra Curves Geometric algorithms Magma Set theory Statistical analysis Upper bounds
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!