Operadic Gröbner bases: An implementation

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In an upcoming paper [1], the first author and Anton Khoroshkin define the concept of a Gröbner basis for finitely presented operads, prove the diamond lemma for these Gröbner bases, and demonstrate that having a quadratic Gröbner basis is equivalent to the existence of a Poincaré-Birkhoff-Witt basis. As demonstrated by Eric Hoffbeck [2], an operad with a PBW basis is Koszul. Thus, out of this emerges an entirely computational framework for proving Koszulness, as well as the possibility to build tools for exploration of operads by means of explicit calculation. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Dotsenko, V., & Vejdemo-Johansson, M. (2010). Operadic Gröbner bases: An implementation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 249–252). https://doi.org/10.1007/978-3-642-15582-6_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free