A Robinson-Schensted-type algorithm for SO(2n, C)
نویسندگان
چکیده
منابع مشابه
A Robinson - Schensted Algorithm for a Class of Partial Orders
Let P be a nite partial order which does not contain an induced subposet isomorphic with 3 + 1, and let G be the incomparability graph of P . Gasharov has shown that the chromatic symmetric function XG has nonnegative coe cients when expanded in terms of Schur functions; his proof uses the dual Jacobi-Trudi identity and a sign-reversing involution to interpret these coe cients as numbers of P -...
متن کاملRobinson-Schensted algorithm and Vogan equivalence
We provide a combinatorial proof for the coincidence of Knuth equivalence classes, Kazhdan–Lusztig left cells and Vogan classes for the symmetric group, involving only Robinson-Schensted algorithm and the combinatorial part of the Kazhdan–Lusztig cell theory. The determination of Kazhdan–Lusztig cells for the symmetric group is given in the proof of [4, Thm1.4]. The argument is largely combinat...
متن کاملA $q$-Robinson-Schensted-Knuth Algorithm and a $q$-Polymer
In Matveev-Petrov (2017) a q-deformed Robinson-Schensted-Knuth algorithm (qRSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pairs are swapped in a sense of distribution when the input matrix is transposed. We also formulate a...
متن کاملGeneralized Robinson-Schensted Algorithms
In Part I of this thesis, we locate a (conjecturally complete) set of unitary representations in the admissible dual of U(p, q). In a little more detail, Barbasch and Vogan have used the theory of Kazhdan-Lusztig cells to parametrize the irreducible Harish-Chandra modules with integral infinitesimal character in terms of their annihilators and associated varieties. Vogan has conjectured that th...
متن کاملA q-weighted version of the Robinson-Schensted algorithm
We introduce a q-weighted version of the Robinson-Schensted (column insertion) algorithm which is closely connected to q-Whittaker functions (or Macdonald polynomials with t = 0) and reduces to the usual Robinson-Schensted algorithm when q = 0. The q-insertion algorithm is ‘randomised’, or ‘quantum’, in the sense that when inserting a positive integer into a tableau, the output is a distributio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1991
ISSN: 0021-8693
DOI: 10.1016/0021-8693(91)90269-e