Pith. sign in

REVIEW 3 major objections 5 minor 17 references

Pipe Dream Rectification and Dual RSK Correspondence

T0 review · 3 major / 5 minor · reviewed 2026-08-28 · deepseek-v4-flash

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

Pith's one-line read The paper proves that, for every binary matrix A, the insertion tableau of the transpose-complement A† is the natural complement of the ordinary recording tableau of A, so the pipe-dream variant of dual RSK is the ordinary correspondence…

desk verdict The paper's intended theorem is plausible, but every central statement drops the complement bar on rec(A), leaving a false printed theorem and a self-contradictory induction; the manuscript needs major revision before it says anything true. read the letter →

arxiv 2608.23530 v1 pith:XL2REFFM submitted 2026-08-24 math.CO math.AG

AnLan Xu This is my paper · ORCID
classification math.COmath.AG MSC 05E1005A1705E0514M15
keywords dualRSKcorrespondencesuperpipedreamsdreamrectificationbiGrassmannianpermutationsYoungtableauxGrothendieckpolynomialsbinarymatricessemicommutativity
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 proves a symmetry conjecture for the pipe-dream version of dual RSK: for every binary matrix A, the insertion tableau of the transpose-complement $A^\dagger$ equals the natural complement of the ordinary recording tableau of A. The result matters because it shows the pipe-dream variant is not a new correspondence but the familiar dual RSK in disguise, made symmetric on biGrassmannian permutations. The proof uses rectification of super pipe dreams (black-and-red checker diagrams encoding A) and a downward induction on the suffixes of A, showing each suffix step preserves the equality. A careful reader should come away with a new computational path from binary matrices to pairs of Young tableaux through pipe dreams.

What carries the argument

The central object is the super pipe dream: a rectangle of tiles colored black (encoding the 1-entries of A) and red (encoding the 0-entries), together with the ladder moves $Y^+_i$ that flow red checkers one column to the right while keeping black checkers in their rows. Repeated application of these flows separates the colors, and reading off the black component gives the insertion tableau. The proof's engine is a semicommutativity relation (Theorem 4.4) that reorders the long flow of $Y^+$ into column-by-column blocks, plus a downward induction on suffixes in which the suffix is rectified first and the remaining red checkers flow through without disturbing the black component (Theorem 4.5). The filling identity (Theorem 4.11) and shape compatibility (Proposition 4.12) then convert the pipe-dream equality into the tableau equality $\operatorname{ins}(A^\dagger) = \overline{\operatorname{rec}(A)}$.

What would settle it

Take any small binary matrix, for instance a $3\times 3$ example, and compute both sides of the claimed identity by hand or computer: rectification of the transpose-complement $A^\dagger$ versus the natural complement of the ordinary recording tableau of A. If any matrix yields different tableaux, the theorem is false. A more targeted test is to verify the locality assertion of Theorem 4.5 directly: after rectifying the suffix columns, check whether any red checker from the suffix lies in a column that a later $Y^+_i$ move touches; exhibiting such a matrix in which $V^*_i \neq V_i$ would sink the induction.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.2: for every $A \in BM_{m\times n}$, the tableau identity $\operatorname{ins}(A^\dagger) = \overline{\operatorname{rec}(A)}$ holds, where $\dagger$ is transpose-complement and the bar is the columnwise natural complement. Equivalently, the variant of dual RSK that sends A to $(\operatorname{ins}(A), \operatorname{ins}(A^\dagger))$ has its second component fully determined by the ordinary recording tableau, so the variant is symmetric and agrees with dual RSK up to complementation. The proof establishes this by rectifying super pipe dreams and inducting downward on the suffixes $A_i$ of A, showing that the black component of the rectification is insensitive to red checkers that have already been flowed past the working region.

Load-bearing premise

The induction relies on the claim that once the suffix columns of A have been rectified, the red checkers produced from those columns lie strictly to the right of every later ladder move and so cannot change the black component; if some red checker is later shifted left or participates in a ladder reaching into the working region, the equality $V^*_i = V_i$ collapses.

Editorial extensions

If this is right

  • The pipe-dream variant of dual RSK is symmetric: its second component is not independent data but the natural complement of the ordinary recording tableau.
  • The bijection between binary matrices and pairs of reverse semistandard Young tableaux of conjugate shape is recovered from pipe-dream rectification, giving a new proof of the dual Cauchy identity in the biGrassmannian case.
  • Both the insertion and recording tableaux of a binary matrix can now be read directly from reduced pipe dreams, providing a concrete pipe-dream algorithm for ordinary dual RSK.
  • The downward induction shows that the recording tableau of A is built suffix by suffix: the shape of the tableau for each suffix is determined by the insertion tableau of that suffix, and the labels are forced by the growth chain.
  • The shape compatibility statement ensures that the two tableaux in the pipe-dream variant always have complementary column heights, so any equality of entries forces an equality of full tableaux.

Reading between the lines

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

  • The same ladder-move commutations may prove analogous complement symmetries for other insertion algorithms (e.g., probabilistic or Hall–Littlewood variants), since the proof only uses local column-to-column behavior of flows; the paper does not explore this.
  • The uniqueness lemma from the growth chain suggests a suffix-based algorithm for ordinary dual RSK that builds the recording tableau by tracking shapes of suffix insertions, potentially faster than column-by-column insertion.
  • If the locality property in Theorem 4.5 were strengthened to a full commutation of $Y^+$ flow with column deletion, the equality would likely extend beyond biGrassmannian permutations to all permutations whose pipe dreams admit the same suffix decomposition.
  • The filling identity (all labels $1,\dots,i-1$ in every column) gives a direct bijective explanation of why transpose-complement swaps the two tableaux; a similar statement may hold in K-theoretic Grothendieck settings with a $\beta$ parameter.
Share X Bluesky LinkedIn Reddit HN

Formalized claims in Lean

  1. Claim #1: The central claim is Theorem 1.2: for every $A \in BM_{m\times n}$, the tableau identity $\operatorname{ins}(A^\dagger) = \overline{\operatorname{rec}(A)}$ holds, where $\dagger$ is transpose-complement and the bar is the columnwise natural complement. Equivalently, the variant of dual RSK that sends A to $(\operatorname{ins}(A), \operatorname{ins}(A^\dagger))$ has its second component fully deter

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The paper claims to prove Dennin's conjecture for a pipe-dream variant of dual RSK: for an m by n binary matrix A, the insertion tableau of the transpose-complement A^† equals the natural complement of the recording tableau rec(A). The intended statement appears in the abstract as ins(A^†) = overline{rec(A)}, and the proof uses super pipe dream rectification, local commutativity of Y^+ operators, a column-insertion comparison, and a downward induction on suffixes of A. The paper also develops several auxiliary results about padded suffix matrices, filling operations, and complementary positions of tableaux.

Significance. If the intended theorem is correct, it proves a nontrivial symmetry property of Dennin's pipe-dream variant of dual RSK, showing that the variant is symmetric on biGrassmannian permutations and hence equivalent to ordinary dual RSK. The approach via super pipe dream rectification is novel and connects the result to Grothendieck polynomial Cauchy identities. The paper provides a number of detailed examples and a structured proof strategy. However, as printed, the central theorem statement is false, and the induction proof requires systematic correction. The potential significance is real, but the current text is not yet a reliable proof.

major comments (3)
  1. [Section 1, Theorem 1.2] The displayed statement of Theorem 1.2, rec(A) = ins(A†), omits the complement bar and is false. For A = [1], rec(A) is the one-box tableau [1], while A† = [0] and ins(A†) is the empty tableau. The abstract and proof sketch correctly state ins(A†) = overline{rec(A)}. This error is load-bearing: every intermediate statement involving rec(A_i), including Theorems 4.13 and 4.14, must use overline{rec(A_i)} rather than rec(A_i), and the proof as written establishes the complemented statement only if those bars are restored globally.
  2. [Section 4, Theorem 4.14] The induction step begins with 'Because S_i = T_i, every label in [n] occurs in complementary positions in S_i and T_i.' This is internally inconsistent: if S_i = T_i, the tableaux are identical, not complementary. The argument only works if the induction hypothesis is S_i = overline{T_i}, i.e., ins(R_i) = overline{rec(A_i)}. As printed, the proof derives the wrong complementarity claim and therefore does not prove the stated equality. The induction needs to be rewritten with the complement bar carried through consistently.
  3. [Section 4, Theorem 4.5] The proof of the key locality assertion—that after rectifying the suffix columns, the resulting red checkers lie strictly to the right of the remaining operators and hence 'cannot affect the subsequent motion of black checkers'—is not rigorously justified. The argument appeals to the definition of ladder moves but does not establish that no interaction mechanism, such as a red checker later shifted left or a ladder extending into the working region, can alter the black component. Since V_i^* = V_i and Corollary 4.3 rest on this claim, a precise invariant or a lemma ruling out all such interactions is required.
minor comments (5)
  1. [Section 4, Theorem 4.13] In the proof of Theorem 4.13, the line 'By definition, the complementary tableau rec(An)' appears to refer to overline{rec(A_n)} but the bar is missing. The theorem statement also lacks the bar; please make the notation consistent throughout.
  2. [Section 4, Corollary 4.3] The proof of Corollary 4.3 uses the implication tab(V_i^*) = tab(V_i) = tab(V_i') implies V_i^* = V_i'. This requires that tab is injective on the relevant reduced pipe dreams; this fact should be stated and proved or cited.
  3. [Section 3, example after Figure 15] In the proof sketch, the text says 'Figure 15 shows that ins(R'_1) = ins(R1) = ...', but the caption of Figure 15 reads 'Rectification and Tableaux of R'_2'. Please correct the caption or the reference.
  4. [Section 2.3, Example 2.5] In Example 2.5, the line 'we get ins(A'_2) = 2 2 / 1 1' should presumably be ins(A'_1) = 2 2 / 1 1; the same confusion appears earlier when A'_2 is first computed. Please fix the labeling of the truncated suffix matrices.
  5. [Section 2.4, Example 2.6] The definition of the full tableau T and the example are not fully aligned with the reverse semistandard convention used elsewhere; for instance, the row and column entry sets should be stated more explicitly to avoid ambiguity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the proof derives the conjecture from rectification locality, tableaux growth, and prior external results; the missing complement bars create a correctness gap but not a circular one.

full rationale

The paper proves the conjectured identity by downward induction on suffixes. The load-bearing steps are the base case Theorem 4.13 and the induction step Theorem 4.14, supported by locality (Theorem 4.5), insertion invariance under zero padding (Theorem 4.6), lower-row invariance of the pipe-dream insertion (Theorem 4.9), the filling identity (Theorem 4.11), and shape compatibility (Proposition 4.12). None of these steps presupposes the target equality. The base case is computed from single-column insertion together with the filling identity; the induction step shows that if labels at least i occupy complementary positions in S_i and T_i, then the same holds in S_{i-1} and T_{i-1}, using the growth of the recording tableau and row-invariance of the insertion tableau. The paper invokes [Den25, Proposition 8.7 and Proposition 8.8] only for the external facts that pipe-dream insertion agrees with ordinary dual-RSK column insertion and that the variant has shape data (lambda, lambda-dagger); these are prior independent results, not the conjecture being proved. There is no fitted parameter, no quantity defined in terms of the claimed output, and no reliance on the present author's own previous work. The missing overline bars in Theorem 1.2, Theorem 4.13, and Theorem 4.14 are a notational and correctness defect: read literally, the printed equalities are false for A=[1], and the proof is written in terms of complementarity, not literal equality. This is an error in the manuscript's statement and internal notation, but it is not circular reasoning because the induction does not assume the conclusion; it derives the intended complement relation from the growth chain and external prior results. Hence the circularity score is 0.

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

No numerical parameters are fitted. The proof imports several structural facts from Dennin's paper, most importantly the equality between pipe-dream insertion and ordinary dual RSK insertion, and the shape description of the variant dRSK'. These are prior results, not derived here. The proof also silently uses the bijection between reduced Grassmannian pipe dreams and tableaux. No new entities are postulated.

assumptions (3)
  • domain assumption Pipe-dream insertion agrees with ordinary dual-RSK column insertion (Lemma 4.10, citing [Den25, Prop 8.7]).
    The proof of Lemma 4.10 and many later steps import this equality from Dennin's paper; it is not proved in this manuscript.
  • standard math Reduced pipe dreams for Grassmannian permutations are in bijection with reverse semistandard tableaux, and tab(V) determines V (used in Corollary 4.3).
    Standard in the pipe-dream literature, but not cited explicitly in this paper.
  • domain assumption The composition of Y+ operators can be reordered using commutativity of distant ladder operators (Proposition 4.3).
    Stated and proved in the paper, but relies on the geometric intuition that ladder moves are column-local.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Pipe Dream Rectification and Dual RSK Correspondence." pith.science (2026). https://pith.science/paper/XL2REFFM

@misc{pith2026260823530,
  author       = {Pith},
  title        = {Pith review of: Pipe Dream Rectification and Dual RSK Correspondence},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XL2REFFM}},
  note         = {Machine review of arXiv:2608.23530}
}
abstract

We prove Dennin's conjecture (Conjecture 8.9 of arXiv:2506.21052) that his variant of dual RSK correspondence is symmetric when restricted to biGrassmannian permutations. For a binary matrix $A$, let $A^\dagger$ denote its transpose-complement, and let $\operatorname{ins}(A)$ and $\operatorname{rec}(A)$ denote its insertion and recording tableaux. We prove that $\operatorname{ins}(A^\dagger) = \overline{\operatorname{rec}(A)}$, where the bar denotes the natural complement of the recording tableau. Our proof uses rectification of super pipe dreams and a downward induction on suffixes of $A$.

Figures

Figures reproduced from arXiv: 2608.23530 by the authors.

Figure 1
Figure 1. Reduced Pipe Dreams for Permutation w = 2143 The weight of a pipe dream P is wt(P) := Q p -tile xrow(p) . In addition, let |P| denote the number of crossings in P. For a permutation w, its β-Grothendieck polynomial is G (β) w (x) = X P ∈P D+(w) β |P|−ℓ(w) wt(P), where P D+(w) is the set of not-necessarily-reduced pipe dreams with permutation w, and ℓ(w) is the length of w. Observe that the contribution of a pipe dre… view at source ↗
Figure 2
Figure 2. A super pipe dream The two colors are related by transposition: locally, the behavior of a red checker is the transpose of the corresponding behavior of a black checker. This symmetry motivates the following operations. For a super pipe dream P = (Px, Py), define Complement: P := (Py, Px), Transpose: P t := (P t x , Pt y ), Adjoint: P † := (P t y , Pt x ). In particular, P † = P t = Pt . Let A = (Aij ) ∈ BMm×n be a … view at source ↗
Figure 3
Figure 3. The super pipe dream associated with the binary matrix [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (17 more)
Figure 4
Figure 4. Figure 4: Types of Ladder Moves For i ∈ Z, we define Y + ≥i := Y + i Y + i+1Y + i+2 · · · . When applied to a fixed super pipe dream, Y + ≥i is a finite composition. It moves all red checkers in columns weakly to the right of i one column to the right. We also define Y + := · · …
Figure 5
Figure 5. Figure 5: Illustration of Y + ≥3 [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: Illustration of Y + Repeated applications of Y + eventually separate the red and black components of a super pipe dream. More precisely, for a super pipe dream P, choose N sufficiently large so that, in P ′ = (Y +) N P, all red checkers lie northeast of all black check…
Figure 7
Figure 7. Figure 7: Example of pipe dream rectification. 6 [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]
Figure 8
Figure 8. Figure 8: Reduced Pipe Dream V in tab(V ) In other words, the entries corresponding to the crossings along a fixed horizontal pipe form a row of tab(V ), and each crossing is recorded by its row index in the pipe dream. The resulting tableau is weakly decreasing along rows and s…
Figure 9
Figure 9. Figure 9: Exact Rectification and Insertion of A 2.4 Complementary and full tableaux Let T be a tableau created by some A ∈ BMm×n. Define T to be the full tableau if T has dimensions m × n with each row containing en￾tries i ∈ [n] and each column containing entries j ∈ [m], arra…
Figure 10
Figure 10. Figure 10: Rectification and Tableaux of A′ 3 Similarly, one can check that we also have rec(A3) = 3 3 3 = T3. 9 [PITH_FULL_IMAGE:figures/full_fig_p009_10.png]
Figure 11
Figure 11. Figure 11: Rectification and Tableaux of R′ 3 Hence, we do have rec(A3) = ins(R3). Now we continue to A2 and R2 [PITH_FULL_IMAGE:figures/full_fig_p010_11.png]
Figure 12
Figure 12. Figure 12: shows that ins(A′ 2 ) = 4 3 3 1 2 . Using the definition of rec(), since number(Ti−1 \ Ti) = i − 1 and shape(Ti) = shape ins(A′ i ) t , we have T2 = 3 3 3 2 2 [PITH_FULL_IMAGE:figures/full_fig_p010_12.png]
Figure 13
Figure 13. Figure 13: Rectification and Tableaux of R′ 2 Therefore, rec(A2) = ins(R2). Observe that to get from rec(A3) to rec(A2), we added only blocks of 2’s and the shape of the 3’s remain the same. This is because we added the second column which can only add 2’s to the recording table…
Figure 14
Figure 14. Figure 14: Rectification and Tableaux of A′ 1 On the other hand, [PITH_FULL_IMAGE:figures/full_fig_p011_14.png]
Figure 15
Figure 15. Figure 15: Rectification and Tableaux of R′ 2 Therefore, rec(A1) = ins(R1), meaning rec(A) = ins(R). By Theorem 4.13, the base case is true. By Theorem 4.14 the induction step is true. Hence, the conjecture is true and we have rec(A) = ins(A† ) ∀A ∈ BMm×n. 4 Proof of main theore…
Figure 16
Figure 16. Figure 16: Illustration of a reference like Proposition 4.2 [PITH_FULL_IMAGE:figures/full_fig_p013_16.png]
Figure 17
Figure 17. Figure 17: Illustration of Y + ≥2Y + ≥1P1,2 [PITH_FULL_IMAGE:figures/full_fig_p015_17.png]
Figure 18
Figure 18. Figure 18: Illustration of Y +2 1 Y +3 2 P1,2 Example 4.1. Here we can see that both figure 17 and figure 18 uses P1,2. While figure 17 uses Y + ≥2Y + ≥1P1,2 and figure 18 uses Y +2 1 Y +3 2 P1,2, they both give the same rectified pipe dream at the end. Let 0m×n =    0 · · · …
Figure 19
Figure 19. Figure 19: Rectification of A′ i [PITH_FULL_IMAGE:figures/full_fig_p017_19.png]
Figure 20
Figure 20. Figure 20: Rectification of Ai We can see that columns 1 through 3 in frame three of 20 shows Mi and rectifying Mi performed the last Y +3 1 move for Ai , therefore giving V ∗ i = Vi . For a binary column Cj of a matrix A ∈ BMm×n, define its associated column tableau by Cj := {r…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 15 canonical work pages

  1. [1]

    Cauchy identities for Grothendieck polynomials and a dual RSK correspondence through pipe dreams

    Cauchy identities for Grothendieck polynomials and a dual RSK correspondence through pipe dreams , author=. arXiv preprint arXiv:2506.21052 , year=

    work page Pith review arXiv

  2. [2]

    , TITLE =

    Knuth, Donald E. , TITLE =. Pacific J. Math. , FJOURNAL =. 1970 , PAGES =

    work page 1970

  3. [3]

    Robinson, G. de B. , TITLE =. Amer. J. Math. , FJOURNAL =. 1938 , NUMBER =. doi:10.2307/2371609 , URL =

    work page doi:10.2307/2371609 1938

  4. [4]

    [SÚ12] Joshua Sack and Henning Úlfarsson

    Schensted, C. , TITLE =. Canadian J. Math. , FJOURNAL =. 1961 , PAGES =. doi:10.4153/CJM-1961-015-3 , URL =

    work page doi:10.4153/cjm-1961-015-3 1961

  5. [5]

    , TITLE =

    Stanley, Richard P. , TITLE =. [2024] 2024 , PAGES =

    2024

  6. [6]

    Selecta Math

    Bufetov, Alexey and Matveev, Konstantin , TITLE =. Selecta Math. (N.S.) , FJOURNAL =. 2018 , NUMBER =. doi:10.1007/s00029-018-0442-y , URL =

    work page doi:10.1007/s00029-018-0442-y 2018

  7. [7]

    Frieden, Gabriel and Schreier-Aigner, Florian , TITLE =. S\'em. Lothar. Combin. , FJOURNAL =. 2024 , PAGES =

    2024

  8. [8]

    and Stanley, Richard P

    Sagan, Bruce E. and Stanley, Richard P. , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 1990 , NUMBER =. doi:10.1016/0097-3165(90)90066-6 , URL =

    work page doi:10.1016/0097-3165(90)90066-6 1990

Show all 17 references
  1. [9]

    Duke Math

    Corwin, Ivan and O'Connell, Neil and Sepp\"al\"ainen, Timo and Zygouras, Nikolaos , TITLE =. Duke Math. J. , FJOURNAL =. 2014 , NUMBER =. doi:10.1215/00127094-2410289 , URL =

    2014 doi

  2. [10]

    Aigner, Florian and Frieden, Gabriel , TITLE =. Int. Math. Res. Not. IMRN , FJOURNAL =. 2022 , NUMBER =. doi:10.1093/imrn/rnab083 , URL =

    2022 doi

  3. [11]

    , TITLE =

    Fomin, Sergey and Kirillov, Anatol N. , TITLE =. Formal power series and algebraic combinatorics/. sd , MRCLASS =

  4. [12]

    , TITLE =

    Fomin, Sergey and Kirillov, Anatol N. , TITLE =. Discrete Math. , FJOURNAL =. 1996 , NUMBER =. doi:10.1016/0012-365X(95)00132-G , URL =

    1996 doi

  5. [13]

    Experiment

    Bergeron, Nantel and Billey, Sara , TITLE =. Experiment. Math. , FJOURNAL =. 1993 , NUMBER =

    1993

  6. [14]

    Knutson, Allen and Miller, Ezra , TITLE =. Ann. of Math. (2) , FJOURNAL =. 2005 , NUMBER =. doi:10.4007/annals.2005.161.1245 , URL =

    2005 doi

  7. [15]

    Lascoux, Alain and Sch\"utzenberger, Marcel-Paul , TITLE =. C. R. Acad. Sci. Paris S\'er. I Math. , FJOURNAL =. 1982 , NUMBER =

    1982

  8. [16]

    Invariant theory (

    Lascoux, Alain and Sch\"utzenberger, Marcel-Paul , TITLE =. Invariant theory (. 1983 , ISBN =. doi:10.1007/BFb0063238 , URL =

    1983 doi

  9. [17]

    Lascoux, Alain , TITLE =. C. R. Acad. Sci. Paris S\'er. I Math. , FJOURNAL =. 1982 , NUMBER =

    1982

Pith tools

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