The maximal rank and the minimal generation of union of elliptic curves are studied, by means of an algorithm based on the study of interpolation on points. We give an application to the study of curves on threefolds.

Chiantini, L., Cioffi, F., Orecchia, F. (2001). Computing minimal generators of ideals of elliptic curves. In Applications of algebraic geometry to coding theory, physics and computation (pp. 23-35). Dordrecht : Kluwer Academic Publisher.

Computing minimal generators of ideals of elliptic curves

CHIANTINI, LUCA;
2001-01-01

Abstract

The maximal rank and the minimal generation of union of elliptic curves are studied, by means of an algorithm based on the study of interpolation on points. We give an application to the study of curves on threefolds.
2001
9781402000058
Chiantini, L., Cioffi, F., Orecchia, F. (2001). Computing minimal generators of ideals of elliptic curves. In Applications of algebraic geometry to coding theory, physics and computation (pp. 23-35). Dordrecht : Kluwer Academic Publisher.
File in questo prodotto:
File Dimensione Formato  
0Ellipt.pdf

non disponibili

Tipologia: Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 1.47 MB
Formato Adobe PDF
1.47 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/22833
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo