Uncrowding algorithm for hook-valued tableaux (Q2128846): Difference between revisions

A hook tableau is a semi-standard Young tableau shaped like an `L', in French notation. A hook-valued tableau is a tableau where each box contains a hook tableau, such that \par i) if a box \(A\) is to the left of a box \(B\), but in the same row, then \(\max(A) \leqslant \min(B)\), and \par ii) if a box \(A\) is below a box \(B\), but in the same column, then \(\max(A) < \min(C)\). Here, \(\max(A)\) refers to the maximal entry of the hook tableau in box \(A\), and \(\min(A)\) is the minimal entry. Hook-valued tableaux generalise set-valued tableau and multiset-valued tableau: these result from the cases where the hooks consist of single columns and single rows, respectively. Just as with other sorts of tableaux, there is a crystal structure on hook-valued tableaux, introduced by \textit{G. Hawkes} and \textit{T. Scrimshaw} [Algebr. Comb. 3, No. 3, 727--755 (2020; Zbl 1441.05236)]. This specialises in the crystal structure of set-valued tableaux and multiset-valued tableaux. For set-valued tableaux, there exists an uncrowding operator which maps a set-valued tableau to a pair consisting of a semi-standard Young tableau and a flagged increasing tableau. The operator is ``uncrowding'' in the sense that the output semistandard Young tableau has the same underlying multiset of numerical entries as the original set-valued tableau, except now we have one numerical entry per box, instead of a set of numerical entries per box. The flagged increasing tableau which is part of the output records data on how the tableau was uncrowded, thus allowing the original tableau to be reconstructed from the pair. A flagged increasing tableau is a tableau of skew shape which is increasing in both rows and columns such that entries in row \(i\) are at least \(i - 1\). An important property of the uncrowding operator on set-valued tableaux is that it intertwines with crystal operators. The heart of the paper is the definition of an uncrowding operator for hook-valued tableaux. The output of such an operator is a set-valued tableaux and a column-flagged increasing tableaux. A column-flagged increasing tableau is the transpose of a flagged increasing tableau. This operator also has the desired property of intertwining with crystal operators. One can then uncrowded completely by uncrowding the output set-valued tableau. There also exists an uncrowding operator on multiset-valued tableaux. The authors prove that their uncrowding operator on hook-valued tableaux generalises this operator. They also provide an inverse to their uncrowding map, giving a ``crowding'' map, which reassembles the original hook-valued tableau from a set-valued tableau and a column-flagged increasing tableau. This crowding map can only be applied to pairs that are compatible with each other in a certain way. The authors also introduce an alternative uncrowding map on hook-valued tableaux which outputs a multiset-valued tableau and flagged increasing tableau. This uncrowding operator uncrowds the legs of the hooks in the hook-valued tableau, rather than the arms, as it were. It likewise intertwines with crystal operators. In the final section, the authors apply their results to canonical Grothendieck polynomials. They use the uncrowding map to show that canonical Grothendieck polynomials have a tableau Schur expansion. Canonical Grothendieck polynomials are symmetric polynomials that can be expressed as generating functions of hook-valued tableaux. A symmetric function is said to have a tableau Schur expansion if it is the weighted sum of the Schur functions of a particular set of tableaux. A corollary of this result is an expansion of canonical Grothendieck polynomials in terms of stable symmetric Grothendieck polynomials and dual stable symmetric Grothendieck polynomials. Here, stable symmetric Grothendieck polynomials are generating functions of set-valued tableau and dual stable symmetric Grothendieck polynomials are generating functions of reverse plane partitions.