A generating algorithm for ribbon tableaux and spin polynomials

Simple item page
dc.creatorDescouens, Francois
dc.date2006-11-27
dc.date.accessioned2026-07-07T07:33:23Z
dc.date.available2026-07-07T07:33:23Z
dc.descriptionWe 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. This algorithm permits us to compute quickly big LLT polynomials in MuPAD-Combinat.
dc.identifierhttps://arxiv.org/abs/math/0611824
dc.identifierhttp://arxiv.org/abs/math/0611824
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119436
dc.subjectCombinatorics
dc.titleA generating algorithm for ribbon tableaux and spin polynomials
dc.typetext

Files

Collections

arXiv