Skip to Main Content
Algebraic Operads
book

Algebraic Operads

by Murray R. Bremner, Vladimir Dotsenko
April 2016
Intermediate to advanced content levelIntermediate to advanced
383 pages
11h 46m
English
Chapman and Hall/CRC
Content preview from Algebraic Operads
212 Algebraic Operads: An Algorithmic Companion
6.4.2 Resolution for monomial relations
Assume that the shuffle operad O = T
X
(X)/(G) is generated by an oper-
ation alphabet X, and that G consists of shuffle tree monomials. We will now
explain how to construct a model of O which is often minimal.
Our first step is to construct a quasi-free shuffle operad A
X
which does
not take into account the relations of O; it is a somewhat universal object for
operads generated by X, various suboperads of A
X
will be used as resolutions
for various choices of G.
Definition 6.4.2.1 (The inclusion–exclusion operad). Let T be a tree mono-
mial, and let Λ(s
1
, . . . , s
q
) be the
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Reinventing the Organization for GenAI and LLMs

Reinventing the Organization for GenAI and LLMs

Ethan Mollick
Algebraic and Stochastic Coding Theory

Algebraic and Stochastic Coding Theory

Dave K. Kythe, Prem K. Kythe

Publisher Resources

ISBN: 9781482248579