๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of Linear Systems on Hyperelliptic Curves

โœ Scribed by T.G. Berry

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
448 KB
Volume
26
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

An algorithm for constructing a basis of a linear system L(D) on a hyperelliptic curve is described. Algorithms by Cantor and Chebychev for computing in the Jacobian of a hyperelliptic curve are derived as special cases. The final section describes Chebychev's application of his algorithm to elementary integration of elliptic differentials.

๐Ÿ“œ SIMILAR VOLUMES

2-Descent on the Jacobians of Hyperellip
2-Descent on the Jacobians of Hyperelliptic Curves
โœ E.F. Schaefer ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 470 KB

Let \(J\) be the Jacobian of the hyperelliptic curve \(Y^{2}=f\left(X^{2}\right)\) over a field \(K\) of characteristic 0 , where \(f\) has odd degree. We shall present an embedding of the group \(J(K) / 2 J(K)\) into the group \(L^{* / L^{* 2}}\) where \(L=K[T] / f(T)\). Since this embedding is der

On Egghe's construction of Lorenz curves
On Egghe's construction of Lorenz curves
โœ Ronald Rousseau ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

## Abstract Contrary to Burrell's statements, Egghe's theory of continuous concentration does include the construction of a standard Lorenz curve.

The Rank of the Cartier Operator and Lin
The Rank of the Cartier Operator and Linear Systems on Curves
โœ Riccardo Re ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 97 KB

We find bounds for the genus of a curve over a field of characteristic p under the hypothesis that the Cartier operator of this curve has low rank and in the case where it is nilpotent. แฎŠ 2001 Academic Press c w x e.g., 11 . Moreover, we wish to remark that the rank of the Cartier operator on a curv

On the Intersections of Systems of Curve
On the Intersections of Systems of Curves
โœ Gelasio Salazar ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 85 KB

We show that the minimum number i m (n) of intersections in an n-family of simple closed curves whose elements pairwise intersect at least once and in less than m points satisfies the asymptotic behavior lim n ร„ i m (n)ร‚( n 2 )=2.

Constructive approximation of non-linear
Constructive approximation of non-linear discrete-time systems
โœ Sandberg, Irwin W. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 117 KB ๐Ÿ‘ 2 views

It is known that large classes of approximately-"nite-memory maps can be uniformly approximated arbitrarily well by the maps of certain non-linear structures. As an application, it was proved that time-delay networks can be used to uniformly approximate arbitrarily well the members of a large class