Learning Fast Monomial Orders for Gr"obner Basis Computations
cs.SC, cs.LG, math.AC, math.AG
Submitted: 2026-02-03
Updated: 2026-08-28
Comments: added more experiments against baselines, corrected a few typos and cosmetics
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Interpretable Machine Learning for Science with PySR and SymbolicRegression.jl
- Parameter regions that give rise to 2[n/2]+1 positive steady states in the n-site phosphorylation system
- Gaussian Error Linear Units (GELUs)
- Predicting the cardinality and maximum degree of a reduced Gr\"obner basis
- Geometric Generality of Transformer-Based Gr\"obner Basis Computation
- Prioritized Experience Replay
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
Related papers
- Automatic Certified Differentiation in Lean
- GPU-Accelerated Search for Fast Matrix Multiplication over F 2
- One Loss Resolves Signed Rank-One Gradient Fibers: Exact Decoding on Cycle and Theta Blocks
- Deterministic Root-Finding over Finite Fields with Elliptic Curves
- An algorithmic construction of Nullstellensatz certificates for graph automorphism groups
- The Indefinite Summation Problem for the Laurent Ring