Projective schemes: What is Computable in low degree?
classification
🧮 math.AC
math.AG
keywords
algorithmsarticlecastelnuovo-mumfordcomputablecomputationaldefiningdegreedifferent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.