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
82 Algebraic Operads: An Algorithmic Companion
one allows one to work with divisibility algorithmically. We will now explain
how the same is done for nonsymmetric operads. First of all, the notion of a
subword of a word becomes, in the case of operations, the notion of a subtree
of a given tree.
Definition 3.4.2.1 (Subtree of a planar rooted tree). Let τ be a rooted
tree. Suppose that V
0
Int(τ) is a nonempty subset satisfying the following
properties:
there exists just one vertex v
0
V
0
for which Parent
τ
(v
0
) is not in V
0
,
for each vertex v
00
V
0
there is a (unique) nonnegative integer l and
vertices v
0
= v
0
, v
1
, . . . , v
l
= v
00
, such that v
i
= Paren
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