Distributed Computation of Ribbon Tableaux and Spin Polynominals
نویسنده
چکیده
Recent works in algebraic combinatorics have brought up to date the importance of certain planar structures, called ribbon tableaux, which are generalizations of Young tableaux. This paper gives an algorithm to eeciently distribute, using PVM, the computation of the set of all ribbon tableaux of given shape and weight. It also provides a way to compute the spin polynomials associated to those sets of ribbon tableaux, these polynomials leading to generalizations of Hall-Littlewood functions.
منابع مشابه
Parallel Computation in Combinatorics Using Pvm Parallel Computation in Combinatorics (1) Using Pvm
We give several examples where PVM was successfully used as a tool for distributed computation of solutions of combinatorial problems. Involved topics are the computation of the solution of multi-dimensional subset sum problems which appear in the construction of block designs, the construction and classiication of nite solvable groups up to isomorphism, and the computation of spin polynomials ...
متن کاملA Generating Algorithm for Ribbon Tableaux and Spin Polynomials
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it permits one to generate ribbon tableaux with skew shapes.
متن کاملSpin-Preserving Knuth Correspondences for Ribbon Tableaux
The RSK correspondence generalises the Robinson-Schensted correspondence by replacing permutation matrices by matrices with entries in N, and standard Young tableaux by semistandard ones. For r ∈ N>0, the Robinson-Schensted correspondence can be trivially extended, using the r-quotient map, to one between r-coloured permutations and pairs of standard r-ribbon tableaux built on a fixed r-core (t...
متن کاملar X iv : 0 70 9 . 09 71 v 1 [ m at h . C O ] 6 S ep 2 00 7 k - RIBBON FIBONACCI TABLEAUX
We extend the notion of k-ribbon tableaux to the Fibonacci lattice, a differential poset defined by R. Stanley in 1975. Using this notion, we describe an insertion algorithm that takes k-colored permutations to pairs of k-ribbon Fibonacci tableaux of the same shape, and we demonstrate a colorto-spin property, similar to that described by Shimozono and White for ribbon tableaux. We give an evacu...
متن کاملTwo Results on Domino and Ribbon Tableaux
Inspired by the spin-inversion statistic of Schilling, Shimozono and White [8] and Haglund et al. [2] we relate the symmetry of ribbon functions to a result of van Leeuwen, and also describe the multiplication of a domino function by a Schur function.
متن کامل