SearcharxivSearch

arXiv subjects

Luis Pena

Publications and source records attributed to Luis Pena.

3 recordsLinked to original sources

A new characterization of right keys, and the $m$-symmetric Schur functions at $t=0$

The ring $R_m$ of $m$-symmetric functions consists of the formal power series that are symmetric in the variables $x_{m+1},x_{m+2},\dots$ but carry no symmetry in the first $m$ variables. We develop a combinatorial theory for the specialization at $t=0$ of the Schur functions of $R_m$. Our main tool is a new characterization of right key tableaux as suprema of the sets of decreasing subwords of the reading words of the subtableaux of $T$. Being invariant under elementary Knuth transformations, this characterization is compatible with the RSK correspondence. We obtain in this way a generating function over semistandard tableaux for the $m$-symmetric Schur functions at $t=0$, together with a combinatorial proof of a Cauchy identity in $R_m$. The $m$-symmetric Schur functions and their dual are then respectively identified with Demazure atoms and Demazure characters. Restricted to the last $m$ variables, our correspondence specializes to a proof, by ordinary RSK, of Lascoux's nonsymmetric Cauchy identity for Demazure characters and atoms. As further applications, we relate the $m$-symmetric Schur functions at $t=0$ to the almost symmetric Schur functions through a unitriangular change-of-basis matrix, obtain tableau generating functions and Cauchy identities for both families, and derive Jacobi-Trudi type determinantal formulas for three different bases.

math.CO

A proof of the $m$-Symmetric Macdonald positivity at $t=1$

We prove, in the case $t=1$, the extension to the $m$-symmetric world of the original Macdonald positivity conjecture. This is achieved by giving a combinatorial interpretation of the Kostka coefficients $K_{\Omega \Lambda}(q,1)$ in terms of standard fillings of the diagram associated to the $m$-partition $\Omega$. This interpretation generalizes the one in the usual Macdonald case, which is given by a major index statistic on standard tableaux.

math.CO

Parking functions with zero secondary dinv

We show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$.

math.CO