{"id":"8241b6c6-9fad-4ad8-a621-7af479321556","arxiv_id":"2607.14369","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For n≥5, every proper quasi-Coxeter interval group of type D_n admits no surjective homomorphism to the braid group B_n.","lead":"The paper proves that for n≥5, no proper quasi-Coxeter interval group of type D_n can map onto the n-strand braid group. This rules out a hoped-for decomposition of these groups and gives a new proof that they are not Artin groups of type D_n.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Claim 1's cyclic-exclusion uses an unjustified braid-like equality in Q_{n,p}; without repair the rigidity classification cannot be applied.","rationale":"The reader's weakest assumption correctly identifies the most load-bearing step: Claim 1 is used to exclude cyclic endomorphisms, and without that exclusion Theorem 3.2 cannot be applied to ψ and ψ′. The written chain in Claim 1 is not justified by the stated presentation of Q_{n,p}; the equality s′_p = s_{p−1}s′_p s_{p−1}s′^{−1}_p s^{−1}_{p−1} is not an immediate consequence of the displayed commutator relation, and the simplification of h φ(s′_p) h φ(s′_p)^{−1} h^{−1} to h likewise requires an explicit commutation step. The gap may be repairable: if Ω_{n,p} includes an edge between s_{p−1} and s′_p, then the braid relation supplies the first equality, and the quotient relation supplies the commutation of h and φ(s′_p). The same pattern appears elsewhere in the proof, e.g. Claim 6 seems to need a squaring of the image of the relation before identifying a Dehn twist; these are likely typographical or omitted intermediate steps rather than fatal flaws. Because the theorem's central conclusion depends on this repair, the appropriate verdict is CONDITIONAL, consistent with the reader's assessment. I saw no independent reason to reject the theorem outright, and the strategy is coherent and well-cited.","tokens_in":13578,"tokens_out":27928,"duration_ms":221972,"concrete_test":"Check Figure 3.1 and [BNR23, Theorem 5.1] to determine whether Ω_{n,p} has an edge between s_{p−1} and s′_p. If m_{s_{p−1},s′_p}=3, rewrite Claim 1 using s_{p−1}s′_p s_{p−1}=s′_p s_{p−1}s′_p together with the commutator relation to derive φ(s′_p)=h explicitly. If no such edge exists, the first equality in Claim 1 is not a consequence of the presentation. Independently, for n=5, p=2, test in the quotient of A[Ω_{5,2}] by the stated relation whether the words s′_2 and s_1 s′_2 s_1 s′^{−1}_2 s^{−1}_1 are equal, using a computer algebra or rewriting system; a negative answer would confirm the gap.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The proof of Theorem 1.1 hinges on excluding the cyclic case in Claim 1, because only then can Theorem 3.2 classify ψ and ψ′ as conjugate to α_{ε,k}. As written, Claim 1 asserts in Q_{n,p} that s′_p = s_{p−1} s′_p s_{p−1} s′^{−1}_p s^{−1}_{p−1}, and then simplifies h φ(s′_p) h φ(s′_p)^{−1} h^{−1} to h. Neither step is derived from the presentation of Q_{n,p} given in Section 3. The displayed quotient relation only says that s_{p−1} commutes with s_p^{−1} s_{p+1} s′_p s_{p+1}^{−1} s_p; under the cyclic assumption this yields that h and φ(s′_p) commute, not the braid-like identity used in the first equality. That identity would be a consequence of an Artin braid relation between s_{p−1} and s′_p, i.e. an edge labeled 3 in Ω_{n,p}, but such an edge is not stated in the text and is not visible from the extracted Figure 3.1. If that edge is present in [BNR23], the proof can likely be repaired by spelling out the braid relation and the commutation step; if it is absent, Claim 1 is invalid and the cyclic alternatives in Theorem 3.2 cannot be ruled out. This is therefore the most load-bearing gap in the argument.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves Theorem 1.1: for n ≥ 5, an interval group G([1,w]) associated with a proper quasi-Coxeter element w of the Coxeter group W[D_n] admits no surjective homomorphism onto the braid group B_n. The proof uses the presentation of such interval groups as quotients Q_{n,p} of Artin groups of a graph Ω_{n,p} (Theorem 3.1, from [BNR23]) and the classification of endomorphisms of B_n by Castel and by Chen–Kordek–Margalit (Theorem 3.2). Assuming a surjection φ: Q_{n,p} → B_n, the authors define two homomorphisms ψ, ψ': B_n → B_n by composing φ with the two natural inclusions of the standard generators t_i into Q_{n,p} (t_p ↦ s_p or s'_p). They argue that ψ and ψ' are not cyclic; hence, by Theorem 3.2, they are conjugate to the standard endomorphisms α_{ε,k}. A comparison of abelianizations forces ε=μ and k=l, and then surjectivity forces k=l=0. The remaining steps use mapping class group computations of centralizers and intersection numbers to show that the images of s_p and s'_p must agree, finally contradicting the defining relation of Q_{n,p}. Section 2 provides a self-contained exposition of the mapping class group tools.","tokens_in":13964,"tokens_out":30439,"duration_ms":246824,"significance":"If the proof is correct, the result is a genuine strengthening of the known non-isomorphism between proper quasi-Coxeter interval groups of type D_n and the Artin group A[D_n] (Corollary 1.2). It rules out not only isomorphisms but all surjective homomorphisms onto B_n, which is a natural first step toward understanding the possible decompositions of these interval groups. The proof strategy is original and valuable: it combines the interval-group presentations of [BNR23] with deep results on endomorphisms of braid groups, and the expository Section 2 makes the topological machinery accessible to a group-theoretic audience. The intersection-number arguments in Claims 5 and 6 are concrete and checkable. The main gap is a missing justification of a key algebraic identity in Claim 1, which must be repaired before the argument is complete.","major_comments":[{"comment":"The displayed chain of equalities in the proof of Claim 1 is not derived from the stated presentation of Q_{n,p}. The first equality asserts s'_p = s_{p−1} s'_p s_{p−1} s'^{-1}_p s^{-1}_{p−1}, which holds only if s_{p−1} and s'_p satisfy the braid relation of length 3; the fourth equality uses that s_p and s'_p commute. Neither relation is explicitly stated in the text; they must be inferred from the graph Ω_{n,p} in Figure 3.1, whose edge set is not described in words and is not visible in the version of the manuscript I reviewed. This step is load-bearing: without excluding the cyclic case, Theorem 3.2 cannot be applied to ψ and ψ′. The authors should specify the graph Ω_{n,p} explicitly (or include a clearly labelled figure) and verify the two relations used in the chain, or replace the chain with a derivation from the presentation and the defining relation of Q_{n,p}.","section":"Section 3, Claim 1"},{"comment":"The proof of Claim 5 says 'Since s_p and s'_p commute', but this assertion is not a consequence of the presentation as written. It becomes true only if the graph Ω_{n,p} has no edge between s_p and s'_p (for instance, if they are opposite vertices of a 4-cycle with s_{p−1}—s'_p—s_{p+1} and s_{p−1}—s_p—s_{p+1}); this is consistent with Claim 1 only under the same graph hypothesis. The manuscript should state the adjacency relations of Ω_{n,p} explicitly, because multiple parts of the proof depend on the exact edge set: the existence of the two inclusions κ, κ′ (which requires both s_{p−1}—s_p—s_{p+1} and s_{p−1}—s'_p—s_{p+1} to be paths with braid relations) and the commutation of s_p with s'_p. Without such a statement, the proof is not verifiable from the text.","section":"Section 3, definition of Q_{n,p} and Claim 5"}],"minor_comments":[{"comment":"The sentence 'We prove in the same way that ψ′ is not cyclic' is terse. Since the graph is not symmetric in s_p and s'_p in an obvious way, a short indication of the argument for ψ′ would help. The proof for ψ relies on the braid relation between s_{p−1} and s'_p; the proof for ψ′ likely relies on the analogous relation between s_{p−1} and s_p, but this should be stated.","section":"Section 3, Claim 1"},{"comment":"In the inequality displayed after Theorem 2.10, the symbol 'b' appears (e.g. i(h([c]),[b])). It should be b_2, the regular boundary of e_2; the current notation is confusing.","section":"Section 3, Claim 5, Case 2"},{"comment":"The centraliser computations are only sketched by reference to Lemma 2.15. While the cases are plausible and the proof is analogous, the reader would benefit from a few more details in the cases p=2 and p=n−2, where the centraliser includes a half-twist generator.","section":"Section 3, Claim 4"}],"recommendation":"major_revision","confidential_remarks":"The main theorem is likely correct, and the proof idea is original and well-suited to the journal. The blocking issue is the lack of an explicit description of the graph Ω_{n,p} and the consequent unjustified algebraic identities in Claim 1. These are repairable within the manuscript's scope — the authors need to state the graph and verify the braid/commutation relations used. I recommend major revision rather than rejection. The paper should also ensure the figures (especially Figure 3.1) are clear in the final version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Main point: Theorem 1.1 is new and proved by a genuinely different route. Previous work only ruled out isomorphism with A[D_n]; since A[D_n] surjects onto B_n, ruling out a surjection is strictly stronger. The proof strategy is clean: use the BNR23 presentation for quasi-Coxeter interval groups, compose a hypothetical surjection with the two natural maps from B_n, apply the Castel/CKM classification of endomorphisms, and then use intersection numbers to eliminate the remaining cases. Section 2 is a careful primer on mapping class groups, and the paper is readable for non-specialists.\n\nWhat the paper does well: it gives a self-contained exposition of MCG tools, and the case analysis in Claims 4–6 is detailed and largely convincing. The use of intersection numbers to get contradictions is elegant.\n\nThe soft spots are minor but real. Claim 1's chain of equalities starts with φ(s'_p)=φ(s_{p−1} s'_p s_{p−1} s'^{-1}_p s^{-1}_{p−1}). That is a braid relation in Q_{n,p}, presumably coming from an edge in the Coxeter graph Ω_{n,p}. But the graph is only shown in Figure 3.1, and the text never states the edge labels. A reader who cannot see the figure—or who wants to verify the proof—has to take this on faith. It would take one sentence to say explicitly that Ω_{n,p} has an edge of label 3 between s_{p−1} and s'_p, and that this yields the relation. The later equality h φ(s'_p) h φ(s'_p)^{-1} h^{-1} = φ(s_p) is justified by the added commutator relation in Q_{n,p}, but again this is not spelled out. If those two relations are true, Claim 1 goes through; the paper should make them explicit. There are also a few typos in Claim 5 (e.g., 'i([b_2,c])' and a stray vertical bar), which should be cleaned up.\n\nThe central argument is sound as far as I can see. The classification of endomorphisms is a known theorem, and the intersection-number computations are standard. The paper does not rely on a fitted conclusion or circular reasoning; the cited results are independent.\n\nWho it's for: anyone working on interval groups, dual Artin groups, or homomorphisms between Artin groups. It is a targeted contribution, but a solid one. Deserves a serious referee. I would recommend sending it to review, with a request to clarify Claim 1 and fix the typos.","headline":"Theorem 1.1 is a real new result with a clean MCG proof; the only substantive issue is an under-explained braid relation in Claim 1 that should be made explicit, plus minor typos.","tokens_in":14417,"tokens_out":15207,"would_cite":true,"duration_ms":120188,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20F36"],"pacs":[],"model":"deepseek-v4-flash","headline":"For n≥5, no proper quasi-Coxeter interval group of type D_n admits a surjective homomorphism onto the braid group B_n.","keywords":["interval groups","quasi-Coxeter elements","braid groups","Artin groups","Coxeter groups type D","mapping class groups","endomorphisms of braid groups","Garside groups"],"falsifier":"Check whether the relation s'_p = s_{p−1} s'_p s_{p−1} s'^{-1}_p s^{-1}_{p−1} holds in the group Q_{n,p}; if not, the proof of Claim 1 is invalid. More directly, search for a surjective homomorphism from Q_{5,2} onto B_5; a single such surjection falsifies the theorem.","tokens_in":13460,"feed_emoji":"🧵","tokens_out":6414,"duration_ms":53256,"temperature":0.7,"pith_summary":"The paper proves that, for n≥5, none of the interval groups associated with proper quasi-Coxeter elements of the Coxeter group of type D_n can be mapped onto the braid group B_n on n strands. This is stronger than merely knowing these groups are not isomorphic to the Artin group of type D_n, because the ordinary Artin group does have B_n as a quotient. The result rules out any decomposition of those interval groups that would give a surjection onto the braid group. The proof is new in this area: it uses the classification of endomorphisms of braid groups and mapping class group computations. A large part of the paper is an expository account of the mapping class group tools needed.","feed_headline":"D_n interval groups never map onto braid group B_n","feed_subtitle":"Braid endomorphism rigidity rules out a braid-group decomposition for n≥5.","key_machinery":"The load-bearing input is a rigidity theorem for endomorphisms of the braid group B_n (n≥5): every endomorphism is either cyclic or conjugate to one of the maps t_i ↦ t_i^ε Δ^{2k} with ε=±1 and k∈Z. The interval group G([1,w]) is presented as Q_{n,p}, with two embeddings κ, κ' of B_n that let a candidate surjection φ be converted into two endomorphisms of B_n. Mapping class group arguments—Dehn twists, half-twists, intersection numbers, and centralizers of partial generating sets in the punctured disc—are then used to pin down the conjugating element and extract a contradiction.","core_discovery":"The central claim, Theorem 1.1, is that for n≥5 and any proper quasi-Coxeter element w of the Coxeter group W[D_n], the interval group G([1,w]) admits no surjective homomorphism onto the braid group B_n. Since A[D_n] does map onto B_n, this yields as a corollary a new proof that these interval groups are not isomorphic to A[D_n]. The proof assumes a surjection φ from a presentation Q_{n,p} of G([1,w]) to B_n and constructs two endomorphisms of B_n by composing φ with two natural embeddings of B_n into Q_{n,p}. Using the classification of endomorphisms of B_n, it shows both are conjugate to the same standard map t_i ↦ t_i Δ^{2k}, then forces k=0. Combining centralizer computations in the mapp","pith_inferences":["A reader might expect that the same rigidity argument rules out not only surjections but any homomorphism from these interval groups to B_n whose image is not cyclic; the paper only claims surjectivity.","The unproved identity in the proof of Claim 1 is a potential soft spot; if it fails, the proof could be repaired by finding a different way to rule out cyclicity, or the theorem itself might fail.","Since the only proper quasi-Coxeter elements in D_n appear for n≥4, extending the method to n=4 would require a substitute for the braid group endomorphism classification, which is not covered by the classification used here."],"forward_implications":["If true, no proper quasi-Coxeter interval group of type D_n (n≥5) can have B_n as a quotient, blocking any Artin-group-style semidirect product decomposition of these groups.","The result gives a second, independent route to the known non-isomorphism between these interval groups and the Artin group of type D_n.","The proof introduces mapping class group rigidity arguments into the study of interval groups, a technique that may transfer to other Coxeter types with proper quasi-Coxeter elements.","The statements are proved for n≥5; the case n=4 remains open under this method, though the non-isomorphism corollary already holds for n≥4."],"fun_headline_variants":["D_n quasi-Coxeter intervals: no B_n surjection","No B_n quotient from D_n interval groups","Mapping class proof D_n intervals miss B_n","For n≥5 D_n intervals have no B_n quotient","D_n interval groups cannot surject onto B_n"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The proof of Claim 1 assumes the identity φ(s'_p)=φ(s_{p−1} s'_p s_{p−1} s'^{-1}_p s^{-1}_{p−1}) holds in Q_{n,p}, but this identity is not derived from the defining presentation; if it does not hold, the argument that ψ and ψ' are non-cyclic fails, and the rigidity theorem cannot be invoked.","fun_headline_variants_meta":{"raw":{"variants":["D_n quasi-Coxeter intervals: no B_n surjection","No B_n quotient from D_n interval groups","Mapping class proof D_n intervals miss B_n","For n≥5 D_n intervals have no B_n quotient","D_n interval groups cannot surject onto B_n"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001187,"raw_usage":{"total_tokens":4692,"prompt_tokens":655,"completion_tokens":4037,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":399,"completion_tokens_details":{"reasoning_tokens":3958}},"tokens_in":399,"tokens_out":4037,"duration_ms":30316,"temperature":1.0,"reasoning_tokens":3958,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T02:17:12.881546+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Check whether the relation s'_p = s_{p−1} s'_p s_{p−1} s'^{-1}_p s^{-1}_{p−1} holds in the group Q_{n,p}; if not, the proof of Claim 1 is invalid. More directly, search for a surjective homomorphism from Q_{5,2} onto B_5; a single such surjection falsifies the theorem.","supporting_citations":[],"review_version":1}