SparsePolynomial

Adds another polynomial in the same ring. Like monomials are combined exactly and zero coefficients are removed from the returned polynomial.

Returns the coefficient of one monomial.

Returns the coefficient polynomial at one exact power of a selected variable. The selected variable remains in the ring with exponent zero so recursive algorithms can preserve the original coordinate layout.

Compares exponent vectors using the three global monomial orders required by the polynomial algorithms.

Creates a constant polynomial in a ring with variableCount variables.

Returns the constant coefficient, or zero when the constant monomial is absent.

Creates a sparse polynomial in a ring with a fixed number of variables. Duplicate monomials are combined and zero coefficients are removed.

Returns the positive greatest common divisor of all coefficients. The zero polynomial has coefficient content zero.

Returns the degree in one variable. The zero polynomial has no degree and returns null.

Differentiates with respect to one ring variable. Coefficients and exponents stay in bigint arithmetic, including exponents above JavaScript's safe-integer range.

Divides every term by one monomial when the quotient stays in the integer polynomial ring. Returns null when any coefficient or exponent is not exactly divisible.

Divides all coefficients by an integer scalar.

Divides by one polynomial using exact integer coefficient arithmetic. Returns null as soon as the current leading term is not exactly divisible by the divisor leading term. A successful result therefore has zero remainder in the selected monomial order.

Returns whether both polynomials have the same ring and exact nonzero terms.

Substitutes one variable with an exact integer while retaining the same ring. Terms that become like terms after substitution are combined in the result.

Substitutes several variables with exact integers in one sparse traversal. The selected coordinates remain in the polynomial ring with exponent zero.

Returns whether the polynomial is zero or contains only a constant term.

Returns whether the polynomial has no nonzero terms.

Returns the coefficient polynomial of the highest power of one variable. The selected coordinate remains present with exponent zero.

Returns the leading term under the requested monomial order. Variable priority follows exponent-vector index order.

Applies an exact bigint transformation to every stored coefficient while preserving the existing monomial keys and exponent vectors.

Returns the largest absolute coefficient, or zero for the zero polynomial.

Creates a one-term polynomial.

Computes the difference of two monomial-scaled polynomials in one sparse traversal. This avoids constructing the monomial factors and multiplication results used by fraction-free S-polynomials.

Multiplies by another polynomial in the same ring. Monomial exponents are added as bigints. The constructor combines products that land on the same monomial and removes coefficients that cancel to zero.

Returns the additive inverse of this polynomial.

Makes the leading coefficient positive without changing coefficient content.

Raises the polynomial to a non-negative exact integer power.

Divides by positive coefficient content while preserving the polynomial sign.

Multiplies every coefficient by an exact integer scalar.

Computes a scaled subtraction where the right polynomial is also multiplied by one monomial. This avoids constructing the two scaled intermediate polynomials used by fraction-free reduction.

Subtracts another polynomial in the same ring.

Number of stored nonzero terms.

Returns a copy of the stored terms. The exponent arrays themselves are frozen so callers cannot alter polynomial storage.

Returns the largest total degree among the stored monomials. The zero polynomial has no total degree and returns null.

Creates the variable at variableIndex with coefficient one.

No description is available yet.

Returns the variable indices that occur with a positive exponent.

Creates the zero polynomial in a ring with variableCount variables.