Plactic relations for -domino tableaux
Müge Taşkin
Source abstract
The work of C. Bonnafé, M.Geck, L. Iancu and T. Lam shows through two conjectures that -domino tableaux have an important role in Kazhdan-Lusztig theory of type with unequal parameters. In this paper we provide plactic relations on signed permutations which determine whether two given signed permutations have the same insertion -domino tableaux in Garfinkle's algorithm. Moreover, we show that a particular extension of these relations can describe Garfinkle's equivalence relation on -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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.