Projective schemes: What is Computable in low degree?

Simple item page
dc.creatorChardin, Marc
dc.date2002-10-30
dc.date.accessioned2026-07-07T04:52:28Z
dc.date.available2026-07-07T04:52:28Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/math/0210455
dc.identifierhttp://arxiv.org/abs/math/0210455
dc.identifierACM SIGSAM Bulletin, Issue 138, vol. 35, n. 4, 2001, pp. 23-39
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65474
dc.subjectCommutative Algebra
dc.subjectAlgebraic Geometry
dc.subject13P10; 14Q20; 13D45; 13D02
dc.titleProjective schemes: What is Computable in low degree?
dc.typetext

Files

Collections

arXiv