Opened 11 years ago
Closed 11 years ago
#10331 closed enhancement (fixed)
degree of semi-regularity
Reported by: | malb | Owned by: | malb |
---|---|---|---|
Priority: | major | Milestone: | sage-4.6.2 |
Component: | commutative algebra | Keywords: | |
Cc: | burcin, polybori | Merged in: | sage-4.6.2.alpha3 |
Authors: | Martin Albrecht | Reviewers: | Marshall Hampton |
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description (last modified by )
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.
Attachments (2)
Change History (10)
comment:1 Changed 11 years ago by
comment:2 Changed 11 years ago by
- Status changed from new to needs_review
Changed 11 years ago by
comment:3 Changed 11 years ago by
The updated patch correctly ignores 0 in the basis now. Anyone up for a quick review?
comment:4 Changed 11 years ago by
- Reviewers set to Marshall Hampton
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.
comment:5 Changed 11 years ago by
- Description modified (diff)
- Status changed from needs_review to positive_review
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.)
comment:6 Changed 11 years ago by
Btw. make ptestlong
passes on geom.math.
comment:7 Changed 11 years ago by
- Milestone set to sage-4.6.2
comment:8 Changed 11 years ago by
- Merged in set to sage-4.6.2.alpha3
- Resolution set to fixed
- Status changed from positive_review to closed
The attached patch implements the proposal (and also moves a method which belongs to a different class, sorry for that)