A bijection between atomic partitions and unsplitable partitions.
A bijective proof of the hook-content formula for super Schur functions and a modified jeu de taquin.
A character on the quasi-symmetric functions coming from multiple zeta values.
A color-to-spin domino Schensted algorithm.
A combinatorial approach to evaluation of reliability of the receiver output for BPSK modulation with spatial diversity.
A combinatorial formula for the Hilbert series of bigraded -modules.
A combinatorial interpretation for the coefficients in the Kronecker product .
A concise proof of the Littlewood-Richardson rule.
A decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth algorithm.
A derivation of Kohnert's algorithm from Monk's rule.
A generalization of an inequality involving the generalized elementary symmetric mean.
A generalized major index statistic.
A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.
A Little bijection for affine Stanley symmetric functions.
A Littlewood-Richardson rule for evaluation representations of .
A minimal Set of Generators for the Ring of multisymmetric Functions
The purpose of this article is to give, for any (commutative) ring , an explicit minimal set of generators for the ring of multisymmetric functions as an -algebra. In characteristic zero, i.e. when is a -algebra, a minimal set of generators has been known since the 19th century. A rather small generating set in the general case has also recently been given by Vaccarino but it is not minimal in general. We also give a sharp degree bound on the generators, improving the degree bound previously...
A multinomial extension of an inequality of Haber.
A new class of symmetric functions.
A normalization formula for the Jack polynomials in superspace and an identity on partitions.
A note on Jeu de Taquin
A direct formula for jeu de taquin applied to the swap of two rows of standard tableaux is given. A generalization of this formula to non standard tableaux is used to describe combinatorially a path basis isomorphism for the algebra of type .