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 .

翻译：本文介绍用于通过F4算法计算Gröbner基的Julia语言软件包Groebner.jl。作为一款高效、轻量级、可移植且经过全面测试与文档记录的开源工具，该软件包支持模素数整数域与有理数域上的计算，并兼容多种单项式序。其实现融合了现代符号计算技术，并充分发挥Julia语言类型系统与工具链的优势，使Groebner.jl在性能上可与主流计算机代数系统比肩。本软件包可通过https://github.com/sumiya11/Groebner.jl 自由获取。