{"id":"790af81f-4738-4f9a-8421-be3601109168","arxiv_id":"2501.14966","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"Origami monoids O_n, formed by doubling Jones monoid generators, are shown to be finite with D-classes in bijection with those of J_n times J_n, but the proof rests on an unproved contextual commutation lemma.","lead":"This paper defines a new family of finite monoids, called origami monoids, that model strand crossings in DNA origami and extend the Jones monoids. It proves finiteness and relates the Green's class structure to a product of Jones monoids, though a key lemma in the proof is not valid as written.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 2's printed proof rewrites γ_m γ_i γ_i and never swaps α_i β_i, so the contextual commutation rule behind Corollary 4, Lemma 13, and Theorem 17 is unproved.","rationale":"I read the manuscript in good faith: the authors have a plausible construction, honest labeling of the normal form as a conjecture, and GAP evidence. The finiteness proof, however, is a proof by bounding with a canonical form, and every step that produces the canonical form is Corollary 4, which is Lemma 2. The reader's weakest assumption is exactly right. I checked the proof of Lemma 2(i) line by line: it begins 'We compute γ_m γ_i γ_i' and the displayed rewrites stay within the submonoid generated by one letter type; the desired mixed word γ_m α_i β_i never appears. Lemma 2(ii) inherits this because its case tables are written as γ_p γ_i γ_i γ_q on both sides, not as γ_p α_i β_i γ_q. So the central lemma is unsupported. Independent computational verification of finitely many instances (O_4, the stated x α_2 β_2 y) is not a proof, and no formal verification is offered. This is an internally identifiable gap, not a disagreement with consensus; consequently the rejection verdict stands. If the authors can supply a correct derivation of Lemma 2 or a different finiteness argument, the paper could be reconsidered.","tokens_in":19419,"tokens_out":5429,"duration_ms":50559,"concrete_test":"Use GAP or a Knuth–Bendix completion of the presentation (1)–(5),(1a)–(3a) for n=5 to decide, for every i,m,k with |m−i|≥2, whether γ_m α_i β_i γ_k equals γ_m β_i α_i γ_k in O_5 (and likewise the two-sided context rule for all generator choices). A single inequivalent ground instance would falsify Lemma 2 and hence Theorem 17. If all tested instances are equivalent, the lemma is at least consistent with the presentation for small n, and the burden shifts to supplying a correct proof; the current proof would still not justify acceptance.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central results—finiteness of O_n (Lemma 13) and the D-class bijection with J_n × J_n (Theorem 17, Corollary 18)—depend on Lemma 2(ii), the claim that x α_i β_i y ↔ x β_i α_i y for arbitrary generator contexts x,y. That lemma is not established. In Lemma 2(i), the statement to prove is γ_m α_i β_i → γ_m β_i α_i for |m−i|≥2, but the displayed computation is of γ_m γ_i γ_i; every rewriting step acts on same-type letters γ_j γ_i γ_i, and no step ever contains the mixed pair α_i β_i. The induction therefore proves (at most) a relation among same-type generators and does not imply the mixed swap. Lemma 2(ii) then reduces the remaining cases to tables whose entries are again words of the form γ_p γ_i γ_i γ_q, not x α_i β_i y; the same-type square appears in place of the α_i β_i pair. Thus the contextual commutation relation is not derived from relations (1)–(5),(1a)–(3a). Corollary 4 uses Lemma 2 to move all α's left and β's right; Lemma 13 uses that separation to bound |O_n| ≤ 4|J_n|²; Lemmas 16 and Theorem 17 use it to compare D-classes. Without Lemma 2 these arguments have no basis. The GAP checks cited in the text verify only finitely many instances (e.g., x α_2 β_2 y in O_4), which are isolated data points, not a proof for all n. The lemma may be true, but the proof as written is a gap in the central derivation.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper defines a family of monoids O_n, generated by α_i and β_i for i=1,...,n−1, with relations extending those of the Jones monoids plus additional 'substitution' relations. It claims that O_n is finite with |O_n| ≤ 4|J_n|^2, that every element has a regular form separating α- and β-generators except for possible single outer generators, and that Green's D-classes of O_n are in bijection with those of J_n × J_n. The main tool is Lemma 2, a 'contextual commutation' rule x α_i β_i y = x β_i α_i y. The paper also proposes a normal form, reports small-case GAP computations, and records a new integer sequence.","tokens_in":19738,"tokens_out":8193,"duration_ms":67017,"significance":"If the main results were established, they would provide a nontrivial algebraic model of DNA origami strand organization and a general construction of finite monoids from Jones monoids with an explicit Green's class structure. The paper's strengths include a clear exposition of the rewriting system, computational verification for small n, and a systematic attempt to derive structural properties such as regularity, H-triviality, and a D-class correspondence. However, because the central lemma on which these consequences rest is not proved, the significance of the results is conditional on a repair of that proof.","major_comments":[{"comment":"The proof of Lemma 2(i) does not establish the stated relation. It claims to show γ_m α_i β_i → γ_m β_i α_i, but the displayed chain begins with γ_m γ_i γ_i and ends with γ_m γ_i γ_i; every intermediate word is a product of same-type letters, and no step contains the mixed pair α_i β_i. The induction hypothesis is also applied to a word in which the letters to be commuted are γ_i γ_i, not α_i β_i. Thus the computation proves at most a relation among same-type generators, and the claimed equivalence with α_i β_i γ_m → β_i α_i γ_m is not derived.","section":"Lemma 2(i), §3.3.2"},{"comment":"The reduction to the cases in Tables 1 and 2 does not cover the relation to be proved. In the tables the words being rewritten are of the form x γ_i γ_i y with x,y generators; the mixed subword α_i β_i that appears in x α_i β_i y never occurs. For example, cell (1A) in both tables is the tautological word γ_j γ_i γ_i γ_j. Consequently the proof of Lemma 2(ii) does not show x α_i β_i y → x β_i α_i y for arbitrary generator contexts x,y. The GAP observations listed before Lemma 2 are finite instances and do not supply a proof for all n.","section":"Lemma 2(ii), Tables 1–2"},{"comment":"The main claims of the paper depend essentially on Lemma 2. Corollary 4 uses Lemma 2 to move α's to the left and β's to the right; Lemma 13 uses that separation to bound |O_n| by 4|J_n|^2; Lemma 16 and Theorem 17 use the same contextual commutation to compare D-classes; and Corollary 3 uses Lemma 2 to eliminate the defining relations (2b) and (3b). Since Lemma 2 is not proved, the finiteness bound, the D-class bijection, and the reduction of the presentation are not established by the arguments given.","section":"Corollaries 3–4, Lemma 13, Theorem 17, Corollary 18"},{"comment":"The proofs of Propositions 14, 15, and Lemma 16 invoke contextual commutation for arbitrary elements x,y ∈ O_n, for example 'x v α_i y = x α_i v y for any x,y ∈ O_n' in Proposition 15 and similar rearrangements in Lemma 16. Lemma 2 only states the rule for generator letters, and no induction or further argument is provided to extend it to arbitrary words. This is a load-bearing gap for the proof of H-triviality and for the D-class correspondence.","section":"Propositions 14–16"}],"minor_comments":[{"comment":"In the proof of Lemma 1(a), the step labeled (2)(3) from γ_i γ_i γ_j γ_i γ_j to γ_i γ_i γ_j γ_i γ_j γ_i γ_j uses the reverse of relation (2) or (3), but the 'rev.' marker required by Remark 1 is not written, making the proof harder to follow.","section":"Lemma 1(a), §3.3.2"},{"comment":"The text says the new sequence is A380196 in the OEIS, but reference [13] lists identifier A047974; these identifiers should be reconciled.","section":"References, §4"},{"comment":"The statement that α_i β_i and β_i α_i are distinct as a result of the staple-connection convention is an assertion about the monoid; it should be proved from the presentation or explicitly cited from [6].","section":"§3.2"},{"comment":"The claim that the regular form is unique is asserted immediately, followed by a parenthetical about the only ambiguous case β_i α_i, but no proof is given; since uniqueness is used later, this should be justified or stated as part of the unresolved normal-form problems.","section":"Definition 2, §4"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is not ready in its present form: Lemma 2, on which the finiteness theorem and D-class correspondence rest, is unproved, and its displayed proof concerns a different word. I recommend major revision rather than rejection because the gap is localized and the GAP evidence suggests the lemma may be true. The authors should either supply a correct proof of Lemma 2 for all generator contexts or substantially restructure the paper so that the unproved assertion is clearly separated from the results that depend on it."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear Colleague,\n\nThe headline: the paper's main theorems—finiteness of the origami monoid O_n and the D-class bijection with J_n × J_n—are not proved, because the lemma they all hang on, Lemma 2, is not proved as printed. The proof of Lemma 2(i) is supposed to show γ_m α_i β_i → γ_m β_i α_i for |m−i|≥2, but the displayed computation is of γ_m γ_i γ_i, a word of same-type generators. The induction never touches the mixed pair α_i β_i. The same problem afflicts part (ii): the tables enumerate words of the form γ_p γ_i γ_i γ_q, not x α_i β_i y. So the contextual commutation rule, which Corollary 4, Lemma 13, Proposition 15, and Theorem 17 all invoke, is simply not derived from the defining relations.\n\nThat said, the paper has real substance. The construction—doubling the Jones monoid generators into α's and β's, imposing idempotence on α_i β_i and β_i α_i, and adding substitution rules—is a genuinely interesting way to build new monoids. The normal form in Conjecture 12 is honestly labeled a conjecture, and the GAP data for n ≤ 7 gives it real support. The OEIS sequence is a useful byproduct. If a correct proof of Lemma 2 can be supplied, the finiteness bound |O_n| ≤ 4|J_n|² and the D-class result are plausible and would be a solid contribution.\n\nThe soft spots, in proportion: the Lemma 2 gap is load-bearing, not cosmetic. The induction hypothesis is applied to the wrong word, and the same-type square γ_i γ_i is not a proxy for α_i β_i. There is also a minor citation slip: the OEIS entry [13] is listed as A047974 in the references, while the text says the new sequence is A380196. Easy to fix, but it should be.\n\nThis is a paper for semigroup theorists and the DNA-origami modeling crowd. I would not accept it in its current form, but it deserves a serious referee, because the construction is novel and the gap may be repairable. If a referee can confirm Lemma 2 (or find a counterexample), the paper's value becomes clear either way. Send it to review with strong instructions to check the proof of Lemma 2 line by line.","headline":"The paper's contextual commutation lemma is unproved—the printed proof rewrites γ_m γ_i γ_i instead of γ_m α_i β_i—so the finiteness and D-class theorems collapse; the construction is still worth a serious look.","tokens_in":20304,"tokens_out":3389,"would_cite":false,"duration_ms":28606,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20M05","20M10","68Q42"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that every origami monoid $O_n$ is finite, bounded by $4|J_n|^2$, with Green's $D$-classes in bijection with those of $J_n \\times J_n$.","keywords":["origami monoid","Jones monoid","Temperley–Lieb algebra","contextual commutation","Green's relations","string rewriting system","normal form","DNA origami"],"falsifier":"Enumerate all words of bounded length in $O_4$ and test whether $x\\alpha_i\\beta_i y$ and $x\\beta_i\\alpha_i y$ represent the same element for every generator letter $x$, $y$, and index $i$; one failure would invalidate the separation lemma and the bound $|O_n| \\le 4|J_n|^2$. A second test is to compute the $D$-class count of $O_5$ and compare its lattice with the diamond predicted by $J_5 \\times J_5$.","tokens_in":19161,"feed_emoji":"🧬","tokens_out":9410,"duration_ms":74959,"temperature":0.7,"pith_summary":"The paper introduces origami monoids $O_n$, algebraic models built from two copies of the Jones monoid generators to describe strand and staple crossings in DNA origami. Its central claim is that every $O_n$ is finite, with $|O_n| \\le 4|J_n|^2$, and that the Green's $D$-classes of $O_n$ are in bijection with those of the direct product $J_n \\times J_n$. The paper also proposes a normal form and reports that for $n = 3,4$ the number of normal forms matches the computed monoid size. The result reduces the ideal structure of these large monoids to pairs of Jones monoid data.","feed_headline":"Origami monoids are finite, with D-classes mirroring Jones squares","feed_subtitle":"An algebraic model of DNA strand crossings stays finite, with structure inherited from the Jones monoid.","key_machinery":"The engine is contextual commutation: for any letters $x,y$ and any index $i$, the word $x\\alpha_i\\beta_i y$ rewrites to $x\\beta_i\\alpha_i y$, so $\\alpha$- and $\\beta$-generators can be swapped whenever they are flanked inside a longer word. This lets every element be written as $\\gamma_1 u v \\gamma_2$ with $u$ an $\\alpha$-word, $v$ a $\\beta$-word, and $\\gamma_1,\\gamma_2$ of length at most one. The second piece is the core map $p(w)=p_\\alpha(w)p_\\beta(w)$; the proof that each $w$ is $D$-related to $p(w)$ is what transfers Green's class questions from $O_n$ to $J_n \\times J_n$.","core_discovery":"On the paper's own terms, it establishes that the origami monoid $O_n$, presented by generators $\\alpha_i,\\beta_i$ with Jones-type relations, idempotence, inter- and intra-commutation, and substitution rules, is finite for every $n$. The proof rewrites every element as $\\gamma_1 u v \\gamma_2$, where $u$ is a word in $\\alpha$'s, $v$ a word in $\\beta$'s, and $\\gamma_1,\\gamma_2$ are at most single letters, giving $|O_n| \\le 4|J_n|^2$. It then proves that each word is $D$-related to its core $p(w)=p_\\alpha(w)p_\\beta(w)$, and that membership in a $D$-class of $O_n$ is detected by the $D$-classes of the two projections, yielding a bijection between the $D$-classes of $O_n$ and those of $J_n \\times J_n$. Along the way it shows $O_n$ is a regular $R$-semigroup and is $H$-trivial, hence contains no nontrivial subgroups.","pith_inferences":["The doubling-plus-contextual-commutation construction is a general recipe: starting from any finite monoid with a normal form, two copies with a contextual commutation rule may yield a finite monoid whose Green's classes factor through the base monoid's square.","The reported order sequence 44, 293, 2179, 19086, 190512 for $O_3,\\ldots,O_7$ is new to the OEIS and suggests a combinatorial family that may have its own recurrence or generating function.","A computational check for $n=5$ comparing the number of $D$-classes of $O_5$ with the number for $J_5 \\times J_5$ would test the correspondence beyond the small cases reported."],"forward_implications":["Every origami monoid $O_n$ is finite, with size at most $4|J_n|^2$, so an $n$-fold DNA origami pattern has only finitely many distinct algebraic forms.","The $D$-classes of $O_n$ are in bijection with the $D$-classes of $J_n \\times J_n$, giving an explicit diamond-shaped lattice indexed by pairs of Jones $D$-classes.","$O_n$ is $H$-trivial and aperiodic, so it has no nontrivial subgroups, matching the Jones monoid behavior.","Each element is $D$-related to its core $p_\\alpha(w)p_\\beta(w)$, so the ideal structure is computed by projecting words onto their $\\alpha$- and $\\beta$-parts.","The proposed regular form provides a concrete description of elements, and the normal-form count agrees with the monoid size for $n=3$ and $n=4$."],"supporting_citations":[{"why":"introduced the origami monoid presentation and the conjectures this paper addresses.","marker":"[6]"},{"why":"supplies the Jones normal form used to build the proposed normal forms for $O_n$.","marker":"[8]"},{"why":"gives the D-class characterization of the Jones monoid and its H-triviality, used in the D-class bijection.","marker":"[15]"},{"why":"provides the equivalence between aperiodicity and H-triviality used in Proposition 15.","marker":"[18]"},{"why":"provides the computed sizes of $O_3,\\ldots,O_7$ that validate the normal-form counts and the order sequence.","marker":"[12]"}],"fun_headline_variants":["Finiteness proven for DNA-inspired monoids","DNA origami monoids: finite and Jones-class-linked","Finite monoids from DNA strand crossings","Origami monoids finite; D-classes match Jones pairs","Origami monoids finite, mirroring Jones classes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole argument rests on the contextual commutation rule $x\\alpha_i\\beta_i y = x\\beta_i\\alpha_i y$ whenever $x$ and $y$ flank the pair; without that swap the separation of words into $\\alpha$- and $\\beta$-parts, and with it the finiteness bound and $D$-class correspondence, does not go through.","fun_headline_variants_meta":{"raw":{"variants":["Finiteness proven for DNA-inspired monoids","DNA origami monoids: finite and Jones-class-linked","Finite monoids from DNA strand crossings","Origami monoids finite; D-classes match Jones pairs","Origami monoids finite, mirroring Jones classes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001276,"raw_usage":{"total_tokens":5217,"prompt_tokens":944,"completion_tokens":4273,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":560,"completion_tokens_details":{"reasoning_tokens":4197}},"tokens_in":560,"tokens_out":4273,"duration_ms":27426,"temperature":1.0,"reasoning_tokens":4197,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T14:45:02.304221+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all words of bounded length in $O_4$ and test whether $x\\alpha_i\\beta_i y$ and $x\\beta_i\\alpha_i y$ represent the same element for every generator letter $x$, $y$, and index $i$; one failure would invalidate the separation lemma and the bound $|O_n| \\le 4|J_n|^2$. A second test is to compute the $D$-class count of $O_5$ and compare its lattice with the diamond predicted by $J_5 \\times J_5$.","supporting_citations":[{"cited_title":"In: Proceedings of the 8th International Conference on Algebraic Informatics, pp","cited_arxiv_id":null,"evidence_quote":"introduced the origami monoid presentation and the conjectures this paper addresses."},{"cited_title":"Journal of Knot Theory and its Ramifications 11(2), 127–143 (2002)","cited_arxiv_id":null,"evidence_quote":"supplies the Jones normal form used to build the proposed normal forms for $O_n$."},{"cited_title":"Communications in Algebra 34(7), 2617–2629 (2006)","cited_arxiv_id":null,"evidence_quote":"gives the D-class characterization of the Jones monoid and its H-triviality, used in the D-class bijection."},{"cited_title":"Foundations of computer science","cited_arxiv_id":null,"evidence_quote":"provides the equivalence between aperiodicity and H-triviality used in Proposition 15."},{"cited_title":"https://www","cited_arxiv_id":null,"evidence_quote":"provides the computed sizes of $O_3,\\ldots,O_7$ that validate the normal-form counts and the order sequence."}],"review_version":1}