2002/10/30 by Marc Chardin
Mathematics · #math.AC #math.AG #msc:13P10 #msc:14Q20 #msc:13D45 #msc:13D02
published as ACM SIGSAM Bulletin, Issue 138, vol. 35, n. 4, 2001, pp. 23-39
arxiv created 2002/10/30 · arxiv updated 2009/11/30
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.