![Page 1: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/1.jpg)
Insertion algorithms for shifted domino tableaux
Zakaria Chemli, Mathias Petreolle
Seminaire Lotharingien de Combinatoire
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 1 / 15
![Page 2: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/2.jpg)
Plan
1 Shifted domino tableaux
2 Insertion algorithms
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 2 / 15
![Page 3: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/3.jpg)
Plan
1 Shifted domino tableaux
2 Insertion algorithms
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 3 / 15
![Page 4: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/4.jpg)
Introduction
Young tableaux: (Young)- Schur functions
- Plactic monoid (Lascoux, Schutzenberger)
1 2 4 63 5 8689
↓
Shifted Young tableaux: (Sagan, Worley)- P- and Q-Schur functions
- Shifted plactic monoid (Serrano)
1 2 4 6x 5′ 8′x x 8
→
→
Domino tableaux: (Young)- Product of two Schur functions
- Super plactic monoid (Carre, Leclerc)
1 1
3 4 4
23
2
65
7 9
↓
Shifted domino tableaux : (Chemli)- Product of two P- and Q-Schur function
- Super shifted plactic monoid
12′
x
3
87
x xx
4 53
9
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 4 / 15
![Page 5: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/5.jpg)
Young tableaux
A partition λ of n is a non-increasing sequence (λ1, λ2, . . . , λk) such thatλ1 + λ2 + · · ·+ λk = n. We represent a partition by its Ferrers diagram.
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 5 / 15
![Page 6: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/6.jpg)
Young tableaux
A partition λ of n is a non-increasing sequence (λ1, λ2, . . . , λk) such thatλ1 + λ2 + · · ·+ λk = n. We represent a partition by its Ferrers diagram.
Figure: The Ferrers diagram of λ=(5,4,3,3,1)
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 5 / 15
![Page 7: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/7.jpg)
Young tableaux
A partition λ of n is a non-increasing sequence (λ1, λ2, . . . , λk) such thatλ1 + λ2 + · · ·+ λk = n. We represent a partition by its Ferrers diagram.
95 7 94 5 52 3 4 61 1 3 4 7
Figure: A Young tableau of shape λ=(5,4,3,3,1)
A Young tableau is a filling of a Ferrers diagram with positive integers suchthat rows are non-decreasing and columns are strictly increasing.
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 5 / 15
![Page 8: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/8.jpg)
Domino tilling
Two adjacent boxes form a domino:
or
A diagram is tileable if we can tile it by non intersecting dominos.
tileable non tileable
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 6 / 15
![Page 9: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/9.jpg)
Domino tilling
Two adjacent boxes form a domino:
or
A diagram is tileable if we can tile it by non intersecting dominos.
tileable non tileable
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 6 / 15
![Page 10: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/10.jpg)
Domino tableaux
Given a tiled partition λ, a domino tableau is a filling of dominos withpositive integers such that columns are strictly increasing and rows are nondecreasing.
1 1 3 67
24 4
3
5
We do not allow tillings such that we can remove a domino strictly aboveD0 and obtain a domino tableau.A tilling is acceptable iff there is no vertical domino d on D0 such that theonly domino adjacent to d on the left is strictly above D0.
acceptable not acceptable
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 7 / 15
![Page 11: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/11.jpg)
Domino tableaux
Given a tiled partition λ, a domino tableau is a filling of dominos withpositive integers such that columns are strictly increasing and rows are nondecreasing.
1 1 3 67
24 4
3
5
D0D−1
D−2
D1
D2
Dk : y = x+ 2k
We do not allow tillings such that we can remove a domino strictly aboveD0 and obtain a domino tableau.A tilling is acceptable iff there is no vertical domino d on D0 such that theonly domino adjacent to d on the left is strictly above D0.
acceptable not acceptable
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 7 / 15
![Page 12: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/12.jpg)
Domino tableaux
Given a tiled partition λ, a domino tableau is a filling of dominos withpositive integers such that columns are strictly increasing and rows are nondecreasing.
1 1 3 67
24 4
3
5
D0D−1
D−2
D1
D2
Dk : y = x+ 2k
2 types of dominos:
left
right
We do not allow tillings such that we can remove a domino strictly aboveD0 and obtain a domino tableau.A tilling is acceptable iff there is no vertical domino d on D0 such that theonly domino adjacent to d on the left is strictly above D0.
acceptable not acceptable
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 7 / 15
![Page 13: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/13.jpg)
Domino tableaux
Given a tiled partition λ, a domino tableau is a filling of dominos withpositive integers such that columns are strictly increasing and rows are nondecreasing.
1 1 3 67
24 4
3
5
D0D−1
D−2
D1
D2
Dk : y = x+ 2k
2 types of dominos:
left
right
We do not allow tillings such that we can remove a domino strictly aboveD0 and obtain a domino tableau.
A tilling is acceptable iff there is no vertical domino d on D0 such that theonly domino adjacent to d on the left is strictly above D0.
acceptable not acceptable
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 7 / 15
![Page 14: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/14.jpg)
Domino tableaux
Given a tiled partition λ, a domino tableau is a filling of dominos withpositive integers such that columns are strictly increasing and rows are nondecreasing.
1 1 3 67
24 4
3
5
D0D−1
D−2
D1
D2
Dk : y = x+ 2k
2 types of dominos:
left
right
We do not allow tillings such that we can remove a domino strictly aboveD0 and obtain a domino tableau.A tilling is acceptable iff there is no vertical domino d on D0 such that theonly domino adjacent to d on the left is strictly above D0.
acceptable not acceptable
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 7 / 15
![Page 15: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/15.jpg)
Shifted domino tableaux
xxx
x
1 15’
54’22’2’ 2 3
Given an acceptable tilling, a shifted domino tableau is:
a filling of dominos strictly above D0 by x
a filling of other dominos with integers in {1′ < 1 < 2′ < 2 < · · · }columns and rows are non decreasing
an integer without ’ appears at most once in every column
an integer with ’ appears at most once in every row
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 8 / 15
![Page 16: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/16.jpg)
Shifted domino tableaux
xxx
x
1 15’
54’22’2’ 2 3
Given an acceptable tilling, a shifted domino tableau is:
a filling of dominos strictly above D0 by x
a filling of other dominos with integers in {1′ < 1 < 2′ < 2 < · · · }
columns and rows are non decreasing
an integer without ’ appears at most once in every column
an integer with ’ appears at most once in every row
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 8 / 15
![Page 17: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/17.jpg)
Shifted domino tableaux
xxx
x
1 15’
54’22’2’ 2 3
Given an acceptable tilling, a shifted domino tableau is:
a filling of dominos strictly above D0 by x
a filling of other dominos with integers in {1′ < 1 < 2′ < 2 < · · · }columns and rows are non decreasing
an integer without ’ appears at most once in every column
an integer with ’ appears at most once in every row
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 8 / 15
![Page 18: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/18.jpg)
Plan
1 Shifted domino tableaux
2 Insertion algorithms
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 9 / 15
![Page 19: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/19.jpg)
Insertion algorithm
We consider bicolored words of positive integers, namely elements of(N∗ × {L,R})∗, for exemple w= 123232
Theorem (Chemli, P. (2016))
There is a bijective algorithm f , with a bicolored word as input and a pair(P,Q) of shifted domino tableaux as output such that:
P and Q have same shape
P is without ’ on D0
Q is standard without ’
1 2′1 23
1 23 4
5x x
P Q
w = 13212
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 10 / 15
![Page 20: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/20.jpg)
Insertion algorithm
We consider bicolored words of positive integers, namely elements of(N∗ × {L,R})∗, for exemple w= 123232
Theorem (Chemli, P. (2016))
There is a bijective algorithm f , with a bicolored word as input and a pair(P,Q) of shifted domino tableaux as output such that:
P and Q have same shape
P is without ’ on D0
Q is standard without ’
1 2′1 23
1 23 4
5x x
P Q
w = 13212
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 10 / 15
![Page 21: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/21.jpg)
Insertion algorithm
We consider bicolored words of positive integers, namely elements of(N∗ × {L,R})∗, for exemple w= 123232
Theorem (Chemli, P. (2016))
There is a bijective algorithm f , with a bicolored word as input and a pair(P,Q) of shifted domino tableaux as output such that:
P and Q have same shape
P is without ’ on D0
Q is standard without ’
1 2′1 23
1 23 4
5x x
P Q
w = 13212
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 10 / 15
![Page 22: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/22.jpg)
Insertion algorithm
We consider bicolored words of positive integers, namely elements of(N∗ × {L,R})∗, for exemple w= 123232
Theorem (Chemli, P. (2016))
There is a bijective algorithm f , with a bicolored word as input and a pair(P,Q) of shifted domino tableaux as output such that:
P and Q have same shape
P is without ’ on D0
Q is standard without ’
1 2′1 23
1 23 4
5x x
P Q
w = 13212
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 10 / 15
![Page 23: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/23.jpg)
Algebraic consequences
Theorem (Chemli, P. (2016))
Let w1 be a word in N× {L} with P-tableau of shape µ , and w2 be aword in N× {R} with P-tableau of shape ν. Let λ be the shape of theP-tableau of the word w1w2. We have:∑
T , sh(T )=λ
xT = PµPν
, where Pµ is a P-Schur function.
Theorem (Chemli, P. (2016))
Two words belong to the same class of the super shifted plactic monoid iffthey have the same P-tableau.
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 11 / 15
![Page 24: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/24.jpg)
Algebraic consequences
Theorem (Chemli, P. (2016))
Let w1 be a word in N× {L} with P-tableau of shape µ , and w2 be aword in N× {R} with P-tableau of shape ν. Let λ be the shape of theP-tableau of the word w1w2. We have:∑
T , sh(T )=λ
xT = PµPν
, where Pµ is a P-Schur function.
Theorem (Chemli, P. (2016))
Two words belong to the same class of the super shifted plactic monoid iffthey have the same P-tableau.
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 11 / 15
![Page 25: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/25.jpg)
Inverse and dual algorithms
Theorem (Chemli, P. (2016))
The algorithm f is bijective, with an explicit inverse
Theorem (Chemli, P. (2016))
There is an algorithm g with a bicolored standard word as input and a pair(P,Q) of shifted domino tableaux as output such that :
P and Q have the same shape
P is standard without ’
Q is standard without ’ in D0
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 12 / 15
![Page 26: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/26.jpg)
Inverse and dual algorithms
Theorem (Chemli, P. (2016))
The algorithm f is bijective, with an explicit inverse
Theorem (Chemli, P. (2016))
There is an algorithm g with a bicolored standard word as input and a pair(P,Q) of shifted domino tableaux as output
such that :
P and Q have the same shape
P is standard without ’
Q is standard without ’ in D0
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 12 / 15
![Page 27: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/27.jpg)
Inverse and dual algorithms
Theorem (Chemli, P. (2016))
The algorithm f is bijective, with an explicit inverse
Theorem (Chemli, P. (2016))
There is an algorithm g with a bicolored standard word as input and a pair(P,Q) of shifted domino tableaux as output such that :
P and Q have the same shape
P is standard without ’
Q is standard without ’ in D0
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 12 / 15
![Page 28: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/28.jpg)
Inverse and dual algorithms
Theorem (Chemli, P. (2016))
The algorithm f is bijective, with an explicit inverse
Theorem (Chemli, P. (2016))
There is an algorithm g with a bicolored standard word as input and a pair(P,Q) of shifted domino tableaux as output such that :
P and Q have the same shape
P is standard without ’
Q is standard without ’ in D0
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 12 / 15
![Page 29: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/29.jpg)
Inverse and dual algorithms
Theorem (Chemli, P. (2016))
The algorithm f is bijective, with an explicit inverse
Theorem (Chemli, P. (2016))
There is an algorithm g with a bicolored standard word as input and a pair(P,Q) of shifted domino tableaux as output such that :
P and Q have the same shape
P is standard without ’
Q is standard without ’ in D0
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 12 / 15
![Page 30: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/30.jpg)
Conjectures
Conjecture 1
If σ is a signed permutation (that we identify with a bicolored standartword) then
f (σ) = (P,Q)⇔ g(σ−1) = (Q,P)
Conjecture 2
Algorithm f commutes with standardization and truncation.
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 13 / 15
![Page 31: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/31.jpg)
Conjectures
Conjecture 1
If σ is a signed permutation (that we identify with a bicolored standartword) then
f (σ) = (P,Q)⇔ g(σ−1) = (Q,P)
Conjecture 2
Algorithm f commutes with standardization and truncation.
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 13 / 15
![Page 32: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/32.jpg)
What is missing?
If σ is a signed permutation, what can we relate f (σ) and f (σ−1) ?
Extend g to all words
Enumerative consequences
Cauchy identity
Hook formula for shifted domino tableaux
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 14 / 15
![Page 33: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/33.jpg)
What is missing?
If σ is a signed permutation, what can we relate f (σ) and f (σ−1) ?
Extend g to all words
Enumerative consequences
Cauchy identity
Hook formula for shifted domino tableaux
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 14 / 15
![Page 34: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/34.jpg)
What is missing?
If σ is a signed permutation, what can we relate f (σ) and f (σ−1) ?
Extend g to all words
Enumerative consequences
Cauchy identity
Hook formula for shifted domino tableaux
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 14 / 15
![Page 35: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/35.jpg)
What is missing?
If σ is a signed permutation, what can we relate f (σ) and f (σ−1) ?
Extend g to all words
Enumerative consequences
Cauchy identity
Hook formula for shifted domino tableaux
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 14 / 15
![Page 36: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/36.jpg)
What is missing?
If σ is a signed permutation, what can we relate f (σ) and f (σ−1) ?
Extend g to all words
Enumerative consequences
Cauchy identity
Hook formula for shifted domino tableaux
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 14 / 15
![Page 37: Insertion algorithms for shifted domino tableauxslc/wpapers/s78vortrag/... · 2017-07-16 · Given a tiled partition , adomino tableauis a lling of dominos with positive integers](https://reader033.vdocuments.us/reader033/viewer/2022042219/5ec571fef5ea872f585b6dd2/html5/thumbnails/37.jpg)
Thank you for your attention!
Z. Chemli, M. Petreolle Insertion algorithms SLC 2017 15 / 15