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.
Main Author: | Francois Descouens |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2007-05-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/648 |
Similar Items
-
Combinatorics of ribbon tableaux
by: Lam, Thomas F. (Thomas Fun Yau)
Published: (2006) -
Singular Nonsymmetric Jack Polynomials for Some Rectangular Tableaux
by: Charles F. Dunkl
Published: (2020-04-01) -
Zhang–Zhang Polynomials of Ribbons
by: Bing-Hau He, et al.
Published: (2020-12-01) -
Colored HOMFLY Polynomials as Multiple Sums over Paths or Standard Young Tableaux
by: A. Anokhina, et al.
Published: (2013-01-01) -
Propriétés des tableaux de permutation et des tableaux-vidés
by: Paré, Jérôme
Published: (2008)