domino tableaux
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2020 ◽  
Vol 13 (5) ◽  
pp. 721-746
Author(s):  
Florence Maas-Gariépy ◽  
Rebecca Patrias
Keyword(s):  

2017 ◽  
Vol 21 (1) ◽  
pp. 43-71
Author(s):  
Ting-Yuan Cheng ◽  
Sen-Peng Eu ◽  
Tung-Shan Fu ◽  
Yi-Lin Lee

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
David B Rush

International audience A combinatorial expression for the coefficient of the Schur function $s_{\lambda}$ in the expansion of the plethysm $p_{n/d}^d \circ s_{\mu}$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $\lambda$ is rectangular. In these cases, the coefficient $\langle p_{n/d}^d \circ s_{\mu}, s_{\lambda} \rangle$ is shown to count, up to sign, the number of fixed points of an $\langle s_{\mu}^n, s_{\lambda} \rangle$-element set under the $d^e$ power of an order $n$ cyclic action. If $n=2$, the action is the Schützenberger involution on semistandard Young tableaux (also known as evacuation), and, if $\lambda$ is rectangular, the action is a certain power of Schützenberger and Shimozono's <i>jeu-de-taquin</i> promotion.This work extends results of Stembridge and Rhoades linking fixed points of the Schützenberger actions to ribbon tableaux enumeration. The conclusion for the case $n=2$ is equivalent to the domino tableaux rule of Carré and Leclerc for discriminating between the symmetric and antisymmetric parts of the square of a Schur function. Une expression combinatoire pour le coefficient de la fonction de Schur $s_{\lambda}$ dans l’expansion du pléthysme $p_{n/d}^d \circ s_{\mu}$ est donné pour tous $d$ que disent $n$, dans les cas où $n=2$, ou $\lambda$ est rectangulaire. Dans ces cas, le coefficient $\langle p_{n/d}^d \circ s_{\mu}, s_{\lambda} \rangle$ se montre à compter, où l’on ignore le signe, le nombre des point fixés d’un ensemble de $\langle s_{\mu}^n, s_{\lambda} \rangle$ éléments sous la puissance $d^e$ d’une action cyclique de l’ordre $n$. Si $n=2$, l’action est l’involution de Schützenberger sur les tableaux semi-standard de Young (aussi connu sous le nom des évacuations), et si $\lambda$ est rectangulaire, l’action est une certaine puissance de l’avancement jeu-de-taquin de Schützenberger et Shimozono.Ce travail étend les résultats de Stembridge et Rhoades, liant les point fixés des actions de Schützenberger aux tableaux de ruban. Pour le cas $n=2$ , la conclusion est équivalent à la règle des tableaux de dominos de Carré et Leclerc, qui distingue entre les parties symétriques et asymétriques du carré d’une fonction de Schur.


10.37236/2042 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Müge Taşkin

The work of C. Bonnafé, M.Geck, L. Iancu and T. Lam shows through two conjectures that $r$-domino tableaux have an important role in Kazhdan-Lusztig theory of type $B$ with unequal parameters. In this paper we provide plactic relations on signed permutations which determine whether two given signed permutations have the same insertion $r$-domino tableaux in Garfinkle's algorithm. Moreover, we show that a particular extension of these relations can describe Garfinkle's equivalence relation on $r$-domino tableaux which is given through the notion of open cycles. With these results we enunciate the conjectures of Bonnafé et al. and provide necessary tools for their proofs.


2010 ◽  
Vol 198 ◽  
pp. 23-45 ◽  
Author(s):  
Thomas Pietraho

AbstractA conjecture of Bonnafé, Geck, Iancu, and Lam parametrizes Kazhdan-Lusztig left cells for unequal-parameter Hecke algebras in type Bn by families of standard domino tableaux of arbitrary rank. Relying on a family of properties outlined by Lusztig and the recent work of Bonnafé, we verify the conjecture and describe the structure of each cell as a module for the underlying Weyl group.


2010 ◽  
Vol 198 ◽  
pp. 23-45
Author(s):  
Thomas Pietraho

AbstractA conjecture of Bonnafé, Geck, Iancu, and Lam parametrizes Kazhdan-Lusztig left cells for unequal-parameter Hecke algebras in typeBnby families of standard domino tableaux of arbitrary rank. Relying on a family of properties outlined by Lusztig and the recent work of Bonnafé, we verify the conjecture and describe the structure of each cell as a module for the underlying Weyl group.


2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Müge Taşkın

International audience The recent work of Bonnafé et al. (2007) shows through two conjectures that $r$-domino tableaux have an important role in Kazhdan-Lusztig theory of type $B$ with unequal parameters. In this paper we provide plactic relations on signed permutations which determine whether given two signed permutations have the same insertion $r$-domino tableaux in Garfinkle's algorithm (1990). Moreover, we show that a particular extension of these relations can describe Garfinkle's equivalence relation on $r$-domino tableaux which is given through the notion of open cycles. With these results we enunciate the conjectures of Bonnafé et al. and provide necessary tool for their proofs.


2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Jang Soo Kim

International audience Using growth diagrams, we define a skew domino Schensted algorithm which is a domino analogue of the "Robinson-Schensted algorithm for skew tableaux'' due to Sagan and Stanley. The color-to-spin property of Shimozono and White is extended. As an application, we give a simple generating function for a weighted sum of skew domino tableaux whose special case is a generalization of Stanley's sign-imbalance formula. The generating function gives a method to calculate the generalized sign-imbalance formula. Nous définissons, à partir de diagrammes de croissances, un algorithme de Schensted pour les dominos gauches. Cet algorithme est un analogue de l'algorithme de Schensted pour les tableaux gauches dû à Sagan et Stanley. Nous généralisons la propriété couleur-à-spin de Shimozono et White. Comme application, nous présentons une fonction génératrice simple pour une somme pondérée de tableaux de dominos gauches qui, dans un cas particulier, généralise la formule de "sign-imbalance'' de Stanley. La fonction génératrice donne aussi lieu à une méthode permettant de calculer la formule de "sign-imbalance''.


10.37236/1071 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Naiomi Cameron ◽  
Kendra Killpatrick

In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that is, the property that the total color of the permutation equals the sum of the spins of the domino tableaux. In this paper, we describe the poset of domino Fibonacci shapes, an isomorphic equivalent to Stanley's Fibonacci lattice $Z(2)$, and define domino Fibonacci tableaux. We give an insertion algorithm which takes colored permutations to pairs of tableaux $(P,Q)$ of domino Fibonacci shape. We then define a notion of spin for domino Fibonacci tableaux for which the insertion algorithm preserves the color-to-spin property. In addition, we give an evacuation algorithm for standard domino Fibonacci tableaux which relates the pairs of tableaux obtained from the domino insertion algorithm to the pairs of tableaux obtained from Fomin's growth diagrams.


Sign in / Sign up

Export Citation Format

Share Document