{"id":"57669083-6551-42cd-9e56-3d578cad0abb","arxiv_id":"1908.05748","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The walls of the G-Hilb chamber for finite abelian G in SL3(C) are exactly: Type I walls from (-1,-1)-curves, Type III walls from generalised long sides, and Type 0 walls from exceptional divisors, with all inequalities computed by the unlocking procedure.","lead":"Working with finite abelian groups acting on three-dimensional space, this paper gives an explicit combinatorial recipe for writing down all inequalities that define the chamber of stability parameters associated to the G-Hilbert scheme, and it identifies which of those inequalities are actual walls. The recipe uses a labeling of exceptional curves and divisors, called Reid's recipe, and turns abstract existence results from Craw and Ishii into checkable lists.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.17's wall classification depends on Algorithm 3.3, whose proof is omitted for Type Ic curves (§3.5.4) and only sketched for boundary curves (§3.6); the central claim is therefore not fully established.","rationale":"The reader's weakest assumption identifies the same load-bearing concern: the proof of Algorithm 3.3 is incomplete for Type Ic curves and only sketched for boundary curves. The paper's own text explicitly flags the Type Ic omission in Section 3.5.4, and the boundary-curve argument in Section 3.6 is acknowledged as a sketch. Since Propositions 1.2, 4.1, 4.2, and Theorem 4.17 all depend on the total G-igsaw piece being correctly computed by Algorithm 3.3 for every exceptional curve, the strongest claim is not fully established. The Craw-Ishii inequalities may well be correct, and the examples are consistent with the algorithm, but the missing proof is a genuine proof obligation for the classification. A computational check can test for counterexamples, but it cannot replace the omitted proof, so the appropriate verdict remains conditional rather than full acceptance.","tokens_in":29506,"tokens_out":3711,"duration_ms":37261,"concrete_test":"Write a script that, for every finite abelian G in a list containing all groups with a meeting-of-champions triangle of positive side length (starting with G = 1/25(1,3,21) and G = 1/35(1,3,31)), constructs the Craw-Reid triangulation, computes G-igp(C) for every Type Ic and boundary curve directly from Nakamura's G-igsaw transformation on the two adjacent torus-invariant G-clusters, and compares the result with the output of Algorithm 3.3. If any character set differs, Theorem 4.17 is false as stated; if all agree, the omitted proof remains a proof obligation, but the risk of a concrete counterexample is eliminated.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim is the complete wall description of C0 in Theorem 4.17. Every curve inequality (Propositions 1.2, 4.1, 4.2) and every quotient inequality (Proposition 2.6) is written in terms of G-igp(C), computed by Algorithm 3.3. The algorithm is therefore load-bearing: a single configuration where the unlocking procedure gives the wrong set of characters would change the stated inequalities and could change whether an inequality is redundant, hence the wall list.\n\nThe proof of Algorithm 3.3 is complete for Type Iy curves, and Type Ix and Iz are reduced to explicit counting and divisibility arguments. Section 3.5.4 says for Type Ic curves ('meeting of champions') only 'For brevity we omit it' after asserting that minor notational changes suffice. Meeting-of-champions triangles with positive side length do occur, for example G = 1/25(1,3,21) in Example 4.16 has side length 2, so Type Ic curves are not an empty degenerate case. Section 3.6 for boundary curves is also a sketch: it uses 'one can check', says 'variations of the arguments above work just as well for the cases not depicted', and concludes 'counting up all these monomials and comparing them with a socle calculation shows' that the algorithm is valid, without writing the omitted counts or divisor cases. Thus the proof that G-igp(C) is correct for every exceptional curve is not supplied.\n\nThis is not an internal inconsistency or a challenge to the Craw-Ishii abstract inequalities; it is an explicit gap in the justification of the claimed combinatorial unpackaging and of the wall classification built on it.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper addresses the chamber C0 in the stability space defining G-Hilb A^3 for a finite abelian subgroup G of SL(3,C). The author proposes a combinatorial 'unlocking procedure' (Algorithm 3.3) that computes the total G-igsaw piece G-igp(C) for each exceptional curve from the data of Reid's recipe, and then uses these pieces to write explicit inequalities for C0 (Propositions 1.2, 2.6, 4.1, 4.2). The main classification is Theorem 4.17: the walls of C0 are Type I walls for p-1,-1-curves, Type III walls for generalized long sides, Type 0 walls for irreducible exceptional divisors, and Type 0 walls from rigid quotients. The paper also gives several worked examples, including G = 1/30(25,2,3), G = 1/35(1,3,31), and G = 1/25(1,3,21).","tokens_in":29854,"tokens_out":4887,"duration_ms":46843,"significance":"If the central claim is fully established, this paper provides a valuable explicit combinatorial description of the chamber C0 and of the birational types of its walls, converting the abstract Craw-Ishii inequalities into concrete formulas that can be read off a triangulation. The treatment is not circular: the G-igsaw computations are checked against external inputs such as Craw's Theorem 2.4, Nakamura's Unique Valley Lemma, and the Craw-Ishii inequalities, and the worked examples reproduce known redundancies and wall types. The main weakness is that the proof of Algorithm 3.3 is incomplete for two classes of curves, and those cases are needed for the wall classification. The paper is therefore promising and likely correct, but the central claim is not yet fully supported in the present text.","major_comments":[{"comment":"The validity of Algorithm 3.3 for Type Ic curves, those inside a meeting-of-champions triangle, is asserted with the sentence 'For brevity we omit it.' This is not an empty case: Example 4.16, with G = 1/25(1,3,21), has a meeting-of-champions triangle of side length 2, and such triangles contain Type Ic p-1,-1-curves. Since G-igp(C) computed by Algorithm 3.3 is used in every curve inequality (Propositions 1.2, 4.1, 4.2) and hence in the wall classification of Theorem 4.17, the omitted argument is load-bearing and should be supplied in full.","section":"§3.5.4"},{"comment":"The proof that Algorithm 3.3 is valid for boundary curves is only a sketch. Key steps are supported by phrases such as 'one can check', 'variations of the arguments above work just as well for the cases not depicted', and 'counting up all these monomials and comparing them with a socle calculation shows' that the algorithm is valid, without the actual checks or counts being written. Boundary curves are needed for the Type III classification in Section 4.6 and therefore for Theorem 4.17, so this gap directly affects the central claim.","section":"§3.6"},{"comment":"The necessity argument for Type I walls is not fully justified. After Eq. (4.1), the proof asserts that any other inequality featuring the character chi cannot be a summand of (4.1), based on informal observations about other chi-curves and about divisors along the chi-chain. This is a key step: without it, Proposition 4.4 does not establish that every p-1,-1-curve gives a wall of C0. A complete case analysis is needed here.","section":"§4.3, Proposition 4.4"},{"comment":"The final paragraph of Section 4.7 says that 'the unlocking procedure allows the check of which walls from rigid quotients are necessary to be performed combinatorially', but the actual criterion is not provided in the paper. Since Theorem 4.17 asserts that each remaining wall is of Type 0 and comes from a rigid quotient, the statement is incomplete without either an explicit criterion or a precise reference to where such a criterion is proved.","section":"§4.7"}],"minor_comments":[{"comment":"In the formula for a p1,-3-curve, the displayed expression ends with '= 0', but it should evidently be '> 0' as in Proposition 4.2.","section":"Proposition 1.2"},{"comment":"In the sentence 'Mark the curve C with the character by whichG acts on m1', there is a missing space between 'which' and 'G'.","section":"§2.2"},{"comment":"In the sentence 'where we classify the p0,-2q-curves producing those walls', the notation 'p0,-2q' does not match the notation used elsewhere, such as 'p-2,0q-curves' in the introduction; please make the notation consistent.","section":"§4.3"},{"comment":"In the inequality labeled (B6), the terms '2 theta16' and '4 theta26' appear twice; this looks like a typesetting error and should be corrected.","section":"Example 4.6"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is likely salvageable: the overall approach is coherent and the examples strongly support the claimed classification. The single serious obstruction is the incomplete proof of Algorithm 3.3 for Type Ic and boundary curves, which is explicitly load-bearing for Theorem 4.17. If the author fills those gaps, the paper would be suitable for publication. I see no evidence of circularity or fabricated inputs."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The first thing to know: this is the first genuinely combinatorial way to write down the walls of C0 for G-Hilb A3. The unlocking procedure (Algorithm 3.3) is new, and Theorem 4.17 turns Craw–Ishii's abstract inequalities into a finitely checkable wall list with wall types. It is a serious paper with a real gap that should be fixed, not a reason to reject.\n\nWhat is good: the algorithm is well motivated, and the paper validates it extensively against known results and examples. The Craw–Ishii inequalities are reproduced by a direct machine, and the worked examples for 1/30(25,2,3), 1/35(1,3,31), and 1/25(1,3,21) give real confidence. No fitting of constants, no circularity; citation patterns look healthy. The stress-test note correctly identifies the key gap.\n\nWhere it is soft: the proofs of the load-bearing algorithm are uneven. The author proves Type Iy fully, gives detailed counting for Type Ix and Iz, then omits Type Ic entirely in Section 3.5.4 with \"For brevity we omit it.\" That case is not empty: Example 4.16 is exactly a meeting of champions of side length 2. The boundary-curve case in Section 3.6 is also a sketch, relying on \"one can check\" and \"variations of the arguments above.\" Because every curve inequality and every quotient inequality uses G-igp(C), a single wrong unlock would change the wall list. I think the algorithm is probably right—the examples are too consistent for it to be wrong—but the current text does not establish it.\n\nThe other soft spot is Proposition 4.4, the necessity of Type I walls. The decomposition argument is reasonable, but the sentence saying other χ-curves always feature a different character in their G-igsaw piece and consequently cannot be summands is asserted more than proved. It may be true, but it needs a case check. Minor issue: some long inequalities in Example 4.6 have repeated characters (θ26 and θ16 appear twice in B6), presumably typographical.\n\nBottom line: Theorem 4.17 is probably correct, but as written it is not fully established. I would send it to a serious referee anyway; the gap is localized and likely easy to fix. This is exactly the kind of paper that deserves referee time: important to the McKay correspondence, explicit and checkable, and close enough that minor revision could make it definitive.","headline":"A genuinely combinatorial way to write down the walls of C0 for G-Hilb A3, with a clean wall classification; the main gap is that the proof of the load-bearing algorithm omits the meeting-of-champions case and only sketches boundary curves.","tokens_in":30355,"tokens_out":3283,"would_cite":true,"duration_ms":33208,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14E16","14M25","16G20"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that the chamber of stability parameters defining the G-Hilbert scheme for a finite abelian subgroup of SL(3,C) can be described explicitly by finitely many inequalities computed from Reid's recipe, with each wall's…","keywords":["wall-crossing","McKay correspondence","Reid's recipe","G-Hilbert scheme","G-igsaw pieces","crepant resolutions","toric geometry","stability space"],"falsifier":"Take a finite abelian group whose triangulation of the junior simplex has a meeting-of-champions triangle of positive side length (for example $G=\\frac{1}{25}(1,3,21)$), choose an exceptional curve inside that triangle, and compare the set of characters produced by the unlocking procedure with the set of characters whose tautological line bundles restrict non-trivially to that curve (equivalently, the characters appearing in the monomial ideals of the two adjacent $G$-clusters). Any disagreement would falsify Algorithm 3.3 and hence the wall inequalities of Theorem 4.17.","tokens_in":29322,"feed_emoji":"🧩","tokens_out":11718,"duration_ms":94556,"temperature":0.7,"pith_summary":"This paper gives a purely combinatorial way to write down the chamber of stability parameters whose moduli space is the $G$-Hilbert scheme of $\\mathbb{A}^3$ for a finite abelian group $G\\subset \\mathrm{SL}(3,\\mathbb{C})$. The input is Reid's recipe, the marking of exceptional curves and divisors in $G\\text{-Hilb}\\,\\mathbb{A}^3$ by characters of $G$, together with the combinatorics of the exceptional fibre. The central tool is the unlocking procedure, which computes for every exceptional curve the characters appearing in its total $G$-igsaw piece; from these characters the paper writes explicit inequalities for the chamber $C_0$. It then determines which of these inequalities are redundant and classifies the walls by birational type. The upshot is that the chamber has finitely many explicit inequalities and every wall has known type, turning an abstract existence theorem into a checkable combinatorial algorithm with applications to the birational geometry of other crepant resolutions.","feed_headline":"Recipe reveals every wall of G-Hilb's stability chamber","feed_subtitle":"The unlocking procedure turns Reid's recipe into explicit inequalities, and names each wall's birational type.","key_machinery":"The carrying object is the total $G$-igsaw piece $G\\text{-igp}(C)$ of an exceptional curve $C$: the set of characters labelling the monomials of a $G$-cluster that participate in the $G$-igsaw transformation when passing across $C$. The unlocking procedure (Algorithm 3.3) computes $G\\text{-igp}(C)$ from Reid's recipe alone: start with the character $\\chi$ marking $C$; add one character from each del Pezzo divisor along the $\\chi$-chain, the characters marking Hirzebruch divisors along the $\\chi$-chain, and then recursively the total $G$-igsaw pieces of the curves $E$ 'downstream' of $C$ at those Hirzebruch divisors. This reduces every wall inequality to a finite, purely combinatorial calculation on the triangulation of the junior simplex, and it provides the redundancy tests that identify which inequalities are walls and which are merely consequences of others.","core_discovery":"The central claim is Theorem 4.17: for any finite abelian $G\\subset \\mathrm{SL}(3,\\mathbb{C})$, the walls of the chamber $C_0$ for $G\\text{-Hilb}\\,\\mathbb{A}^3$ are exactly one Type I wall for each exceptional $(-1,-1)$-curve, one Type III wall for each generalised long side, one Type 0 wall for each irreducible exceptional divisor, and all remaining walls are of Type 0 and come from divisors parameterising a rigid quotient. The inequalities that carve out $C_0$ are computed by the unlocking procedure (Algorithm 3.3), which determines the total $G$-igsaw piece $G\\text{-igp}(C)$ of each exceptional curve $C$: the set of characters whose monomials are exchanged when a $G$-cluster moves across $C$. A curve inequality is the sum $\\sum_{\\chi\\in G\\text{-igp}(C)}\\theta(\\chi)>0$, with a doubled contribution $2\\theta(\\chi^2)$ for $(-1,-3)$-curves, and divisor inequalities are sums of the same characters over all curves inside the divisor. The paper shows that no Type II walls occur and that every flop in a $(-1,-1)$-curve is realised by a Type I wall-crossing from $C_0$, both by purely combinatorial means.","pith_inferences":["A proof of the unlocking procedure for curves inside a meeting-of-champions triangle would complete the present classification and could be checked by comparing its output with a direct monomial-ideal computation of $G$-igsaw pieces.","The summand-redundancy criterion used in Section 4 suggests a general test for whether a nonnegative wall inequality in a toric GIT chamber is redundant: decompose its character support into total $G$-igsaw pieces and divisor inequalities.","One could reverse the logic and use an explicitly computed wall chamber for another crepant resolution to reconstruct a partial Reid's recipe, and then ask whether that marking has categorical content along the lines the paper suggests as future work.","The explicit chamber description should make wall-crossing of related moduli spaces, such as iterated Hilbert schemes, computationally tractable by comparing their stability parameters against the inequalities for $C_0$."],"forward_implications":["The chamber $C_0$ for $G\\text{-Hilb}\\,\\mathbb{A}^3$ can be written down explicitly as a finite intersection of half-spaces for any finite abelian $G$, using only the triangulation of the junior simplex and Reid's recipe.","Each wall of $C_0$ has an identified birational type: Type I walls flop a single $(-1,-1)$-curve, Type III walls contract a divisor to a curve along a generalised long side, and Type 0 walls leave the underlying variety unchanged.","There are no Type II walls in $C_0$, and every flop in a $(-1,-1)$-curve of $G\\text{-Hilb}$ is induced by a wall-crossing directly from $C_0$.","The Type 0 walls coming from rigid quotients can be reconstructed combinatorially from the set of curves whose full $G$-igsaw characters appear in the wall equation, so the wall-and-chamber decomposition is algorithmically accessible.","Because the description depends only on the combinatorics of the exceptional fibre, the same procedure transfers to other crepant resolutions obtained by variation of GIT quotient."],"supporting_citations":[{"why":"Supplies the abstract chamber inequalities from exceptional curves and divisors, and the wall-type trichotomy that the paper turns into explicit combinatorics.","marker":"[10]"},{"why":"Provides the explicit construction of the McKay correspondence and the tautological-bundle relations underlying Reid's recipe used throughout.","marker":"[9]"},{"why":"Introduces $G$-igsaw transformations and the Unique Valley Lemma used to locate the socle characters bounding each total $G$-igsaw piece.","marker":"[22]"},{"why":"Gives the algorithm for the triangulation of the junior simplex and the edge-continuation criterion used for boundary curves.","marker":"[12]"},{"why":"Establishes that $G\\text{-Hilb}\\,\\mathbb{A}^3$ is a crepant resolution and supplies the derived equivalence underlying the moduli and chamber picture.","marker":"[5]"},{"why":"Defines the wall types 0--III by the birational geometry of the corresponding contractions, used in the wall classification.","marker":"[25]"},{"why":"Constructs moduli of quiver representations by GIT, giving the stability space $\\Theta$ and the meaning of the chamber $C_0$.","marker":"[19]"}],"fun_headline_variants":["Unlocking Reid's recipe yields every wall of G-Hilb","Explicit inequalities carve all G-Hilb chamber walls","Algorithm converts Reid's recipe into G-Hilb walls","No Type II walls: Reid's recipe defines G-Hilb's chamber"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The central claim collapses if for some exceptional curve the unlocking procedure returns the wrong set of characters in the total $G$-igsaw piece; the paper proves this computation in full for the main curve types but leaves the meeting-of-champions case omitted and the boundary-curve case sketched.","fun_headline_variants_meta":{"raw":{"variants":["Unlocking Reid's recipe yields every wall of G-Hilb","Explicit inequalities carve all G-Hilb chamber walls","Algorithm converts Reid's recipe into G-Hilb walls","No Type II walls: Reid's recipe defines G-Hilb's chamber"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000627,"raw_usage":{"total_tokens":2937,"prompt_tokens":1022,"completion_tokens":1915,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":638,"completion_tokens_details":{"reasoning_tokens":1842}},"tokens_in":638,"tokens_out":1915,"duration_ms":14394,"temperature":1.0,"reasoning_tokens":1842,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:05:03.425433+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a finite abelian group whose triangulation of the junior simplex has a meeting-of-champions triangle of positive side length (for example $G=\\frac{1}{25}(1,3,21)$), choose an exceptional curve inside that triangle, and compare the set of characters produced by the unlocking procedure with the set of characters whose tautological line bundles restrict non-trivially to that curve (equivalently, the characters appearing in the monomial ideals of the two adjacent $G$-clusters). Any disagreement would falsify Algorithm 3.3 and hence the wall inequalities of Theorem 4.17.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the abstract chamber inequalities from exceptional curves and divisors, and the wall-type trichotomy that the paper turns into explicit combinatorics."},{"cited_title":"Algebra 285 (2005), 682–705, arXiv:math.AG/0010053","cited_arxiv_id":null,"evidence_quote":"Provides the explicit construction of the McKay correspondence and the tautological-bundle relations underlying Reid's recipe used throughout."},{"cited_title":"Algebraic Geom","cited_arxiv_id":null,"evidence_quote":"Introduces $G$-igsaw transformations and the Unique Valley Lemma used to locate the socle characters bounding each total $G$-igsaw piece."},{"cited_title":"Congr., Vol","cited_arxiv_id":null,"evidence_quote":"Gives the algorithm for the triangulation of the junior simplex and the edge-continuation criterion used for boundary curves."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes that $G\\text{-Hilb}\\,\\mathbb{A}^3$ is a crepant resolution and supplies the derived equivalence underlying the moduli and chamber picture."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the wall types 0--III by the birational geometry of the corresponding contractions, used in the wall classification."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Constructs moduli of quiver representations by GIT, giving the stability space $\\Theta$ and the meaning of the chamber $C_0$."}],"review_version":1}