Function
src/algebra/algorithms/groebnerBase.ts:821Groebner
Groebner(polys: MultiPoly[], vars: string[], order: MonomialOrder, reduced: boolean): MultiPoly[]Computes a Groebner basis for an exact integer-coefficient ideal.
remarks
Variable indices in every MultiPoly must agree with
`vars`. The Buchberger engine uses fraction-free reduction. With
`reduced: true`, it interreduces, removes coefficient content, normalizes leading signs, and makes a polynomial monic only when exact integer division permits it. The returned basis is sorted deterministically, and the routine works from normalized copies rather than editing the supplied generators.
Parameters
| Name | Type | Description |
|---|---|---|
polys | MultiPoly[] | Ideal generators over integer coefficients. |
vars | string[] | Variable names aligned with exponent indices. |
order | MonomialOrder | Monomial order; defaults to `LEX`. |
reduced | boolean | Return the normalized/interreduced basis; defaults to `true`. |
Returns
MultiPoly[] — New basis polynomials in deterministic presentation order.