The reviewed record of science sign in
Pith

arxiv: 2304.06935 · v3 · pith:24D4APUN · submitted 2023-04-14 · cs.MS · cs.SC· math.AC

Groebner.jl: A package for Gr\"obner bases computations in Julia

Alexander Demin , Shashi Gowda This is my paper

Reviewed by Pithpith:24D4APUNopen to challenge →

classification cs.MS cs.SCmath.AC
keywords groebnerjuliabasescomputationpackagealgorithmallowsavailable
0
0 comments X
read the original abstract

We present Groebner.jl, a Julia package for computing Groebner bases with the F4 algorithm. Groebner.jl is an efficient, portable, and open-source software. Groebner.jl works over integers modulo a prime and over the rationals, supports basic multi-threading, and specializes in computation in the degree reverse lexicographical monomial ordering. The implementation incorporates various symbolic computation techniques and leverages the Julia type system and tooling, which allows Groebner.jl to compete with the existing state of the art, in many instances outperform it, and exceed them in extensibility. Groebner.jl is freely available at https://github.com/sumiya11/Groebner.jl.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Groebner.jl: Fast Gr\"obner Tracing in Julia

    cs.SC 2026-07 accept novelty 5.0

    Groebner.jl implements F4 with public Traverso tracing and SIMD-friendly product-ring arithmetic in Julia, achieving 1.5–6.6x speedups in multi-modular Gröbner basis workflows.

  2. Fast Rational Univariate Representation via Gaussian Elimination

    cs.SC 2026-07 conditional novelty 4.0

    A Julia package using dense Gaussian elimination computes certified rational univariate representations of polynomial systems with thousands of solutions in seconds, outperforming msolve on several benchmarks.