Flagged Hamel--Goulden formulas

We obtain Hamel–Goulden-type ribbon decomposition determinantal formulas for flagged supersymmetric Schur functions. As an application, we derive corresponding new determinantal formulas dual refined canonical stable Grothendieck polynomials. These results generalize and produce a number of new determinantal formulas for these symmetric functions including Jacobi–Trudi and skew Giambelli-type determinants.

💡 Research Summary

This paper develops a comprehensive framework that unifies and extends determinantal formulas for a broad class of symmetric functions, namely flagged supersymmetric Schur functions and their specializations to dual refined canonical stable Grothendieck polynomials. The authors begin by recalling the classical Jacobi–Trudi, Giambelli, and Lascoux–Pragacz determinantal identities for ordinary Schur functions, and they emphasize the Hamel–Goulden ribbon‑decomposition approach as a powerful unifying tool.

The central objects of study are supersymmetric Schur functions in two infinite sets of variables, denoted (S_{\lambda/\mu}(x/y)), together with a pair of integer vectors (\mathbf a=(a_i)) and (\mathbf b=(b_i)) that impose column‑wise (or row‑wise) flag constraints. A column flag requires that each entry in column (j) lies between (a_j) and (b_j); a row flag imposes analogous bounds on each row. The paper defines column‑flagged and row‑flagged supersymmetric Schur functions via determinants whose entries are supersymmetric elementary or complete homogeneous functions (e_n(x/y)) and (h_n(x/y)) evaluated at appropriately shifted variable subsets determined by the flags.

A key combinatorial insight is the introduction of “flagged Z‑SSYT” (integer‑valued semistandard Young tableaux respecting the flag bounds) and their conversion into “super tableaux” that may contain primed entries. Each super tableau carries a weight obtained by multiplying variables (y_r) for unprimed entries (r) and (-z_r) for primed entries (r’). The authors prove a tableau formula (Theorem 4.5) stating that the flagged supersymmetric Schur function equals the sum of weights over all such super tableaux. This yields a manifestly monomial‑positive expression and generalizes the classical bitableau description of supersymmetric Schur functions.

The novel technical contribution lies in the construction of an “outer ribbon decomposition” of a skew r‑shape (\lambda/\mu). A ribbon is a connected skew diagram without a (2\times2) block; the outer decomposition partitions the diagram into ribbons whose heads lie on the left or bottom perimeter and tails on the top or right perimeter. For each ribbon the authors define induced ribbon flags that record, for every cell, whether the path proceeds upward or rightward and how the flag bounds change along the ribbon. Using these induced flags they formulate a Hamel–Goulden‑type determinantal identity (Section 5) that expresses the flagged supersymmetric Schur function as a determinant of supersymmetric elementary functions whose indices are precisely the ribbon‑flag data.

The paper then introduces a “(g)‑specialization” that substitutes the infinite variable sets (y) and (z) by a finite set of ordinary variables (x_1,\dots,x_m) together with the refinement parameters (\alpha) and (\beta). Under this specialization the flagged supersymmetric Schur function collapses to the dual refined canonical stable Grothendieck polynomial (g_{\lambda/\mu}(x_m;\alpha,\beta)). The authors show that the same ribbon‑flag determinant, after specialization, yields new determinantal formulas for these Grothendieck polynomials. In particular, by choosing specific flag vectors (e.g., (a_i=-i+2) and (b_i=\lambda’i+m-1)) the determinant reduces exactly to the known definition of (g{\lambda/\mu}), while other flag choices produce novel Jacobi–Trudi‑type and skew Giambelli‑hook formulas that were not previously known.

Sections 7 and 8 illustrate several concrete specializations. When the shape (\lambda/\mu) is a straight (non‑skew) diagram, the authors recover a Jacobi–Trudi determinant with entries (h_{e}) evaluated at shifted variables, and a skew Giambelli‑hook determinant that generalizes the Lascoux–Naruse formula. For the Grothendieck side, analogous Jacobi–Trudi‑type determinants involve the refined parameters (\alpha,\beta) and exhibit new cancellation patterns compared with earlier results in the literature.

The concluding section discusses potential applications. Because dual stable Grothendieck polynomials appear in K‑theoretic Schubert calculus, plane‑partition enumeration, and last‑passage percolation models, the new ribbon‑flag formulas may provide fresh combinatorial interpretations, facilitate positivity proofs, and suggest extensions to multivariate or non‑commutative settings. The authors also point out open problems such as extending the framework to multiple flag families, to non‑ribbon decompositions, and to quantum or elliptic analogues.

In summary, the paper delivers a robust, flag‑aware ribbon‑decomposition machinery that unifies and extends a wide spectrum of determinantal identities for supersymmetric Schur functions and refined Grothendieck polynomials, offering both elegant combinatorial tableau interpretations and powerful algebraic tools for future research.