Function
src/algebra/algorithms/groebnerBase.ts:829Groebner
Groebner(polys: readonly SparsePolynomial[], order: MonomialOrder, reduced: boolean): SparsePolynomial[]Computes a Groebner basis for exact sparse integer polynomials.
The input polynomials must belong to the same ring. With reduced: true, the
basis is interreduced, coefficient content is removed, leading signs are normalized,
and exact monic normalization is applied when possible. Results are sorted
deterministically and the supplied polynomials are not modified.
Parameters
| Name | Type | Description |
|---|---|---|
polys | readonly SparsePolynomial[] | Ideal generators in one sparse polynomial ring. |
order | MonomialOrder | Monomial order; defaults to LEX. |
reduced | boolean | Return the normalized/interreduced basis; defaults to true. |
Returns
SparsePolynomial[] — New sparse basis polynomials in deterministic presentation order.