Pith. sign in

REVIEW 2 major objections 5 minor 4 references

Falling stars: a fall-decorated rational shuffle theorem

T0 review · 2 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Fall-decorated paths satisfy a rational shuffle identity

desk verdict A genuine unification in shuffle theory, with one deferred proof step that deserves a referee's eye. read the letter →

arxiv 2508.20935 v2 pith:65CBUGS6 submitted 2025-08-28 math.CO

Alessandro Iraci , Roberto Pagaria , Giovanni Paolini This is my paper · ORCID
classification math.CO MSC 05E0505A1905A3005E10
keywords fall-decoratedrectangularDyckpathsrationalshuffletheoremDeltaconjecturesquaredinvstatisticMacdonaldpolynomialsskewingoperatorlattice
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper establishes a rational analog of the fall Delta theorem: applying a certain symmetric-function operator (the Schur skewing operator s^⊥_{(m-1)k}) to e_{m,n+km} produces a weighted count of fall-decorated labeled rectangular Dyck paths. The new ingredient is a dinv statistic defined on paths whose decorated horizontal steps are marked falls; it simultaneously extends the dinv of ordinary rectangular Dyck paths and of rise-decorated square paths. The resulting identity unifies two previously separate results—the rational shuffle theorem and the rise Delta theorem—and also gives the combinatorial side of a proposed fall version of the Delta square conjecture. A companion formula for unrestricted rectangular paths is proved conditionally on a previously stated conjecture, and unconditionally when the rectangle side lengths are coprime.

What carries the argument

The load-bearing identity is the skewing expansion s_{(m-1)k} = Σ_α (-1)^{sgn(α)} h_α̃ (mod h_j, j>m), obtained by Jacobi-Trudi. The proof then runs on three mechanisms: the bijection ψ that prunes the big vertical steps of an (m,n+km) labeled rectangular path to produce an (m+k,n+k) fall-decorated path with a fall-labeling; the ENS representation, in which decorated horizontal steps become South steps and which preserves vertical distances and area; and the lifted sign-reversing involution φ on fall-labelings, ordered by the 'star word' (labels of decorated falls read by decreasing vertical distance), whose unique fixed point is the word 1 2 … k. Proposition 4.14 asserts that φ preserves th

What would settle it

Brute-force check Proposition 4.14 for all allowable fall-labelings of a small path, say m=2, n=3, k=3, by comparing falldinv(π,w) and falldinv(π,φ(w)) under the star-word ordering; a single mismatch would invalidate Theorem 1.1. Independently, compute both sides of Conjecture 7.10 at n=2,k=2 to test the proposed fall Delta square identity.

Watch

Extended reading notes

Core claim

The paper's main theorem states that for any positive integers m, n, k, the Schur skewing operator s^⊥_{(m-1)k} applied to e_{m,n+km} equals the sum over fall-decorated labeled rectangular Dyck paths π in LRD(m+k,n+k)^{*k} of q^{dinv(π)} t^{area(π)} x^π. Here the paths stay weakly above a broken diagonal, the marked falls are horizontal steps immediately followed by another horizontal step, and dinv is a new diagonal-inversion statistic defined as a temporary inversion count plus a correction term cdinv built from decorated falls. The proof proceeds through a bijection ψ from labeled rectangular paths with big vertical labels to fall-decorated paths carrying a fall-labeling, an ENS represent

Load-bearing premise

The main theorem rests on the assertion that the sign-reversing involution on fall-labelings preserves the fall-correction statistic falldinv; that assertion is deferred to a cited lemma, and if it fails the proof's cancellations do not go through, while the rectangular version additionally assumes a previously stated open conjecture.

Editorial extensions

If this is right

  • Setting k=0 recovers Mellit's rational shuffle theorem, so the new formula is a strict extension rather than a separate conjecture.
  • Setting m=n recovers the rise Delta theorem (proved by D'Adderio and Mellit), giving a single statistic that covers both rectangular and decorated-square cases.
  • If the rectangular paths conjecture [IPPVW23, Conjecture 4.2] holds, the same method proves the rectangular (non-Dyck) version with [m]_q/[d]_q p_{m,n+km} on the left; the d=1 case is already unconditional.
  • Section 7 gives a q=1 refinement in which the generating function splits according to the fall-composition β and equals D_{α+β}(1)|_{q=1}, connecting the path sum to known D_α operators.
  • The right side of the fall version of the Delta square conjecture (Conjecture 7.9) is now a proved path generating function, so the open content is exactly the symmetric-function identity Θ_{e_k} ∇ω(p_n) = s^⊥_{(n-1)k} p_{n,n(k+1)} (Conjecture 7.10).

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The proof's deferral to [GGG24, Lemma 4.6] for Proposition 4.14 marks the transfer of the sign-reversing involution as the central technical risk; a reader wanting to extend the theorem to other decorations should verify that transfer first.
  • Because Remark 3.8 states the construction works for any broken slope with positive reals a,b, the proof likely adapts verbatim to non-integer slope parameters; testing m=3,n=2 with an offset would be a direct extension.
  • The fixed-point fall-labeling w*=1 2 … k defines a canonical linear order on decorated falls by vertical distance; this order may be the right replacement for the 'rise' order in the open rise-decorated rectangular problem and could yield the missing dinv statistic there.
  • The identity in Conjecture 7.5 relating scalar products with h_d suggests that Schröder-path analogues of these theorems would follow by taking the appropriate scalar product, which may be a simpler testbed than full labeled paths.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. This paper proves a 'fall-decorated rational shuffle theorem' (Theorem 1.1): for any positive m and natural n, k, the skewing operator s^⊥_{(m-1)k} applied to e_{m,n+km} equals the q,t-generating function over labeled fall-decorated rectangular Dyck paths in LRD(m+k,n+k)^{*k}, using a newly defined dinv statistic and the area statistic. The proof combines Mellit's rational shuffle theorem, the Jacobi-Trudi expansion of s_{(m-1)k}, a bijection ψ from certain labeled rectangular paths to fall-decorated paths, a sign-reversing involution on fall-labelings, and a comparison (Theorem 5.1) between the dinv of a path and the dinv of its preimage under ψ. The paper also proves, conditional on [IPPVW23, Conjecture 4.2], an analogous formula for rectangular paths (Theorem 1.2), and discusses connections to Delta theorems, D_α operators, Theta operators, and the Delta square conjecture.

Significance. If fully established, Theorem 1.1 is a meaningful unification: k=0 reduces to Mellit's rational shuffle theorem, and m=n reduces to the rise Delta theorem, so the new dinv statistic genuinely interpolates between known settings. The proof is constructive and non-circular, relying on external proven results and a detailed bijection. The conditional Theorem 1.2 is clearly labeled, and the paper includes useful consistency checks and several new conjectures. However, there are two load-bearing gaps: the proof of Proposition 4.14 is deferred to a citation, and the use of Proposition 4.2 for non-Dyck rectangular paths is not justified. These issues should be fixed before the paper is accepted.

major comments (2)
  1. [Section 4.3, Proposition 4.14] The proof is a single sentence: 'By the same argument as [GGG24, Lemma 4.6], the result follows.' This is load-bearing for the sign-reversing cancellation in Section 6: if falldinv is not preserved by φ, the contributions of w and φ(w) do not cancel, and Theorem 1.1 does not follow from the presented argument. The transfer is not automatic: falldinv is defined through attacking pairs involving the big vertical steps B of ψ^{-1}(π,w), whose labels are obtained from the fall-labeling w by complementation inside each horizontal block, not by reading the star word in vertical-distance order. An involution preserving tied inversions in the star word does not, by itself, obviously preserve the vertical-offset data counted by falldinv. Please provide a complete proof or a precise reduction to [GGG24, Lemma 4.6].
  2. [Section 4.1, Proposition 4.2] The preamble states that the generating function over LRP(m,n) is symmetric 'as it is a positive sum of LLT polynomials'. For rectangular paths without the Dyck condition, this is not a known theorem; it is essentially the content of the rectangular paths conjecture [IPPVW23, Conjecture 4.2], which the paper leaves open. The unconditional statement of Proposition 4.2 for LRP is therefore unsupported. The proof of Theorem 1.1 only needs the LRD case, but the proof of the conditional Theorem 1.2 uses the LRP case; if Proposition 4.2 for LRP is not available, the derivation of Theorem 1.2 from Conjecture 6.2 must be supplied explicitly, e.g., by invoking the assumed symmetry after Conjecture 6.2.
minor comments (5)
  1. [Section 1] Typo: 'the the success story' should be 'the success story'.
  2. [Definition 2.4] Typo: 'symmetric functionf' should be 'symmetric function f'.
  3. [Title page] Author name spacing: 'GIOV ANNI PAOLINI' should be 'GIOVANNI PAOLINI'.
  4. [Theorem 1.2] The statement is called a theorem but is conditional on an unproved conjecture. Consider relabeling it as 'conditional theorem' or explicitly 'Theorem (conditional on Conjecture 6.2)' to avoid ambiguity.
  5. [Figures 3 and 5] The dashed projection lines and the distinction between the usual and ENS representations are hard to read in the small figures. Enlarging the figures or labeling the relevant steps would improve clarity.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: Theorem 1.1 is proven from external theorems and a new combinatorial dinv; the only caveat is that Theorem 1.2 is explicitly conditional on the authors' own unproved conjecture [IPPVW23, Conjecture 4.2].

full rationale

The derivation of Theorem 1.1 is self-contained in the relevant sense: it starts from Mellit's rational shuffle theorem [Mel21], applies the skewing expansion [GGG24, Eq. (10)], uses the external sign-reversing involution [GGG24, Theorem 4.30], and contributes a new bijection ψ (Proposition 4.9, Lemma 4.10), a new fall-labeling statistic falldinv, and a new dinv computation (Theorem 5.1). The statistic dinv is defined combinatorially on fall-decorated paths, not fitted to the symmetric function side, and no parameter is tuned to force the identity. The k=0 case reproduces the known rational shuffle theorem as a check, not as an input. Proposition 4.14 is deferred to [GGG24, Lemma 4.6]; that is an external citation and a proof gap at worst, not circularity. The only self-citation is Theorem 1.2, which is stated as an implication from [IPPVW23, Conjecture 4.2], a conjecture made by three of the four current authors in a prior paper. Because that theorem is explicitly conditional and is not used in the proof of Theorem 1.1, it does not make the paper's derivation circular, but it does mean the rectangular non-Dyck formula is not an unconditional result. Score 2 reflects this minor conditional self-citation rather than any circular reduction.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The proofs rest on imported theorems from the literature (Mellit's shuffle theorem, GGG24's involution, Jacobi-Trudi) and on one unproved conjecture from the authors' own prior work. No fitted parameters or new postulates are introduced; the decorated paths and ENS representation are definitions, not assumptions with independent evidence.

assumptions (5)
  • standard math Mellit's rational shuffle theorem: e_{m,n} equals the q,t-generating function over LRD(m,n) for all positive m,n.
    Stated as Theorem 6.1 and used as the expansion base in the proof of Theorem 1.1; proved by Mellit in [Mel21].
  • standard math Properties of the sign-reversing involution phi on words with allowable content: it preserves tied inversions and has unique fixed point 12...k.
    Imported from [GGG24, Theorem 4.30] and lifted to fall-labelings in Definition 4.12 and Proposition 4.14.
  • standard math Jacobi-Trudi expansion: s_(m-1)^k equals a signed sum of complete homogeneous functions over allowable compositions, modulo h_j with j>m.
    Proposition 4.4, taken from [GGG24, Equation (10)], used to expand the skewing operator in Section 4.1.
  • standard math The generating function over labeled rectangular paths is a symmetric function, a positive sum of LLT polynomials, so that skewing extracts monomial coefficients.
    Assumed in Section 4.1 before Proposition 4.2; the LLT expansion is asserted without a specific reference in the paper.
  • domain assumption Rectangular paths conjecture: [m]_q/[d]_q p_{m,n} equals the q,t-generating function over LRP(m,n) for m,n with d=gcd(m,n).
    Stated as [IPPVW23, Conjecture 4.2], assumed to deduce Theorem 1.2; it is unproved and from a paper with three of the four current authors.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Falling stars: a fall-decorated rational shuffle theorem." pith.science (2026). https://pith.science/paper/65CBUGS6

@misc{pith2026250820935,
  author       = {Pith},
  title        = {Pith review of: Falling stars: a fall-decorated rational shuffle theorem},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/65CBUGS6}},
  note         = {Machine review of arXiv:2508.20935}
}
abstract

In this paper, we formulate a rational analog of the fall Delta theorem and the Delta square conjecture. We find a new dinv statistic on fall-decorated paths on a $(m+k) \times (n+k)$ rectangle that simultaneously extends the previously known dinv statistics on decorated square objects and non-decorated rectangular objects. We prove a symmetric function formula for the $q,t$-generating function of fall-decorated rectangular Dyck paths as a skewing operator applied to $e_{m,n+km}$ and, conditionally on the rectangular paths conjecture, an analog formula for fall-decorated rectangular paths.

Figures

Figures reproduced from arXiv: 2508.20935 by the authors.

Figure 1
Figure 1. Arm, leg, co-arm, and co-leg of a cell of a partition. respectively by aµ(c), lµ(c), a′ µ (c), l′ µ (c)) as the number of cells in µ that are strictly to the right, below, to the left and above c in µ, respectively (see [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. A 7 × 9 rectangular path with its base diagonal (dashed) and main diagonal (solid). Definition 3.2. For a m × n rectangular path π and a step i ∈ H (resp. i ∈ V), denote by vi = vi(π) the (signed) vertical distance between the right-most (resp. bottom-most) point of i and the main diagonal; the sign is positive if the endpoint is above the main diagonal. Define the vertical area word of the path as the sequence (vi)… view at source ↗
Figure 3
Figure 3. On the left, a decorated rectangular Dyck path of size (6 + 3) × (3 + 3) with its broken diagonal. On the right, the ENS representation of the same path. Decorated steps are highlighted in dark red. The three squares contributing to the area are highlighted in gray. decorated South steps (indexed by D), where a sequence of consecutive South steps must be followed by an East step; see [PITH_FULL_IMAGE:figures/full_f… view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: A 9 × 7 labeled rectangular path (left) and labeled decorated Dyck path (right). In this case, we set xi = yi in the plethystic alphabet X + Y . We now extend the definition of dinv given in [IPPVW23] (cfr. [BGSLX16, HS15, Mel21]) to any fall-decorated rectangular path…
Figure 5
Figure 5. Figure 5: Graphical description of the pairs of steps in D+ (top left), D− (top right), D∗ + (bottom left), and D∗ − (bottom right). The dashed lines denote diagonal projections: in particular, they are vertical translates of the broken diagonal and might not be straight. Defini…
Figure 6
Figure 6. Figure 6: Graphical description of the pairs of steps in D∗ + (left), and D∗ − (right) in the ENS representation. The set D∗ + consists of all pairs of horizontal steps i < j such that step i is decorated and both endpoints of step j diagonally project onto step i (right-most en…
Figure 7
Figure 7. Figure 7: Graphical description of the pairs of steps in C+ (top), C− (bottom left), and C ∗ (bottom right). The dashed lines denote the diagonal projections: in particular they are vertical translates of the broken diagonal and might not be straight. ∗ ∗ ∗ ∗ ∗ ∗ [PITH_FULL_IMA…
Figure 8
Figure 8. Figure 8: Graphical description of the pairs of steps in C− (left), and C ∗ (center and right) in the ENS representation. Lemma 3.19. For each path (π, D) ∈ RP(m + k, n + k)∗k, we have #D+ − #D− + #D∗ + − #D∗ − − #B ∗ = #C+ − #C− + #C ∗ . In particular, Definitions 3.17 and 3.18…
Figure 9
Figure 9. Figure 9: An example of the map ψ in Definition 4.5 for m = 5, n = 2, k = 3, and ˜α = (4, 4, 4). On the left, a path ˜π ∈ LRP(m, n + km) α˜ with its big labels (and the corresponding vertical steps i ∈ B) highlighted in green. On the top right, the ENS representation of ˜π. On t…
Figure 10
Figure 10. Figure 10: The subpaths πs as in the proof of Theorem 5.1, constructed from the paths of [PITH_FULL_IMAGE:figures/full_fig_p020_10.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

4 extracted references · 4 canonical work pages

  1. [1]

    A combinatorial skewing formula for the Rise Delta Theorem

    [BG99] Fran¸ cois Bergeron and Adriano M. Garsia, Science fiction and Macdonald’s polynomials , Algebraic methods and q-special functions (Montr´ eal, QC, 1996), 1999, pp. 1–52. MR1726826 [BGHT99] Fran¸ cois Bergeron, Adriano M. Garsia, Mark Haiman, and Glenn Tesler, Identities and positivity con- jectures for some remarkable operators in the theory of sy...

    work page Pith review arXiv 1996

  2. [12]

    Remmel, and Andrew T

    MR3940652 26 ALESSANDRO IRACI, ROBERTO PAGARIA, AND GIOV ANNI PAOLINI [HR W18] James Haglund, Jeffrey B. Remmel, and Andrew T. Wilson,The Delta Conjecture, Trans. Amer. Math. Soc. 370 (2018), no. 6, 4029–4057. MR3811519 [HS15] Angela Hicks and Emily Sergel, A simpler formula for the number of diagonal inversions of an (m,n)- parking function and a returni...

    work page 2018

  3. [1995]

    Zelevinsky, Oxford Science Publications

    With contributions by A. Zelevinsky, Oxford Science Publications. MR1354144 [Mel21] Anton Mellit, Toric braids and (m,n)-parking functions , Duke Mathematical Journal 170 (2021dec), no. 18, 4123–4169. [QW20] Dun Qiu and Andrew Timothy Wilson, The valley version of the Extended Delta Conjecture, J. Combin. Theory Ser. A 175 (2020), 105271. [Ser17] Emily Se...

    work page 2020

  4. [2008]

    MR2371044 [Hai01] Mark Haiman, Hilbert schemes, polygraphs and the Macdonald positivity conjecture , J

    With an appendix on the com- binatorics of Macdonald polynomials. MR2371044 [Hai01] Mark Haiman, Hilbert schemes, polygraphs and the Macdonald positivity conjecture , J. Amer. Math. Soc. 14 (2001), no. 4, 941–1006. MR1839919 [Hai02] , Vanishing theorems and character formulas for the Hilbert scheme of points in the plane , Invent Math 149 (2002), no. 2, 3...

    work page 2001

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.