Module sparse_polynomial 

Efficient Sparse Polynomial Representation for Gröbner Basis

This module provides an optimized polynomial representation using:

• HashMap<Monomial, Coefficient> for O(1) term lookup
• Efficient monomial ordering for Gröbner basis computation
• Optimized arithmetic operations (O(n) addition, O(n²) multiplication)

This achieves SymPy-level performance by avoiding Expression tree explosion.

Structs

Monomial

Monomial represented as exponent vector

SparsePolynomial

Sparse polynomial: HashMap<Monomial, Coefficient>

Functions

expression_to_sparse_polynomial

Convert Expression to SparsePolynomial

sparse_polynomial_to_expression

Convert SparsePolynomial back to Expression