6 citations · 11 across the 8 of their papers we have counts for
8 papers
Making research on symmetric functions using MuPAD-Combinat
Francois Descouens
We present an overview of the implementation of symmetric functions in MuPAD-Combinat. We also explain how to interface C++ programs with MuPAD in order to make efficient research…
A Filtration of (q,t)-Catalan numbers
N. Bergeron, F. Descouens, M. Zabrocki
We define new generalizations of (q,t)-Catalan numbers applying nabla operator on k-Schur functions indexed by column partitions. In some special cases, we give a combinatorial int…
A non-commutative generalization of -Schur functions
N. Bergeron, F. Descouens, M. Zabrocki
We introduce non-commutative analogues of -Schur functions of Lapointe-Lascoux and Morse. We give an explicit formulas for the expansions of non-commutive functions with one and…
A bijective proof of a factorization formula for Macdonald polynomials at roots of unity
Francois Descouens, Hideaki Morita, Yasuhide Numata
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restrict…
Ribbon tableaux, ribbon rigged configurations and Hall-Littlewood functions at roots of unity
Francois Descouens
Hall-Littlewood functions indexed by rectangular partitions, specialized at primitive roots of unity, can be expressed as plethysms. We propose a combinatorial proof of this formul…
A generating algorithm for ribbon tableaux and spin polynomials
Francois Descouens
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 a…