{"id":"73917004-5ce7-40f8-bc63-a1d3482f81a0","arxiv_id":"2411.08412","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"In any two-step puzzle, the numbers of 7-labels and soft crossings are determined solely by the boundary 012 strings via the closed formulas in Corollary 2.6.","lead":"The paper proves a formula that counts two types of crossing configurations inside two-step puzzles using only the labels on the puzzle boundary. If correct, it gives puzzle and Schubert calculus researchers a simple boundary-only invariant for internal crossing structure.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 4.7's reduction to a reduced color map is unsupported when p=1: Lemma 4.6 is stated only for p≥2, yet the proof invokes it to eliminate b1 on a p=1 map.","rationale":"The reader's weakest_assumption identifies exactly the same gap: Lemma 4.6 is invoked outside its p≥2 hypothesis in Proposition 4.7. I agree that this is the most load-bearing issue because the base case of the induction and the edge-count invariant M depend on it. I do not think the gap forces rejection: the formula itself is plausible, the rest of the proof is detailed, and the missing step may be repairable by an explicit p=1 lemma using the Figure 7 replacement. Thus the appropriate verdict remains CONDITIONAL, which is what the reader already assigned, so no change is needed. My concrete test would determine whether the p=1 step is merely misdescribed or actually impossible.","tokens_in":90,"tokens_out":12771,"duration_ms":184959,"concrete_test":"Enumerate all color maps on E_n with n=3, n0=2, n1=1, boundaries ∂2=(0,0,1) and ∂0=(1,0,0), so p=1 and b1=1. Use a backtracking solver over the four tile types to find every valid map. For each map, attempt to apply the sequence of Figure 7 replacements required by Proposition 4.7: the first replacement should remove the initial 1 on ∂0, and after b1·n0=2 replacements the boundary should become ∂0=(0,0,1) with m/s counts shifted by +2/−2. If no such valid sequence exists, Proposition 4.7 is false as stated; if one exists, the gap is a missing lemma rather than a false claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proof of Theorem 2.5 for G(C,2)=0 depends on Proposition 4.7, which reduces C to a reduced color map with p=1 and b1=0. After applying Lemma 4.6 until p=1, the proposition continues: 'If the resulting color map C̃ has b1(C̃) ≥ 1, apply Lemma 4.6 a number of times equal to n0 so that the obtained color map C′ has x1(C̃)=0.' This step is not available: Lemma 4.6 is explicitly stated under the hypothesis p(C) ≥ 2, and its conclusion decreases p by 1 by merging the last two blocks. With p=1 there is no block rp−1 to merge, so applying the lemma even once is impossible. The claimed removal of b1(C̃)n0 3-edges and addition of equally many m-edges is therefore not justified by any previously defined move. Since Proposition 4.7 is the sole bridge between the structure lemma (4.5) and the explicit count in reduced maps (Proposition 4.11), the base case G(C,2)=0 of the induction is incomplete. The gap is substantive: the formula for M = n0n1 − G(C,0) includes the final b1(C̃)n0 term, so without a separate argument for the p=1 case the proof does not establish the theorem even in the base case.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies color maps, tilings of the triangular lattice by edge-labeled tiles, obtained from two-step puzzles. The main result, Theorem 2.5, gives formulas for the numbers of m-colored and 3-colored edges in a color map in terms of three boundary statistics G(C,0), G(C,1), G(C,2), which depend only on the boundary colors. Corollary 2.6 translates this into formulas for the number of labels 7 and the number of soft crossings in a two-step puzzle. The proof strategy is to reduce the case G(C,2)=0 to reduced color maps using local replacements and arrow reversals, count explicitly in reduced maps via non-intersecting paths, and then handle the general case by induction using gash propagation.","tokens_in":15177,"tokens_out":5404,"duration_ms":55282,"significance":"If the proof is completed, the paper gives a striking boundary-only formula for interior crossing counts in two-step puzzles, with no fitted parameters or auxiliary data. The color-map theorem is self-contained except for the translation step in Corollary 2.6, and the explicit path-counting in Proposition 4.11 is a concrete, checkable combinatorial statement. The result is of clear interest to the Schubert calculus and puzzle combinatorics community. The main weakness is that several reduction steps are justified by pictures and local assertions rather than by complete formal arguments, and one of those steps, in Proposition 4.7, contains a genuine gap in the stated proof.","major_comments":[{"comment":"The reduction of a color map with G(C,2)=0 to a reduced color map is incomplete for the case p=1. Lemma 4.6 is stated under the hypothesis p(C) ≥ 2 and its proof merges the last two blocks, decreasing p by 1. Proposition 4.7 first applies Lemma 4.6 'until p=1' and then, if the resulting map has b1 ≥ 1, says to 'apply Lemma 4.6 a number of times equal to n0' so that b1 becomes 0. When p=1 there is no second block to merge, so the cited lemma cannot be applied even once. The claimed removal of b1 n0 edges of color 3 and the corresponding addition of m-colored edges is therefore not justified by any previously defined move. Since Proposition 4.7 is the bridge between the structural Lemma 4.5 and the explicit count in Proposition 4.11, the base case G(C,2)=0 of the induction in Theorem 2.5 is not established as written.","section":"4.1, Proposition 4.7"},{"comment":"The global validity of the arrow-reversal moves is asserted rather than proved. In Lemma 4.3 the proof relies on the statement that 'reversing an arrow between endpoints x and x+ℓ+1 does not modify the colors of the edges e having origin y such that y0 ≥ x0', but no proof of this invariance is supplied. Lemma 4.6 similarly describes a sequence of replacements and arrow reversals that is only illustrated in Figures 8–12, without a formal verification that the resulting map is a color map and that the claimed equality p(φ(C)) = p or p−1 holds in all cases of the boundary data. These transformations are load-bearing for Proposition 4.7, so a complete proof should state the exact region affected by each move and prove that colors outside that region are unchanged.","section":"4.1, Lemmas 4.3 and 4.6"}],"minor_comments":[{"comment":"The expression 'x1(\\tilde C)=0' appears to be a typo for 'b1(\\tilde C)=0'; as written, x1 is not defined in that context.","section":"4.1, Proposition 4.7"},{"comment":"The translation from color maps to two-step puzzles depends on the bijection of the author's prior preprint [7]. Since that reference is not yet published and is a self-citation, the paper should state explicitly which results of [7] are used and confirm that they are proven there rather than assumed.","section":"2, Corollary 2.6"},{"comment":"In the statement of Corollary 5.6 the notation 'n(j), n(j)' repeats the same symbol; one of the two quantities should be distinguished, for instance by writing n_+(j) and n_-(j) for direct and reverse triangular faces.","section":"5, Corollary 5.6"},{"comment":"The proof of Lemma 4.6 is entirely visual. A short formal description of the sequence of replacements, including the coordinates of the vertices involved and the colors of all modified edges, would substantially improve verifiability.","section":"4.1, Lemma 4.6"}],"recommendation":"major_revision","confidential_remarks":"The main formula is attractive and the overall approach is plausible. The gap in Proposition 4.7 seems fixable, for example by proving a variant of Lemma 4.6 for p=1 that eliminates b1 while preserving the counting identities, but as it stands the base case of the induction is not fully proved. I would encourage the editor to send the paper back for a focused revision rather than to reject it, because the rest of the argument is coherent and the central claim is likely correct."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper gives a new formula for the number of 7-labels and soft crossings in two-step puzzles, depending only on boundary strings. That statement is genuinely new and the color-map machinery is mostly convincing. But there is a real hole in the reduction argument in Proposition 4.7, and the proof of the main theorem is incomplete as written.\n\nWhat is good: the formula has no fitted parameters and the derivation is essentially self-contained. The use of color maps is natural, and the reduced-map analysis in Section 4.2 is the strongest part: after reduction, counting m and 3 edges becomes a problem about non-intersecting paths, yielding clean expressions and a determinantal count of reduced maps. The gash propagation in Section 5 extends Buch's mutations in a sensible way and the induction over G(C,2) is coherent if the base case works. The self-citation to [7] is not circular: Theorem 2.5 is proved directly for color maps, and Corollary 2.6 follows from the bijection.\n\nThe soft spot is specific and load-bearing. Proposition 4.7 reduces a color map with G(C,2)=0 to a reduced one by applying Lemma 4.6 repeatedly. After reaching p=1, the proof says that if b1≥1, apply Lemma 4.6 again n0 times. But Lemma 4.6 is explicitly stated for p(C)≥2 and its operation merges the last two blocks; with p=1 there is no r_{p-1} to merge. The claimed removal of b1(C)n0 3-edges and addition of the same number of m-edges is not justified by any defined move. Since the base case of the induction in Theorem 2.5 rests entirely on Proposition 4.7, the proof does not currently establish the theorem even when G(C,2)=0. I do not think this is fatal—there are likely ways to reduce b1 at p=1 using the same arrow-reversal or replacement ideas, but the argument must be supplied. The reader's conditional verdict is fair, and the stress-test note correctly identifies the gap.\n\nThere are also minor presentation issues: several local moves (arrow reversal, gash removal) are justified by figures rather than formal invariants, and the claim in Lemma 4.5 that arrow reversals only affect edges with e1≥x1 is asserted. These are cosmetic compared to the p=1 gap, but should be tightened.\n\nWho is this for: specialists in combinatorial Schubert calculus, especially people working with puzzles for two-step flag varieties. The formula is useful and likely correct. I would send this to a serious referee, with a request to address the p=1 case and to formalize the local moves. If those are fixed, the paper makes a solid contribution.","headline":"New boundary-only formula for crossing counts in two-step puzzles, with a genuine but likely fixable gap in the p=1 reduction step.","tokens_in":15701,"tokens_out":3114,"would_cite":false,"duration_ms":32019,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A15","05E14","14M15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The number of label-7 crossings and soft crossings in a two-step puzzle is fixed by the three boundary strings alone.","keywords":["two-step puzzles","color maps","Schubert calculus","triangular lattice tilings","crossing enumeration","gash numbers","two-step flag varieties"],"falsifier":"Enumerate all color maps on a small triangular lattice, say $n=3$, for a fixed boundary with $n_0$ zeros and $n_1$ ones per side, and check whether every one satisfies $m(C)=G(C,0)+G(C,1)+G(C,2)-n_0n_1$ and $s(C)=2n_0n_1-G(C,0)-G(C,1)-G(C,2)$. Because the tiling set is finite, one boundary admitting two color maps with different $m$ or $s$ counts would disprove the theorem.","tokens_in":14673,"feed_emoji":"🧩","tokens_out":13276,"duration_ms":123102,"temperature":0.7,"pith_summary":"This paper proves that the number of crossings of either type inside a two-step puzzle is determined solely by the three 012 strings on the puzzle boundary. Two-step puzzles are tilings that compute Schubert structure constants of two-step flag varieties, and inside them the 0 and 1 boundary lines cross in two ways: hard crossings, recorded by the label 7, and soft crossings, the composed pieces containing a 3 label and any number of 2 labels. For boundary strings $u$, $v$, $w$ with $n_0$ zeros and $n_1$ ones each, the two counts are $G(u)+G(v)+G(w)-n_0n_1$ and $2n_0n_1-G(u)-G(v)-G(w)$, where $G(u)$ counts, for each zero position $i$ in $u$, the number of ones among positions $1$ through $i$. Because the formula never refers to a particular tiling, any two puzzles sharing a boundary have the same number of each crossing type. The proof translates puzzles into color maps and uses local moves called gashes to reduce the count to the boundary cases.","feed_headline":"Boundary strings alone determine puzzle crossing counts","feed_subtitle":"One formula counts both crossing types from three boundary strings, so the interior tiling never changes the numbers.","key_machinery":"The carrying object is a color map, a tiling of the triangular lattice by edge-labeled tiles whose allowed face patterns are $(0,0,0)$, $(1,1,1)$, $(1,0,3)$ and $(0,1,m)$ up to rotation; the 3 and m edges are the ones that record crossings. The proof is carried by the gash numbers $G(C,l)$ of the three boundary sides together with a local operation called a gash, a pair of same-type edges colored 0 and 1 that can be propagated through the map by six local rules and then removed at a terminal configuration. A propagation step lowers $G(C,2)$ by exactly one and changes $G(C,1)$, the m-count and the 3-count in a controlled way, so the main identity is proved by induction on $G(C,2)$. The base case reduces every color map to a canonical reduced form, where the remaining 3 and m edges organize into nonintersecting paths; counting horizontal and vertical steps of those paths yields the explicit formula.","core_discovery":"The central claim of the paper is Theorem 2.5: for any color map $C$ on the triangular lattice of size $n$ with $n_0$ edges of color 0 and $n_1$ edges of color 1 on each of the three boundary sides, the number $m(C)$ of m-colored edges is $G(C,0)+G(C,1)+G(C,2)-n_0n_1$ and the number $s(C)$ of 3-colored edges is $2n_0n_1-G(C,0)-G(C,1)-G(C,2)$. The statistic $G(C,l)$ is the gash number of side $l$: the sum over 0-colored boundary edges $e$ of the number of 1-colored boundary edges lying closer to the corner. Corollary 2.6 then transfers the statement to two-step puzzles through the bijection of [7]: m-colored edges become label-7 pieces, 3-colored edges become soft crossings, and the gash numbers become the string statistics $G(u)$, $G(v)$, $G(w)$. Thus the interior crossing counts are forced by the boundary, with no reference to the particular tiling.","pith_inferences":["A testable extension would be to check whether an equivariant or quantum version of two-step puzzles keeps this boundary-only structure; the proof here treats the unweighted count, and equivariant weights typically add geometric terms that could break the simple formula.","The fact that $m(C)+s(C)=n_0n_1$ means the two crossing types are complementary ways of reading the same 0/1 line arrangement; a geometric interpretation of the difference $n(P,7)-n(P,sc)$ on the two-step flag variety may be worth pursuing.","Because the proof reduces color maps to nonintersecting path configurations, the same reduction could give enumerative formulas for puzzles with fixed boundaries, and possibly new bijections between color maps and other path models in Schubert calculus."],"forward_implications":["Every two-step puzzle with a given boundary has exactly the same number of label-7 crossings and exactly the same number of soft crossings; no information about the interior is needed.","The two counts can be computed in linear time by scanning the three boundary strings once, rather than enumerating tilings.","Because the two formulas sum to $n_0n_1$, the total number of crossings of both kinds is fixed once the number of zeros and ones on the boundary is known.","The companion Corollary 5.6 gives that every color map with $n_0$ and $n_1$ boundary colors has exactly $n_0(n_0+1)/2$ and $n_0(n_0-1)/2$ direct and reverse faces with all edges colored 0, and likewise for color 1, so those face counts are also boundary-determined."],"supporting_citations":[{"why":"It provides the bijection between two-step puzzles and color maps under which label-7 pieces become m edges, soft crossings become 3 edges, and the boundary string statistics become the gash numbers.","marker":"[7]"},{"why":"It defines the two-step puzzles, their boundary 012 strings, and the composed pieces whose label 7 and soft crossings are being counted.","marker":"[3]"},{"why":"It introduces the mutations and gash-like local moves on two-step puzzles that the gash propagation and removal rules of Section 5 adapt to color maps.","marker":"[1]"}],"fun_headline_variants":["Crossing counts in puzzles come straight from the edges","Interior tiling never affects puzzle crossing totals","Boundary strings fully determine both crossing types","Two-step puzzle crossings are fixed by the border alone","From three boundary strings, all crossing numbers follow"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof's load-bearing premise is that the local reductions and arrow reversals in Section 4 always leave the boundary data that feed the formula unchanged, and that the final step collapsing the reduced map to one block is valid; this last step is asserted more briefly than the lemma it relies on.","fun_headline_variants_meta":{"raw":{"variants":["Crossing counts in puzzles come straight from the edges","Interior tiling never affects puzzle crossing totals","Boundary strings fully determine both crossing types","Two-step puzzle crossings are fixed by the border alone","From three boundary strings, all crossing numbers follow"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000235,"raw_usage":{"total_tokens":1463,"prompt_tokens":872,"completion_tokens":591,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":488,"completion_tokens_details":{"reasoning_tokens":519}},"tokens_in":488,"tokens_out":591,"duration_ms":6184,"temperature":1.0,"reasoning_tokens":519,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T21:39:32.013712+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all color maps on a small triangular lattice, say $n=3$, for a fixed boundary with $n_0$ zeros and $n_1$ ones per side, and check whether every one satisfies $m(C)=G(C,0)+G(C,1)+G(C,2)-n_0n_1$ and $s(C)=2n_0n_1-G(C,0)-G(C,1)-G(C,2)$. Because the tiling set is finite, one boundary admitting two color maps with different $m$ or $s$ counts would disprove the theorem.","supporting_citations":[{"cited_title":"Positive formula for the product of conjugacy classes on the unitary group","cited_arxiv_id":"2405.06723","evidence_quote":"It provides the bijection between two-step puzzles and color maps under which label-7 pieces become m edges, soft crossings become 3 edges, and the boundary string statistics become the gash numbers."},{"cited_title":"The puzzle conjecture for the cohomology of two-step flag manifolds","cited_arxiv_id":null,"evidence_quote":"It defines the two-step puzzles, their boundary 012 strings, and the composed pieces whose label 7 and soft crossings are being counted."},{"cited_title":"Mutations of puzzles and equivariant cohomology of two-step flag varieties","cited_arxiv_id":null,"evidence_quote":"It introduces the mutations and gash-like local moves on two-step puzzles that the gash propagation and removal rules of Section 5 adapt to color maps."}],"review_version":1}