Projective schemes: What is Computable in low degree?

Details Projective schemes: What is Computable in low degree? Projective schemes: What is Computable in low degree?

2002-10-30

arxiv.org/abs/math/0210455v1

ACM SIGSAM Bulletin, Issue 138, vol. 35, n. 4, 2001, pp. 23-39

Mathematics

Commutative Algebra

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Projective schemes: What is Computable in low degree? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Projective schemes: What is Computable in low degree?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Projective schemes: What is Computable in low degree? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534843