degree of semi-regularity

[malb]

A way of estimating the complexity of Gröbner basis computations for random systems is to consider the degree of regularity as an upper bound for the degree which will be reached. Thus, it might be helpful for multivariate polynomial ideals to have a method for computing the degree of semi-regularity.

Apply: attachment: trac_10331_reviewer_cumulative.patch

CC: @burcin @sagetrac-PolyBoRi

Component: commutative algebra

Author: Martin Albrecht

Reviewer: Marshall Hampton

Merged: sage-4.6.2.alpha3

Issue created by migration from https://trac.sagemath.org/ticket/10331

[malb]

comment:1

The attached patch implements the proposal (and also moves a method which belongs to a different class, sorry for that)

[malb]

comment:3

Attachment: dreg.patch.gz

The updated patch correctly ignores 0 in the basis now. Anyone up for a quick review?

[sagetrac-mhampton]

Reviewer: Marshall Hampton

[sagetrac-mhampton]

comment:4

I just cleaned up a few minor doc problems. Otherwise, sage/rings tests pass and this looks good. Martin, if you can check my patch is OK I think you can give a final positive review.

[malb]

Attachment: trac_10331_reviewer_cumulative.patch.gz

replaced a few non-ascii characters by ascii characters

[malb]

comment:5

your patch looks good. I replaced a few non-ascii characters with their ascii equivalents (text was copied from a pdf, so e.g. "fi" was one character etc.)

[malb]

comment:6

Btw. make ptestlong passes on geom.math.

[jdemeyer]

Merged: sage-4.6.2.alpha3