Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
We construct an injection from the set of r-fans of Dyck paths of length n into the set of chord diagrams on [n] that intertwines promotion and rotation. This is done in two different ways, namely as fillings of promotion matrices and in terms of Fomin growth diagrams. Our analysis uses the fact that r-fans of Dyck paths can be viewed as highest weight elements of weight zero in crystals of type Br, which in turn can be analyzed using virtual crystals. On the level of Fomin growth diagrams, the virtualization process corresponds to the Roby–Krattenthaler blow up construction. Our construction generalizes to vacillating tableaux as well. We give a cyclic sieving phenomenon on r-fans of Dyck paths using the promotion action.more » « less
-
We define two symmetric $q,t$-Catalan polynomials in terms of the area and depth statistic and in terms of the dinv and dinv of depth statistics. We prove symmetry using an involution on plane trees. The same involution proves symmetry of the Tutte polynomials. We also provide a combinatorial proof of a remark by Garsia et al. regarding parking functions and the number of connected graphs on a fixed number of vertices.more » « less
-
Abstract Whereas set-valued tableaux are the combinatorial objects associated to stable Grothendieck polynomials, hook-valued tableaux are associated with stable canonical Grothendieck polynomials. In this paper, we define a novel uncrowding algorithm for hook-valued tableaux. The algorithm “uncrowds” the entries in the arm of the hooks, and yields a set-valued tableau and a column-flagged increasing tableau. We prove that our uncrowding algorithm intertwines with crystal operators. An alternative uncrowding algorithm that “uncrowds” the entries in the leg instead of the arm of the hooks is also given. As an application of uncrowding, we obtain various expansions of the canonical Grothendieck polynomials.more » « less
Full Text Available