Implementing Gröbner bases for operads

zbMATH Open1277.68301arXiv0909.4950MaRDI QIDQ2865982FDOQ2865982

Authors: Vladimir Dotsenko, Mikael Vejdemo Johansson 

Publication date: 12 December 2013

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 work available at URL: https://arxiv.org/abs/0909.4950

Recommendations

• Operadic Gröbner Bases: An Implementation
• Algebraic operads. An algorithmic companion
• Gröbner bases for operads
• Linear algebraic approach to Gröbner-Shirshov basis theory
• Freeness theorems for operads via Gröbner bases

zbMATH Keywords

Buchberger algorithmHaskellshuffle operadsGröbner bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Functional programming and lambda calculus (68N18)

Cited In (9)

• Generalized cohomological field theories in the higher order formalism
• Operadic Gröbner Bases: An Implementation
• Gröbner bases for coloured operads
• operads
• Gröbner bases for operads
• The non-symmetric operad pre-Lie is free
• Normal forms for operators via Gröbner bases in tensor algebras
• Cacti and filtered distributive laws
• Freeness theorems for operads via Gröbner bases

Uses Software

• Haskell

This page was built for publication: Implementing Gröbner bases for operads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865982)