Papers › The GroebnerWalk.jl package for OSCAR
The GroebnerWalk.jl package for OSCAR
Kamillo Ferry, Francesco Nowell
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Computing Gr\"obner bases is known to have a very high upper bound on computation time with respect to input length. Due to the connection between polyhedral geometry and Gr\"obner bases through the Gr\"obner fan, one can attempt an incremental approach to compute Gr\"obner bases. First computing a Gr\"obner basis with respect to an `easy' term order and transforming that result to a Gr\"obner basis with respect to the desired term order by using information about this polyhedral fan is done by a family of algorithms termed as Gr\"obner walk. We implemented two variants of the Gr\"obner walk in the computer algebra system OSCAR and compared their performance with classical Gr\"obner basis methods already found in OSCAR.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections