Subtotal ordering -- a pedagogically advantageous algorithm for computing total degree reverse lexicographic order
David R. Stoutemyer

TL;DR
This paper introduces a pedagogically simpler algorithm for total degree reverse lexicographic order using exponent subtotals, which is nearly as fast as traditional methods and often slightly faster in practice, aiding understanding and implementation.
Contribution
It presents a new, easier-to-understand algorithm for total degree reverse lexicographic order that maintains competitive speed and improves pedagogical clarity.
Findings
Subtotal order is often slightly faster in Mathematica implementations.
The new algorithm is easier to understand than traditional methods.
Exponent subtotals help clarify why this order is effective for Groebner basis computations.
Abstract
Total degree reverse lexicographic order is currently generally regarded as most often fastest for computing Groebner bases. This article describes an alternate less mysterious algorithm for computing this order using exponent subtotals and describes why it should be very nearly the same speed the traditional algorithm, all other things being equal. However, experimental evidence suggests that subtotal order is actually slightly faster for the Mathematica Groebner basis implementation more often than not. This is probably because the weight vectors associated with the natural subtotal weight matrix and with the usual total degree reverse lexicographic weight matrix are different, and Mathematica also uses those the corresponding weight vectors to help select successive S polynomials and divisor polynomials: Those selection heuristics appear to work slightly better more often with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics, Computing, and Information Processing · Polynomial and algebraic computation · Numerical Methods and Algorithms
