Implementing Gröbner bases for operads

MaRDI QIDQ2865982zbMATHFDO

Authors Vladimir Dotsenko, Mikael Vejdemo Johansson

Publication date 12 December 2013

Full work available at URL https://arxiv.org/abs/0909.4950

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)

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.

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

Cited in

(9)

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

Describes a project that uses

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)