not using cached result
Open
@mahrud is already working on this.
Since Dec 8, 2020.
Core
Gröbner bases
- Dominant language
- Macaulay2
- Stars
- 435
- Forks
- 297
- Avg merge
- 4d 20h
- Merged PRs (30d)
- 11
Description
Shouldn't we use the previously cached result here?
Macaulay2, version 1.11.1
with packages: ConwayPolynomials, Elimination, IntegralClosure, InverseSystems, LLLBases,
PrimaryDecomposition, ReesAlgebra, TangentCone
i1 : R=ZZ/101[x,y]
o1 = R
o1 : PolynomialRing
i2 : gbTrace=1
o2 = 1
i3 : I=ideal vars R
o3 = ideal (x, y)
o3 : Ideal of R
i4 : gens gb I
-- [gb]{1}(2)number of (nonminimal) gb elements = 2
-- number of monomials = 2
--
o4 = | y x |
1 2
o4 : Matrix R <--- R
i6 : groebnerBasis (I,Strategy=>"F4")
-- computing mgb F4 {Reducer => null, Threads => 0, SPairGroupSize => 0, Log => , Reducer => F4}
o6 = | y x |
1 2
o6 : Matrix R <--- R
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Assessment
This issue has not been assessed yet.