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.

翻译：本文介绍Groebner.jl——一个基于Julia语言、采用F4算法计算Gröbner基的软件包。Groebner.jl具备高效性、可移植性及开源特性，支持整数模素数域与有理数域上的运算，提供基础多线程支持，并专精于度反字典序单项序下的计算。该实现融合了多种符号计算技术，深度利用Julia类型系统与工具链，使Groebner.jl在诸多场景中可与现有最优方案抗衡，且在可扩展性方面超越同类工具。Groebner.jl可通过https://github.com/sumiya11/Groebner.jl 自由获取。