Projective schemes: What is Computable in low degree?
Commutative Algebra
2007-05-23 v1 Algebraic Geometry
Abstract
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.
Cite
@article{arxiv.math/0210455,
title = {Projective schemes: What is Computable in low degree?},
author = {Marc Chardin},
journal= {arXiv preprint arXiv:math/0210455},
year = {2007}
}