Projective schemes: What is Computable in low degree? - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue ACM SIDSAM Bulletin Année : 2001

Projective schemes: What is Computable in low degree?

Marc Chardin

Résumé

This article first presents two examples of algorithms that extracts information on scheme out of its defining equations. We also give a review on the notion of Castelnuovo-Mumford regularity, its main properties (in particular its relation to computational issues) and different ways that were used to estimate it.

Dates et versions

hal-00137102 , version 1 (16-03-2007)

Identifiants

Citer

Marc Chardin. Projective schemes: What is Computable in low degree?. ACM SIDSAM Bulletin, 2001, 35 Issue 138 numéro 4, pp.23-39. ⟨hal-00137102⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More