Gröbner basis project
Codebase for research into Gröbner basis computation
|
These are the highest priority items: things I think are needed before I’d call it “ready.”
auto
, noexcept
, override
, …).long long
!!!)These items would be nice, but aren’t a big deal for me at present.
Ring
class.Polynomial
representation.Euclidean_Ring
class. Add to it the divide_by_common_term() function.Field
class.Field
.Polynomial
representation.Dictionary_Linked_Polynomial
class, where any term points to one unique instance of a monomial, rather than having many copies of monomials in different polynomials. Upside is that equality test during canonicalization is instantaneous (compare pointers). Downsides may include finding/sorting the monomials, indirection.Polynomial_Builder
class to help build polynomials more easily by reading from an input file. That way we don’t have to write a fresh control program for each example system. (see user_interface())Polynomial_Builder
class to help build polynomials more easily.I’m not sure these are worth doing.
constraint
class to help avoid redundnacy.insert()
function to Monomial_Node to insert another Polynomial_Linked_List, subsequently to be destroyed.