# Implementing Gr\"obner bases for operads

**Authors:** Vladimir Dotsenko, Mikael Vejdemo-Johansson

arXiv: 0909.4950 · 2010-08-27

## TL;DR

This paper details an implementation of algorithms for computing Groebner bases specifically for operads, including discussions on algorithms, platform choices, data representation, and evaluation of the approach.

## Contribution

It provides a practical implementation of Groebner bases algorithms for operads, highlighting implementation details and analysis of strengths and weaknesses.

## Key findings

- Implementation successfully computes Groebner bases for operads.
- Discussion of algorithm choices and data representations.
- Evaluation of the approach's strengths and weaknesses.

## Abstract

We present an implementation of the algorithm for computing Groebner bases for operads due to the first author and A. Khoroshkin. We discuss the actual algorithms, the choices made for the implementation platform and the data representation, and strengths and weaknesses of our approach.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/0909.4950/full.md

## Figures

6 figures with captions in the complete paper: https://tomesphere.com/paper/0909.4950/full.md

## References

8 references — full list in the complete paper: https://tomesphere.com/paper/0909.4950/full.md

---
Source: https://tomesphere.com/paper/0909.4950