BasisRof WQSym Bidendriform biaglebra BasisP Annex
Basis of totally primitive elements of WQSym
Hugo Mlodecki Advisors:
Florent Hivert Viviane Pons
December 2019
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Packed words
Definition
A word over the alphabet N >0 is packed if all the letters from 1 to its maximum m appears at least once.
Example
4152142 ∈ / PW but pack(4152142) = 3142132 ∈ PW One representation : #rows ≤ #columns
•
• •
•
•
2 3 1 4 3
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Packed words
Definition
A word over the alphabet N >0 is packed if all the letters from 1 to its maximum m appears at least once.
Example 4152142 ∈ / PW
but pack(4152142) = 3142132 ∈ PW One representation : #rows ≤ #columns
•
• •
•
•
2 3 1 4 3
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Packed words
Definition
A word over the alphabet N >0 is packed if all the letters from 1 to its maximum m appears at least once.
Example
4152142 ∈ / PW but pack(4152142) = 3142132 ∈ PW
One representation : #rows ≤ #columns
•
• •
•
•
2 3 1 4 3
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Packed words
Definition
A word over the alphabet N >0 is packed if all the letters from 1 to its maximum m appears at least once.
Example
4152142 ∈ / PW but pack(4152142) = 3142132 ∈ PW One representation : #rows ≤ #columns
•
• •
•
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Hopf algebra
unitary associative product ·
counitary coassociative coproduct ∆ Hopf relation ∆(a · b) = ∆(a) · ∆(b)
Example WQSym
R w with w ∈ PW
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
∆( R 24231 ) = 1 ⊗ R 24231 + R 121 ⊗ R 21 + R 1312 ⊗ R 1 + R 24231 ⊗ 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Hopf algebra
unitary associative product ·
counitary coassociative coproduct ∆ Hopf relation ∆(a · b) = ∆(a) · ∆(b) Example
WQSym
R w with w ∈ PW
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
∆( R 24231 ) = 1 ⊗ R 24231 + R 121 ⊗ R 21 + R 1312 ⊗ R 1 + R 24231 ⊗ 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Shuffle product on packed words
•
• 1 2
• • 1 1
= R
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
• •
•
•
1 2 3 3
• •
•
•
3 1 2 3 +
+
• •
•
•
1 3 2 3
• •
•
•
3 1 3 2 +
+
• •
•
•
1 3 3 2
• •
•
•
3 3 1 2
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Shuffle product on packed words
•
• 1 2
• •
1 1 =
R
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
• •
•
•
1 2 3 3
• •
•
•
+
+
• •
•
•
1 3 2 3
• •
•
•
+
+
• •
•
•
1 3 3 2
• •
•
•
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Shuffle product on packed words
•
• 1 2
• •
1 1 = R
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
• •
•
•
1 2 3 3
• •
•
•
+
+
• •
•
•
1 3 2 3
• •
•
•
+
+
• •
•
•
1 3 3 2
• •
•
•
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Shuffle product on packed words
•
• 1 2
• •
1 1
= R
R σ R µ := P
ν∈σ µ
R ν
• •
•
•
1 2 3 3
• •
•
•
+
+
• •
•
•
1 3 2 3
• •
•
•
+
+
• •
•
•
1 3 3 2
• •
•
•
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
•
•
• •
• 2 4 2 3 1
∆
→
•
•
• •
• 2 3 2 4 1
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
•
•
• •
• 2 4 2 3 1
∆
→
•
•
• •
• 2 3 2 4 1
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
•
•
• •
• 2 4 2 3 1
∆
→
•
•
• •
• 2 3 2 4 1
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
•
•
• •
• 2 4 2 3 1
∆
→
•
•
• •
• 2 3 2 4 1
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
•
•
• •
• 2 4 2 3 1
∆
→
•
•
• •
• 2 3 2 4 1
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
•
•
• •
• 2 4 2 3 1
∆
→
•
•
• •
• 2 3 2 4 1
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
R 24231
∆
→
•
•
• •
• 2 3 2 4 1
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
R 24231 ∆ →
R ⊗ R 24231
•
•
• •
• 2 4 2 3 1
+
+
•
•
• •
• 2 4 2 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
R 24231 ∆ →
R ⊗ R 24231
•
•
• •
• 2 4 2 3 1
+
+
•
• •
2 4 2
•
• 3 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
R 24231 ∆ →
R ⊗ R 24231
•
•
• •
• 2 4 2 3 1
+
+
•
• •
1 2 1
•
• 2 1
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
R 24231 ∆ →
R ⊗ R 24231
•
•
• •
• 2 4 2 3 1
+
+
R 121 ⊗ R 21
•
•
• •
•
2 4 2 3 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Packed words Product Coproduct
Deconcatenation
R 24231 ∆ →
R ⊗ R 24231
R 1312 ⊗ R 1
+
+
R 121 ⊗ R 21
R 24231 ⊗ R
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Half products
Recursive definition of Shuffle product
w = w = w
ua vb = (u vb)a + (ua v)b
= ua ≺ vb + ua vb Example of left and right products
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
R 12 ≺ R 11 = R 1332 + R 3132 + R 3312
R 12 R 11 = R 1233 + R 1323 + R 3123
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Half products
Recursive definition of Shuffle product
w = w = w
ua vb = (u vb)a + (ua v)b = ua ≺ vb + ua vb
Example of left and right products
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
R 12 ≺ R 11 = R 1332 + R 3132 + R 3312
R 12 R 11 = R 1233 + R 1323 + R 3123
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Half products
Recursive definition of Shuffle product
w = w = w
ua vb = (u vb)a + (ua v)b = ua ≺ vb + ua vb Example of left and right products
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
R 12 ≺ R 11 = R 1332 + R 3132 + R 3312
R 12 R 11 = R 1233 + R 1323 + R 3123
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Half products
Recursive definition of Shuffle product
w = w = w
ua vb = (u vb)a + (ua v)b = ua ≺ vb + ua vb Example of left and right products
R 12 R 11 = R 1233 + R 1323 + R 1332 + R 3123 + R 3132 + R 3312
R 12 ≺ R 11 = R 1332 + R 3132 + R 3312
R 12 R 11 = R 1233 + R 1323 + R 3123
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Half coproducts
Definitions
∆ ≺ ( R u ) : = P n−1
i=k
{u1,...,ui}∩{ui+1,...,un}=∅
u
k=max(u)
R pack(u
1···u
i) ⊗ R pack(u
i+1···u
n) ,
∆ ( R u ) : = P k−1
i=1
{u1,...,ui}∩{ui+1,...,un}=∅
u
k=max(u)
R pack(u
1···u
i) ⊗ R pack(u
i+1···u
n)
Example of left and right coproducts
∆( ˜ R 2425531 ) = R 121 ⊗ R 3321 + R 12133 ⊗ R 21 + R 131442 ⊗ R 1
∆ ≺ (R 2425531 ) = R 12133 ⊗ R 21 + R 131442 ⊗ R 1
∆ ( R 2425531 ) = R 121 ⊗ R 3321
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Half coproducts
Definitions
∆ ≺ ( R u ) : = P n−1
i=k
{u1,...,ui}∩{ui+1,...,un}=∅
u
k=max(u)
R pack(u
1···u
i) ⊗ R pack(u
i+1···u
n) ,
∆ ( R u ) : = P k−1
i=1
{u1,...,ui}∩{ui+1,...,un}=∅
u
k=max(u)
R pack(u
1···u
i) ⊗ R pack(u
i+1···u
n)
Example of left and right coproducts
∆( ˜ R 2425531 ) = R 121 ⊗ R 3321 + R 12133 ⊗ R 21 + R 131442 ⊗ R 1
∆ ≺ (R 2425531 ) = R 12133 ⊗ R 21 + R 131442 ⊗ R 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Half coproducts
Definitions
∆ ≺ ( R u ) : = P n−1
i=k
{u1,...,ui}∩{ui+1,...,un}=∅
u
k=max(u)
R pack(u
1···u
i) ⊗ R pack(u
i+1···u
n) ,
∆ ( R u ) : = P k−1
i=1
{u1,...,ui}∩{ui+1,...,un}=∅
u
k=max(u)
R pack(u
1···u
i) ⊗ R pack(u
i+1···u
n)
Example of left and right coproducts
∆( ˜ R 2425531 ) = R 121 ⊗ R 3321 + R 12133 ⊗ R 21 + R 131442 ⊗ R 1
∆ ≺ (R 2425531 ) = R 12133 ⊗ R 21 + R 131442 ⊗ R 1
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Goal
Automorphism,
Subspace that generate the algebra with (half) products.
Answer
Totally primitive elements
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Goal
Automorphism,
Subspace that generate the algebra with (half) products.
Answer
Totally primitive elements
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Definitions
Primitive elements
P is a primitive element ⇐⇒ ∆(P ˜ ) = 0 Ex : R 1213 − R 2321
Totally primitive Element
P is a totally primitive element ⇐⇒ ∆ ≺ (P ) = ∆ (P ) = 0
Ex : R 12443 − R 21443 − R 23441 + R 32441
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Definitions
Primitive elements
P is a primitive element ⇐⇒ ∆(P ˜ ) = 0 Ex : R 1213 − R 2321
Totally primitive Element
P is a totally primitive element ⇐⇒ ∆ ≺ (P ) = ∆ (P ) = 0
Ex : R 12443 − R 21443 − R 23441 + R 32441
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Notations
Let A be a bidendriforme bialgebra
Prim(A) = Ker( ˜ ∆),
TPrim(A) = Ker(∆ ≺ ) ∩ Ker(∆ ), A(z) =
+ inf
X
n=1
dim(A n )z n ,
P(z) =
+ inf
X
n=1
dim(Prim(A n ))z n ,
+ inf
BasisRof WQSym Bidendriform biaglebra BasisP Annex Half products and coproducts Primitive elements
Theorems
Bidendriforme version of Carier Milnor-Moore [Foissy]
Let A a bidendriforme bialgebra. Then A is freely generated as a dendriform algebra by TPrim(A). Moreover :
P(z) = A(z)
A(z) + 1 , T (z) = A(z) (A(z ) + 1) 2 . or equivalently
A(z) = P (z )
1 − P(z) , P (z ) = T (z )(1 + A(z )).
n 1 2 3 4 5 6 7 OEIS
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
Decorated forests
An exemple of decorated biplan forest:
2, 5
1 1, 3 1, 2 2
1 1, 2
1 1
On board: 8767595394312.
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
Decorated forests
An exemple of decorated biplan forest:
2, 5
1 1, 3 1, 2 2
1 1, 2
1
1
On board: 8767595394312.
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
Algorithm on 8767595394312
global descente factorization
remove maximums
global descente factorization left and right groups
positions of maximums recursively
87675953943 12
87675 · 53 · 4 8 767 5 · 5 3 · 4 8 767 | 5 · 5 3 · 4
· · · · | 123 456
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
Algorithm on 8767595394312
global descente factorization remove maximums
global descente factorization left and right groups
positions of maximums recursively
87675953943 12 87675 · 53 · 4
8 767 5 · 5 3 · 4 8 767 | 5 · 5 3 · 4
· · · · | 123 456
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
Algorithm on 8767595394312
global descente factorization remove maximums
global descente factorization
left and right groups positions of maximums recursively
87675953943 12 87675 · 53 · 4 8 767 5 · 5 3 · 4
8 767 | 5 · 5 3 · 4
· · · · | 123 456
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
Algorithm on 8767595394312
global descente factorization remove maximums
global descente factorization left and right groups
positions of maximums recursively
87675953943 12 87675 · 53 · 4 8 767 5 · 5 3 · 4 8 767 | 5 · 5 3 · 4
· · · · | 123 456
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
Algorithm on 8767595394312
global descente factorization remove maximums
global descente factorization left and right groups
positions of maximums recursively
87675953943 12 87675 · 53 · 4 8 767 5 · 5 3 · 4 8 767 | 5 · 5 3 · 4
· · · · | 123 456
BasisRof WQSym Bidendriform biaglebra BasisP Annex Decorated forests A new basisP
New basis P
P := R 1 ,
P t
1,...,t
k:= (...( P t
k≺ ...) ≺ P t
2) ≺ P t
1, P
Ir1 . . . rd
:= Φ I (P r
1,...,r
d),
P
I`1 . . . `g r1 . . . rd
:= h P l
1, P l
2, ..., P l
k; Φ I ( P r
1,...,r
d)i.
Theorem
BasisRof WQSym Bidendriform biaglebra BasisP Annex
Th´ eor` emes
Corolaire du Th´ eor` eme Carier Milnor-Moore version dendriforme Soit A une alg` ebre de Hopf bidendriforme. Prim(A) est g´ en´ er´ e librement par TPrim(A) en tant que alg` ebre de brace avec l’op´ eration n-multilin´ eaire suivante :
hp 1 , ..., p n−1 ; p n i =
n−1
X
i =0
(−1) n−1−i
(p 1 ≺ (p 2 ≺ (... ≺ p i )...) p n ≺ (...(p i+1 p i+2 ) ...) p n−1 ).
BasisRof WQSym Bidendriform biaglebra BasisP Annex
Les premiers arbres
.
; ;
1,2.
;
2
; ;
; ; ;
1,2
;
1,3
;
1,2;
1,2;
2
1
12; 21; 11
123; 132; 213;
231; 312; 321;
122; 212; 221; 112;
121; 211; 111.
BasisRof WQSym Bidendriform biaglebra BasisP Annex
Les premiers arbres
.
; ;
1,2.
;
2
; ;
; ; ;
1,2
;
1,3
;
1,2;
1,2;
2
1
12; 21; 11
123; 132; 213;
231; 312; 321;
122; 212; 221; 112;
BasisRof WQSym Bidendriform biaglebra BasisP Annex
;
3
;
2
;
3 2
;
2
;
2 2
; ;
3
; ; ;
2
;
2
; ;
2
; ; ; ;
; ;
2
; ; ; ;
;
BasisRof WQSym Bidendriform biaglebra BasisP Annex
1,2
;
2,4
;
2,3
;
1,2
;
1,3
;
1,2
;
1,4
;
1,3
;
1,4
;
1,3
;
1,2;
1,2;
1,2
;
3 1,2
;
2 1,2
;
1,3
;
3 1,3
;
1,2;
1,2
;
2 1,3
;
2
1,2
;
1,2
;
1,3
;
1,2;
BasisRof WQSym Bidendriform biaglebra BasisP Annex
1,2,3
;
1,3,4
;
1,2,4
;
1,2,3
;
1,2;
3
1,2
;
2
1,2
;
3 2
1,2
;
2
1,2
;
2 2
1,2
;
1,2;
2 1,2
;
1,2;
1,2;
2 1,2
;
1,2;
1,2
1,2
;
2,4
1,2
;
2,3
1,2
;
1,4
1,2
;
1,3
1,2
;
1,2 1,2;
1,2,3;
3 2