2002
DOI: 10.1006/jsco.2001.0513
|View full text |Cite
|
Sign up to set email alerts
|

Computing Riemann–Roch Spaces in Algebraic Function Fields and Related Topics

Abstract: We develop a simple and efficient algorithm to compute Riemann-Roch spaces of divisors in general algebraic function fields which does not use the Brill-Noether method of adjoints or any series expansions. The basic idea also leads to an elementary proof of the Riemann-Roch theorem. We describe the connection to the geometry of numbers of algebraic function fields and develop a notion and algorithm for divisor reduction. An important application is to compute in the divisor class group of an algebraic function… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
107
0
3

Year Published

2002
2002
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 127 publications
(110 citation statements)
references
References 23 publications
0
107
0
3
Order By: Relevance
“…This is classically achieved by blowing up or using series expansions, but none of these methods is fully satisfactory: the complexity of blowing up is not well understood in the worst cases, and computing series expansions is only possible when the characteristic of K is zero or large enough. Work by Hess [17], using general normalization algorithms, provides a satisfactory algorithm in general. Possible references for these algorithms are Hess [17], Makdisi [19], Diem [11], or the quick account at the beginning of [9].…”
Section: Operations In J(k)mentioning
confidence: 99%
See 2 more Smart Citations
“…This is classically achieved by blowing up or using series expansions, but none of these methods is fully satisfactory: the complexity of blowing up is not well understood in the worst cases, and computing series expansions is only possible when the characteristic of K is zero or large enough. Work by Hess [17], using general normalization algorithms, provides a satisfactory algorithm in general. Possible references for these algorithms are Hess [17], Makdisi [19], Diem [11], or the quick account at the beginning of [9].…”
Section: Operations In J(k)mentioning
confidence: 99%
“…Work by Hess [17], using general normalization algorithms, provides a satisfactory algorithm in general. Possible references for these algorithms are Hess [17], Makdisi [19], Diem [11], or the quick account at the beginning of [9].…”
Section: Operations In J(k)mentioning
confidence: 99%
See 1 more Smart Citation
“…Such a divisor decomposes uniquely into a sum of places of certain degrees and multiplicities just like the case of rational integers and prime factorizations, and smoothness probabilities hold. Computing these divisor class representatives can be done by reduction techniques as described in [14], and this leads also to a way of computing in the divisor class group of C 0 which generalizes the Cantor method for hyperelliptic curves. We remark that for hyperelliptic curves addition takes O(g for some constant c > 1, and we expect this to be essentially true for q = p because of possible alternating signs of the trace terms.…”
Section: Index Calculusmentioning
confidence: 99%
“…A relevant concept is that of reduced basis of a lattice with respect to the given length function. W. M. Schmidt used reduced bases of integral closures of certain subrings of function fields of curves over finite fields, as a crutial tool for the design of algorithms to compute bases of the Riemann-Roch spaces attached to divisors of the curve [12,13,8,2].…”
Section: Introductionmentioning
confidence: 99%