No Arabic abstract
We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schroder paths and give a bijection between the set of increasing rectangular tableaux and small $m$-Schroder paths, generalizing a result of Pechenik [3]. Using $K$-jeu de taquin promotion, which was defined by Thomas and Yong [10], we give a cyclic sieving phenomenon for the set of increasing hook tableaux.
We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give three different proofs for these identities, namely, two algebraic proofs and one combinatorial proof. Some applications are also given which lead to many known and new identities.
In 1976, King defined certain tableaux model, called King tableaux in this paper, counting weight multiplicities of irreducible representation of the symplectic group $Sp(2m)$ for a given dominant weight. Since Kashiwara defined crystals, it is an open problem to provide a crystal structure on King tableaux. In this paper, we present crystal structures on King tableaux and semistandard oscillating tableaux. The semistandard oscillating tableaux naturally appear as $Q$-tableaux in the symplectic version of RSK algorithms. As an application, we discuss Littlewood-Richardson coefficients for $Sp(2m)$ in terms of semistandard oscillating tableaux.
This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any standard Young tableau with at least $5$ entries can be reconstructed from its set of $1$-minors.
Motivated by Stanleys results in cite{St02}, we generalize the rank of a partition $lambda$ to the rank of a shifted partition $S(lambda)$. We show that the number of bars required in a minimal bar tableau of $S(lambda)$ is max$(o, e + (ell(lambda) mathrm{mod} 2))$, where $o$ and $e$ are the number of odd and even rows of $lambda$. As a consequence we show that the irreducible projective characters of $S_n$ vanish on certain conjugacy classes. Another corollary is a lower bound on the degree of the terms in the expansion of Schurs $Q_{lambda}$ symmetric functions in terms of the power sum symmetric functions.
In this paper, we prove the real-rootedness of two classes of generalized Narayana polynomials: one arising as the $h$-polynomials of the generalized associahedron associated to the finite Weyl groups, the other arising in the study of the infinite log-concavity of the Boros-Moll polynomials. For the former, Br{a}nd{e}n has already proved that these $h$-polynomials have only real zeros. We establish certain recurrence relations for the two classes of Narayana polynomials, from which we derive the real-rootedness. To prove the real-rootedness, we use a sufficient condition, due to Liu and Wang, to determine whether two polynomials have interlaced zeros. The recurrence relations are verified with the help of the Mathematica package textit{HolonomicFunctions}.