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
Symmetric Operads and Shuffle Operads 161
Lemma 5.4.1.5. A tree monomial T = (τ, x, n) is uniquely determined by its
path-permutation data.
Proof. Let us rearrange the words in Path(T ) according to the permuta-
tion σ(T )
1
; this would list the paths from the root to the leaves according
to the total planar order of leaves. By Lemma 3.4.1.4 we can uniquely recon-
struct a nonsymmetric tree monomial out of that path sequence. It remains to
use σ(T ) to number the leaves of that tree monomial, obtaining the original
shuffle tree monomial.
Definition 5.4.1.6 (Path-permutation extension). Suppose that Ξ is a mono-
mial order on X
.
The path-permutation extension ...
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