-
... like, for example, `msolve`.
-
`help "leadTerm(Ideal)"` says
```
Compute a Gröbner basis and return the ideal generated by the lead terms of the Gröbner basis elements.`
```
but it's not true: it returns instead the generators…
pzinn updated
2 months ago
-
Can we add an option for calculating the transformation matrix/change of basis matrix? That is, the matrix that maps the generators of the ideal to the Gröbner basis (see for example [Oscar.jl](https:…
-
Obviously do-able since Sage can compute Gröbner basis.
Here is a discussion of how to avoid expensive lex term order computations ---
https://mathoverflow.net/questions/104846/solving-the-field…
-
Define
```
sage: P.=QQ[]
sage: J = P*[P.random_element() for _ in range(100)]
```
**__Hash is broken__**
`J.__hash__` is:
```
def __hash__(self):
return hash(str(self))
```
However, …
-
### Problem Description
Right now, Chow rings of matroids are implemented using a generic quotient ring construction. However, we know an explicit Gröbner basis for a certain class of term orders. …
-
```
sage: R. = QQ[]
sage: I = R.ideal([a^2-a, b^2-b, a+b])
sage: GB1 = I.groebner_basis(algorithm='libsingular:slimgb')
sage: GB2 = I.groebner_basis(…
-
This is a tad overwhelming:
```m2
i1 : about "bner"
o1 =
{31 => Macaulay2Doc::computing Groebner bases }
{32 => Macaulay2Doc::Elementary uses of Gro…
-
This Google Summer of Code project aims to build a custom class in SageMath for the Chow rings of matroids by using a result which explicitly computes a Gröbner basis for the same. This implementation…
-
This is the main bottleneck in the the Gröbner basis code implemented in #34138. Sage's implementation is very inefficient (at least over `QQ`) as it creates a dense copy (when sparse, which the imp…