We introduce the Julia package Groebner.jl for computing Gr\"obner bases with the F4 algorithm. Groebner.jl is an efficient, lightweight, portable, thoroughly tested, and documented open-source software. The package works over integers modulo a prime and over the rationals and supports various monomial orderings. The implementation incorporates modern symbolic computation techniques and leverages the Julia type system and tooling, which allows Groebner.jl to be on par in performance with the leading computer algebra systems. Our package is freely available at https://github.com/sumiya11/Groebner.jl .

翻译：我们介绍了Julia软件包Groebner.jl，该软件包基于F4算法计算Gröbner基。Groebner.jl是一款高效、轻量、可移植、经过全面测试并有文档记录的开源软件。该软件包支持模素数整数域和有理数域上的运算，并兼容多种单项式序。实现中融合了现代符号计算技术，并充分利用了Julia的类型系统和工具链，使得Groebner.jl在性能上与主流计算机代数系统相当。我们的软件包可免费获取，地址为https://github.com/sumiya11/Groebner.jl。