A Buchberger like algorithm without monomial orderings: the graded commutative case
(English)Manuscript (preprint) (Other academic)
We analyze an algorithm to compute vector space bases for graded commutative algebras. The algorithm does not require a monomial ordering, but we show that when we use a monomial ordering, there is a strong connection to the Buchberger algorithm.
Research subject Mathematics
IdentifiersURN: urn:nbn:se:su:diva-31519OAI: oai:DiVA.org:su-31519DiVA: diva2:277497