groebner
| Crates.io | groebner |
| lib.rs | groebner |
| version | 0.1.1 |
| created_at | 2025-06-23 11:12:57.286836+00 |
| updated_at | 2025-06-25 09:51:29.584151+00 |
| description | A Rust library implementing Groebner basis algorithms |
| homepage | https://github.com/sdiehl/groebner |
| repository | https://github.com/sdiehl/groebner |
| max_upload_size | |
| id | 1722802 |
| size | 84,178 |
Stephen Diehl (sdiehl)
documentation
https://docs.rs/groebner
README
Groebner Basis
This is an implementation of the F4 and Buchberger algorithm for computing Groebner bases in Rust.
See examples/basic.rs for a usage example.
Usage
To use in your project:
cargo add groebner
Test Suite
To run the example, use:
cargo run --example basic
cargo test
The test suite is the full list of known Groebner bases for a variety of large multivariate polynomial systems.
References
- Cox, D., Little, J., O'Shea, D. "Ideals, Varieties, and Algorithms"
- Buchberger, B. "Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory"
- Giovini, A., Mora, T., Niesi, G., Robbiano, L., & Traverso, C. (1991, June). “One sugar cube, please” or selection strategies in the Buchberger algorithm. In Proceedings of the 1991 international symposium on Symbolic and algebraic computation (pp. 49-54).
- Gebauer, R., & Möller, H. M. (1988). On an installation of Buchberger's algorithm. Journal of Symbolic computation, 6(2-3), 275-286.
- Roune, B. H., & Stillman, M. (2012, July). Practical Gröbner basis computation. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (pp. 203-210).
License
Released under the MIT License. See LICENSE for details.