Pith. sign in

REVIEW 4 major objections 4 minor 20 references

Structures of Monoids Motivated by DNA Origami

T0 review · 4 major / 4 minor · reviewed 2026-08-10 · 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 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$.

desk verdict 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. read the letter →

arxiv 2501.14966 v1 pith:6YDKQ27N submitted 2025-01-24 math.RA

Peter Alspaugh , James Garrett , Nataša Jonoska , Masahico Saito This is my paper · ORCID
classification math.RA MSC 20M0520M1068Q42
keywords origamimonoidJonesTemperley–LiebalgebracontextualcommutationGreen'srelationsstringrewritingsystemnormalformDNA
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

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.

What carries the argument

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$.

What would settle it

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$.

Watch

Extended reading notes

Core claim

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.

Load-bearing premise

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.

Editorial extensions

If this is right

  • 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$.

Reading between the lines

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

  • 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.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 4 minor

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.

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 (4)
  1. [Lemma 2(i), §3.3.2] 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.
  2. [Lemma 2(ii), Tables 1–2] 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.
  3. [Corollaries 3–4, Lemma 13, Theorem 17, Corollary 18] 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.
  4. [Propositions 14–16] 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.
minor comments (4)
  1. [Lemma 1(a), §3.3.2] 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.
  2. [References, §4] The text says the new sequence is A380196 in the OEIS, but reference [13] lists identifier A047974; these identifiers should be reconciled.
  3. [§3.2] 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].
  4. [Definition 2, §4] 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.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation found: the monoid is presentation-defined, and the finiteness and D-class results are derived (modulo a proof gap in Lemma 2) from those defining relations rather than from fitted inputs or self-citation.

full rationale

The paper's derivation chain is not circular. The origami monoid O_n is explicitly defined by generators and rewriting rules (1)-(5), (1a)-(3a) in Definition 1, and the subsequent arguments are intended to be consequences of that presentation. Lemma 2 is motivated by GAP observations, but the paper attempts an induction-based proof of contextual commutation from the defining rules; using the lemma later is not a matter of fitting a parameter and calling it a prediction. Corollary 4, Lemma 13, Lemma 16, and Theorem 17 all depend on Lemma 2, but they depend on it substantively, not definitionally: the core projection p(w)=p_alpha(w)p_beta(w) is defined independently, and the claimed D-class correspondence with J_n x J_n is derived through rewriting, not by renaming the known D-classes of the product. The self-citations to the authors' earlier papers [6,7] are used for motivation, for the original proposal of the rewriting rules, and for some preliminary facts such as O_n^alpha_beta being a submonoid; the defining relations and main proofs are restated or re-proved in the present manuscript, so the self-citations are not load-bearing in the sense of replacing an argument with an unverified claim. The normal-form counting check against GAP sizes for n=3,4 is an empirical consistency check, not an input used to derive finiteness or the D-class bijection. The real weakness of the paper is different from circularity: the proof of Lemma 2 as printed never performs the claimed alpha_i beta_i swap, instead rewriting words of the form gamma_m gamma_i gamma_i, and the case tables for part (ii) likewise reduce to same-type computations. That is an unproved lemma, which makes the central results conditional, but a proof gap is not circular reasoning. No fitted parameter is renamed as a prediction, no definition is fixed in terms of the target result, and no external result is imported solely through self-citation. Accordingly, the circularity score is 0.

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

The construction has no fitted parameters. Definition 1 is the domain assumption, and Lemma 2 is promoted to an unproved axiom because its proof is invalid as printed.

assumptions (4)
  • domain assumption Definition 1 presentation of O_n with relations (1)-(5), (1a), (2a), (3a)
    The algebraic results are relative to this presentation; the DNA origami motivation is not formalized and does not enter the proofs.
  • ad hoc to paper Contextual commutation (Lemma 2): for any generator letters x,y and any i, x alpha_i beta_i y = x beta_i alpha_i y
    Used in Corollary 4, Lemma 13, Proposition 14, Proposition 15, Lemma 16, and Theorem 17. The printed proof of Lemma 2(i) only computes with gamma_m gamma_i gamma_i and does not establish the alpha-beta swap, so this lemma functions as an unproved assumption.
  • standard math Jones monoid normal forms and Catalan count from [8]
    Standard results from the cited literature on Kauffman/Jones monoids.
  • standard math Regularity, H-triviality, and D-class characterization of J_n from [15]
    Cited standard results about ideal structure of Kauffman and related monoids.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Structures of Monoids Motivated by DNA Origami." pith.science (2026). https://pith.science/paper/6YDKQ27N

@misc{pith2026250114966,
  author       = {Pith},
  title        = {Pith review of: Structures of Monoids Motivated by DNA Origami},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6YDKQ27N}},
  note         = {Machine review of arXiv:2501.14966}
}
read the original abstract

We construct a class of monoids, called origami monoids, motivated by Jones monoids and by strand organization in DNA origami structures. Two types of basic building blocks of DNA origami closely associated with the graphical representation of Jones monoids are identified and are taken as generators for the origami monoid. Motivated by plausible modifications of the DNA origami structures and the relations of the well studied Jones monoids, we then identify a set of relations that characterize the origami monoid. These relations expand the relations of the Jones monoids and include a new set of relations called contextual commutation. With contextual commutation, certain generators commute only when found within a given context. We prove that the origami monoids are finite and propose a normal form representation of their elements. We establish a correspondence between the Green's classes of the origami monoid and the Green's classes of a direct product of Jones monoids.

Figures

Figures reproduced from arXiv: 2501.14966 by the authors.

Figure 1
Figure 1. A schematics of DNA origami structure with scaffold in black and sta￾ples in color (edited from [1]). . More specifically, to model DNA origami structures, we divide the general origami struc￾ture ( [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. (A) The generators hi of Jn and relations (B,C,D) of the Jones monoid Jn [11]. Although the presentation of the origami monoids is motivated by DNA origami structures, our method of obtaining origami monoids On from the Jones monoid Jn can be regarded as a general algebraic construction and can be applied to other algebraic structures. The set of generators is doubled into two types; to each generator hi ( [PITH_FU… view at source ↗
Figure 3
Figure 3. The generators identified Fig. 3c shows a diagram corresponding to α4 as an example of the “full picture” of one of these generators. For the sake of brevity, we neglect to draw the extra scaffold and staple strands in most diagrams, but it may be helpful to imagine them when we describe their concatenation. In addition, we often use αi and βi to refer to the corresponding diagrams. In Fig. 3c, parallel scaffolds in… view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: c. As a result of this convention, αiβi and βiαi are two distinct words, i.e., α’s and β’s do not freely commute. Note that concatenation of three or more generators is associative because once the diagrams are placed on top of each other according to the concatenation…
Figure 5
Figure 5. Figure 5: An example of the inter-commutation rewriting rule, αiβi+1 → βi+1αi , rule (4) 3.3.2 Additional rewriting rules derived by substitution We note that a DNA origami structure has no internal loops, neither for the scaffold strand nor for the staples. Therefore, rules sim…
Figure 6
Figure 6. Figure 6: Substitution of γ = αβ into rewriting rules (1) and (4). Substitution in (4) conflicts with the structure of the scaffold: the scaffold strand at the top left is connected to the second strand only on the left side of the figure, and on the right hand side of the figur…
Figure 7
Figure 7. Figure 7: Graphical representation of index values of u = α3α2α1α4α3α2α5α4 in Lemma 5 12 [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]
Figure 8
Figure 8. Figure 8: Examples of words corresponding to cases (1) and (2) of Corollary 10 Corollary 11. Let w = γ1uvγ2 be an element of On in a regular form with γ2 = αj and the J.n.f. of u be β[j1, i1] · · · β[jk, ik]. Then we have the following possibilities for u: 1. k = 1, j1 = i1 = i,…
Figure 9
Figure 9. Figure 9: Examples of words corresponding to cases (3) and (4) of Corollary 10 It is known that the elements of the Jones monoid Jn are in bijection with the linear chord diagrams obtained from the arcs of the diagrams representing them, and the total number of such chord diagra…
Figure 10
Figure 10. Figure 10: D-classes of O5. A node labeled [w] denotes the D-class of w. An arrow from w to v denotes that v ≤D w. The D-classes of O α n and O β n are along the upper flanks of the diamond. Notice that for O γ n ≃ Jn (γ ∈ {α, β}), since every (non-identity) word is D-related to…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 18 canonical work pages

  1. [13]

    http://www

    The On-Line Encyclopedia of Integer Sequences, id:A047974. http://www. research.att.com/∼njas/sequences/A047974

    work page

  2. [1]

    Nature 440(7082), 297–302 (2006)

    Rothemund, P.W.K.: Folding DNA to create nanoscale shapes and patterns. Nature 440(7082), 297–302 (2006)

    work page 2006

  3. [2]

    Science 332(6027), 342–6 (2011) https://doi.org/10.1126/science.1202998

    Han, D., Pal, S., Nangreave, J., Deng, Z., Liu, Y., Yan, H.: DNA origami with complex curvatures in three-dimensional space. Science 332(6027), 342–6 (2011) https://doi.org/10.1126/science.1202998

    work page doi:10.1126/science.1202998 2011

  4. [3]

    Nano Letters 14(10), 5740–7 (2014)

    Marchi, A.N., Saaem, I., Vogen, B.N., Brown, S., LaBean, T.H.: Toward larger DNA origami. Nano Letters 14(10), 5740–7 (2014)

    work page 2014

  5. [4]

    Science 358(6369), 2648 (2017) https://doi.org/10.1126/science.aao2648

    Han, D., Qi, X., Myhrvold, C., Wang, B., Dai, M., Jiang, S., Bates, M., Liu, Y., An, B., Zhang, F., Yan, H., Yin, P.: Single-stranded DNA and RNA origami. Science 358(6369), 2648 (2017) https://doi.org/10.1126/science.aao2648

    work page doi:10.1126/science.aao2648 2017

  6. [5]

    Journal of the American Chemical Society 144(10), 4403–4409 (2022) 21

    Wang, X., Jun, H., Bathe, M.: Programming 2d supramolecular assemblies with wireframe DNA origami. Journal of the American Chemical Society 144(10), 4403–4409 (2022) 21

    work page 2022

  7. [6]

    In: Proceedings of the 8th International Conference on Algebraic Informatics, pp

    Garrett, J., Jonoska, N., Kim, H., Saito, M.: Algebraic systems motivated by DNA origami. In: Proceedings of the 8th International Conference on Algebraic Informatics, pp. 164–176 (2019)

    work page 2019

  8. [7]

    Natural Computing20(2), 217–231 (2021)

    Garrett, J., Jonoska, N., Kim, H., Saito, M.: DNA origami words, graphical structures and their rewriting systems. Natural Computing20(2), 217–231 (2021)

    work page 2021

Show all 20 references
  1. [8]

    Journal of Knot Theory and its Ramifications 11(2), 127–143 (2002)

    Borisavljevi´ c, M., Doˇ sen, K., Petric, Z.: Kauffman monoids. Journal of Knot Theory and its Ramifications 11(2), 127–143 (2002)

    2002

  2. [9]

    Inventiones Matheematicae 72, 1–25 (1983)

    Jones, V.F.R.: Index for subfactors. Inventiones Matheematicae 72, 1–25 (1983)

    1983

  3. [10]

    Advances in Mathematics 333, 931–1003 (2018)

    East, J., Mitchell, J.D., Ruˇ skue, N., Torpey, M.: Congruence lattices of finite diagram monoids. Advances in Mathematics 333, 931–1003 (2018)

    2018

  4. [11]

    CoRR abs/0910.2737 (2009)

    Abramsky, S.: Temperley-Lieb algebra: From knot theory to logic and computa- tion via quantum mechanics. CoRR abs/0910.2737 (2009)

    2009 arXiv

  5. [12]

    https://www

    GAP – Groups, Algorithms, and Programming, Version 4.10.0. https://www. gap-system.org

  6. [14]

    Glasgow Mathematical Journal 59(3), 673–683 (2017)

    Dolinka, I., East, J.: The idempotent-generated subsemigroup of the Kauffman monoid. Glasgow Mathematical Journal 59(3), 673–683 (2017)

    2017

  7. [15]

    Communications in Algebra 34(7), 2617–2629 (2006)

    Lau, K.W., FitzGerald, D.G.: Ideal structure of the Kauffman and related monoids. Communications in Algebra 34(7), 2617–2629 (2006)

    2006

  8. [16]

    WORLD SCIENTIFIC, ??? (2001)

    Kauffman, L.H.: Knots and Physics, 3rd edn. WORLD SCIENTIFIC, ??? (2001). https://doi.org/10.1142/4256

    2001 doi

  9. [17]

    The Quarterly Journal of Mathematics 72(4), 1253–1269 (2021) https://doi.org/ 10.1093/qmath/haab001 https://academic.oup.com/qjmath/article- pdf/72/4/1253/43803123/haab001.pdf

    East, J.: Presentations for temperley–lieb algebras. The Quarterly Journal of Mathematics 72(4), 1253–1269 (2021) https://doi.org/ 10.1093/qmath/haab001 https://academic.oup.com/qjmath/article- pdf/72/4/1253/43803123/haab001.pdf

    2021 doi

  10. [18]

    Foundations of computer science

    Pin, J.E.: Varieties of Formal Languages. Foundations of computer science. North Oxford Academic, ??? (1986). https://books.google.com/books?id=LNwmAQAAIAAJ

    1986

  11. [19]

    Discrete Mathemat- ics & Theoretical Computer Science 12, 59–72 (2010) https://doi.org/10.46298/ dmtcs.493

    Choffrut, C., Mercas, R.: Contextual partial commutations. Discrete Mathemat- ics & Theoretical Computer Science 12, 59–72 (2010) https://doi.org/10.46298/ dmtcs.493

    2010

  12. [20]

    Semigroup Forum 16(1), 369–377 (1978) https://doi.org/10.1007/BF02194636 22

    Nordahl, T.E., Scheiblich, H.E.: Regular * semigroups. Semigroup Forum 16(1), 369–377 (1978) https://doi.org/10.1007/BF02194636 22

    1978 doi

Pith tools

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