Pith. sign in

REVIEW 2 major objections 6 minor 1 cited by

Endocabling of involutive solutions to the Yang-Baxter equation, with an application to solutions whose diagonal is a cyclic permutation

T0 review · 2 major / 6 minor · reviewed 2026-08-16 · 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 finite cycle sets whose diagonal is a cyclic permutation have finite multipermutation level for odd prime-power cardinalities, and that for 2-power cardinalities either the level is finite or iterated retraction…

desk verdict Endocabling is a genuine reusable tool and the odd-prime-power theorem is solid; the 2-power classification is likely correct but currently rests on non-reproducible computational base cases that need fixing before full trust. read the letter →

arxiv 2504.14339 v2 pith:SPNDEB4X submitted 2025-04-19 math.QA math.GRmath.RA

Carsten Dietzel This is my paper · ORCID
classification math.QAmath.GRmath.RA MSC 16T25
keywords Yang-Baxterequationcyclesetsset-theoreticsolutionspermutationbracesendocablingmultipermutationlevelretractioncyclicdiagonalmap
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 endocabling, a way to deform a cycle set—the combinatorial shadow of an involutive, non-degenerate set-theoretic Yang-Baxter solution—by applying $\lambda$-endomorphisms of its associated permutation brace. It then applies this tool to cycle sets of size $n$ whose diagonal map is an $n$-cycle, a class known to be indecomposable and difficult to decompose. The main theorems are: for $n$ an odd prime power, every such solution has finite multipermutation level; for $n$ a power of $2$, either it has finite multipermutation level or its iterated retractions eventually land on the unique irretractable size-4 cycle set $X_{4,19}$. If the paper is right, the only infinite-iteration behavior in the prime-power cyclic-diagonal setting is that single exceptional solution of size 4.

What carries the argument

The central object is the permutation brace $G(X)$ of a cycle set $X$, and the new deformation operation called endocabling by a $\lambda$-endomorphism $\varphi$: the deformed operation is $x\ast_\varphi y=\lambda_{\varphi(\lambda_x)}^{-1}(y)$. The load-bearing identity is the diagonal composition law $T_{\varphi+\psi}=T_\varphi\circ T_\psi$, from which the paper derives that central elements of $G(X)$ produce diagonals that commute with $T$. The proof's workhorse is the endomorphism $\varphi=\mathrm{id}-\lambda_z$ for a central involution $z$, which removes $z$ from the image (the paper calls this "cabling out the center") and, together with fix/socle arguments, forces retractability.

What would settle it

An independent exhaustive enumeration—for example, with a SAT-based or verified enumerator—of all 16-element cycle sets satisfying the six conditions in Lemma 5.10: if any such table exists, Theorem 5.1's base case is wrong and the 2-power classification fails. For the odd case, a single irretractable cycle set of size $p^v$ with $p$ odd and an $n$-cycle diagonal would refute Theorem 4.2.

Watch

Extended reading notes

Core claim

Stated in cycle-set language: if $X$ is a finite cycle set of cardinality $p^v$ with $p$ odd and diagonal $T$ an $n$-cycle, then $X$ is retractable (Theorem 4.2), hence by iterating retractions it has finite multipermutation level (Corollary 4.3). For cardinality $2^v$, Theorem 5.1 proves retractability for $v>2$, and Corollary 5.2 shows that iterated retraction either reaches a one-element cycle set or reaches the unique size-4 irretractable cycle set $X_{4,19}$. The engine is endocabling: given a $\lambda$-endomorphism $\varphi$ of the permutation brace $G(X)$, one forms a new cycle set $X_\varphi$ by setting $\lambda_x^\varphi=\lambda_{\varphi(\lambda_x)}$, and the diagonal obeys the composition law $T_{\varphi+\psi}=T_\varphi\circ T_\psi$. This gives enough control over the diagonal and the center of the permutation group to force retraction.

Load-bearing premise

The load-bearing premise is that the paper's computer searches for the base cases of size 8 and size 16 are correct and exhaustive, meaning the size-16 constraint model faithfully encodes all cycle-set axioms plus the diagonal, centralizer, automorphism, and irretractability conditions, and the search code contains no hidden error (the printed code uses an undefined loop bound).

Editorial extensions

If this is right

  • For every odd prime power $p^v$, the retraction tower of a cyclic-diagonal cycle set ends at a one-element cycle set, so the multipermutation level is finite and the solution is built from finitely many retraction steps.
  • For every $2$-power size, no infinite retraction tower is possible: iterated retraction either reaches a point or reaches the unique irretractable size-$4$ cycle set $X_{4,19}$.
  • Epimorphic images of a cyclic-diagonal solution remain cyclic-diagonal, so the retraction tower stays inside the same class and the finiteness/exception dichotomy propagates down the tower.
  • In the $2$-power case, endocabling by $\varphi=\mathrm{id}-\lambda_z$ sends the diagonal to its square and controls the Dehornoy class of the cabled solution as a power of $2$, giving quantitative control beyond mere retractability.

Reading between the lines

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

  • One consequence not drawn in the paper is that the diagonal law $T_{\varphi+\psi}=T_\varphi\circ T_\psi$ suggests a module structure on the set of achievable diagonals; developing it could classify which permutations can occur as diagonals of solutions whose permutation group has a large center.
  • The odd-prime-power theorem might support a recursive classification: every retraction step of a cyclic-diagonal solution is a surjection with equal fiber size, so enumerating all such solutions of size $p^v$ could be reduced to extending solutions of size $p^{v-1}$ by fibers.
  • For composite non-prime-power sizes the paper gives no answer and notes $n=45$ as the smallest open odd case; a theorem or counterexample there would show whether the prime-power restriction is essential or an artifact of the fixed-point arguments.
  • The size-16 computational base case is printed with an undefined loop bound, so a machine-checkable certificate for that search would turn the reported computation into a verifiable proof.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 6 minor

Summary. This paper introduces endocabling, a deformation of finite involutive non-degenerate set-theoretic solutions of the Yang–Baxter equation, formulated in the language of cycle sets. An endocabling is a redefinition of the cycle-set operation by a (relative) λ-endomorphism of the associated permutation brace, generalizing the cabling of Lebed, Ramírez and Vendramin. The paper proves that the diagonal of an endocabling composes additively (Proposition 2.11), that central elements give controlled diagonal twists (Theorem 2.14), and that endocabling can 'cable out' the center (Proposition 2.16 and Lemma 5.9). These tools are applied to cycle sets of size n whose diagonal is an n-cycle. The main results are: for n an odd prime power, every such cycle set is retractable and has finite multipermutation level (Theorem 4.2, Corollary 4.3); for n a power of 2, every such cycle set either has finite multipermutation level or retracts to the exceptional size-4 solution X_{4,19} (Theorem 5.1, Corollary 5.2). The 2-power theorem is proved by induction whose base cases v=3,4 are verified computationally in Lemma 5.10.

Significance. The endocabling framework is a genuinely useful new tool: it gives clean proofs of diagonal-composition formulas, recovers classical cabling as a special case, and leads to a strong structural statement for cyclic diagonals. The algebraic parts of the paper, especially the odd-prime-power theorem in Section 4, are coherent and appear to be proved rather than assumed. The odd-prime-power result is self-contained and does not depend on the computational lemma. However, the 2-power classification rests entirely on the computational base cases in Lemma 5.10, and those are not reproducible from the manuscript as written; without a verifiable base case, the dichotomy in Corollary 5.2 is not established.

major comments (2)
  1. [§5, Lemma 5.10 and the Appendix] The v=4 nonexistence check is not reproducible. The ESSENCE' model contains the constraint 'forAll i: int(0..n-2)' with n never declared; all arrays are indexed 0..15, so the code as printed cannot be parsed or executed. No solver version, runtime, output, or UNSAT certificate is provided. Because Lemma 5.10 is the sole base of the induction in Theorem 5.1, the claim that no irretractable cycle set of size 16 with a 16-cycle diagonal exists is unsupported until the model is corrected and the exhaustive search is documented.
  2. [§5, Lemma 5.10] The v=3 case is asserted with the sentence that the statement is 'easily confirmed by checking all cycle sets of size 8 which are part of the GAP library YangBaxter,' but the paper gives no library version, no enumeration script, and no argument that the library is exhaustive at size 8. Since this is the other base case of the same induction, the v=3 base needs the same documentation standard as the v=4 case, for example a script and a record of complete enumeration.
minor comments (6)
  1. [Introduction] Page 2 contains typos: 'effciently' should be 'efficiently' and 'disivible' should be 'divisible'.
  2. [Lemma 5.10] 'a modelling assistent' should be 'a modelling assistant'.
  3. [Proof of Theorem 5.1] After the reference to Lemma 5.9, 'let z′∈Z (G(Xφ)) be such that o◦(z) = 2' should be 'o◦(z′)=2'.
  4. [Lemma 5.6(f), proof] The expression '2kg = 0' should read '2^k g = 0' to avoid confusion between multiplication by 2k and the 2^k-th multiple.
  5. [Proposition 2.13] The displayed statement contains a redundant 'T_{λ_z} = T_{λ_z}'; it would be clearer to define T_z = T_{λ_z} and state T_z = λ_z^{-1}∘T∘λ_z.
  6. [Appendix] The comment line in the model says '$ x_i -> x_1-i centralizes G(X)', but condition (4) states that the involution i↦1-i commutes with every row map, i.e., lies in the centralizer of G(X); rephrasing would avoid ambiguity.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: endocabling constructions and diagonal formulas are proven, not assumed; the only self-citations supply standard auxiliary lemmas.

full rationale

The paper's central claims do not reduce to their inputs by construction. Endocabling is introduced by an explicit definition (Definition 2.4), and the key diagonal identities are proven from the brace axioms: Proposition 2.11 shows T_{φ+ψ}=T_φ∘T_ψ via the calculation in Proposition 2.10, and Theorem 2.14 derives T∘T_z=T_z∘T from Propositions 2.11 and 2.13. These are algebraic derivations, not disguised assumptions. The main retractability theorems for odd prime powers and for powers of 2 are then obtained by applying these identities together with group-theoretic lemmas (Lemmas 4.4, 5.3–5.9), each of which is proven in the text. The computational base case Lemma 5.10 is a nonexistence search, not a fit: it checks cycle-set axioms plus constraints derived from the lemmas, so even if the Savile Row code contains an undefined variable (n) and lacks a solver certificate, that is a reproducibility/correctness concern, not circularity. The only self-citations are to the author's [11] for standard brace facts (Proposition 1.7 and Lemma 3.4); these are published external results that do not assert the target theorems and are used as auxiliary tools, not as the load-bearing uniqueness claim. No fitted parameter is renamed as a prediction, and no uniqueness theorem is imported from the authors' prior work. The derivation chain is self-contained apart from ordinary external references.

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

No free parameters are fitted; the paper introduces one new mathematical construction (endocabling), but it is definitional rather than an invented entity. The load-bearing background consists of standard brace and cycle-set theorems plus the paper-specific computational base cases, which are the main unverified inputs.

assumptions (5)
  • standard math Finite cycle sets are automatically non-degenerate: condition (C3) follows from (C1) and (C2) (Rump [23, Theorem 2]).
    Used throughout to treat finite sets satisfying (C1),(C2) as cycle sets, e.g., in Proposition 2.5.
  • standard math The permutation brace G(X) exists and satisfies the fundamental identity lambda_g(lambda_x)=lambda_{lambda_g(x)} (Rump [24]; Eq. (1.4)).
    Basis of the brace-theoretic toolkit; used constantly in Sections 2, 4, and 5.
  • standard math Theorem 1.11: if Soc(G(X)) is nonzero then X is retractable (Bachiller, Cedo, Jespers, Okninski [1, Lemma 2.1]).
    Used to turn a non-trivial socle into a contradiction with irretractability.
  • standard math A p-brace has non-trivial fix: an action of a finite p-group on a finite p-group has a non-trivial fixed point (Proposition 1.9).
    Provides non-zero f in Fix(G(X)) in the proof of Theorem 4.2 and Lemma 5.4.
  • ad hoc to paper The computational checks in Lemma 5.10 for v=3 (GAP library YangBaxter) and v=4 (Savile Row) are exhaustive and correctly encode all constraints.
    These finite searches are the base cases of the induction proving Theorem 5.1; the paper gives no machine-readable certificate, solver log, or complete code listing.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Endocabling of involutive solutions to the Yang-Baxter equation, with an application to solutions whose diagonal is a cyclic permutation." pith.science (2026). https://pith.science/paper/SPNDEB4X

@misc{pith2026250414339,
  author       = {Pith},
  title        = {Pith review of: Endocabling of involutive solutions to the Yang-Baxter equation, with an application to solutions whose diagonal is a cyclic permutation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SPNDEB4X}},
  note         = {Machine review of arXiv:2504.14339}
}
abstract

In this article, we introduce endocabling as a technique to deform involutive, non-degenerate set-theoretic solutions to the Yang-Baxter equation (``solutions'', for short) by means of $\lambda$-endomorphisms of their associated permutation brace, thus generalizing the cabling method by Lebed, Vendramin and Ram\'{i}rez. In the first part of the article, we define endocabling and investigate the behaviour of solutions and their invariants under endocabling. In the second part, we apply our findings to solutions of size $n$ whose diagonal map is an $n$-cycle: we will prove that solutions with this property whose size is an odd prime power, are of finite multipermutation level. Furthermore, solutions with this property whose size is a power of $2$, will be proven either to be of finite multipermutation level or to admit an iterated retraction onto a unique solution of size $4$. We formulate our results in the language of cycle sets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. One-generator skew braces and indecomposable set-theoretic solutions to the Yang-Baxter equation

    math.QA 2025-06 conditional novelty 7.0 of 10

    Finite one-generator skew braces correspond exactly to indecomposable solutions whose q-cycle set is generated by one element, with irreducible solutions matching braces generated by every element.

Reference graph

Works this paper leans on

30 extracted references · 21 canonical work pages · cited by 1 Pith paper

  1. [1]

    Bachiller, F

    D. Bachiller, F. Ced´ o, E. Jespers, and J. Okni´ nski. A family of irretractable square-free solutions of the Yang- Baxter equation. Forum Math., 29(6):1291–1306, 2017

    work page 2017

  2. [2]

    R. J. Baxter. Partition function of the eight-vertex lattice model. Ann. Physics, 70(1):193–228, 1972

    1972

  3. [3]

    Camp-Mora and R

    S. Camp-Mora and R. Sastriques. A Criterion for Decomposabilty in QYBE. International Mathematics Research Notices, 2023(5):3808–3813, 2021

    work page 2023

  4. [4]

    Ced´ o, E

    F. Ced´ o, E. Jespers, and J. Okni´ nski. Braces and the Yang-Baxter equation.Comm. Math. Phys. , 327(1):101– 116, 2014

    work page 2014

  5. [5]

    Ced´ o and J

    F. Ced´ o and J. Okni´ nski. Indecomposable solutions of the Yang–Baxter equation of square-free cardinality. Advances in Mathematics, 430:109221, 2023

    2023

  6. [6]

    H. Cohen. Number Theory - Volume I: Tools and Diophantine Equations , volume 239 of Graduate Texts in Mathematics. Springer, 2007

    work page 2007

  7. [7]

    Colazzo and A

    I. Colazzo and A. V. Antwerpen. On the cabling of non-involutive set-theoretic solutions of the Yang–Baxter equation. arXiv.2410.23821, 2024

    work page arXiv 2024

  8. [8]

    Colazzo, E

    I. Colazzo, E. Jespers, L. Kubat, A. Van Antwerpen, and C. Verwimp. Finite idempotent set-theoretic solutions of the yang–baxter equation. International Mathematics Research Notices, 2024(7):5458–5489, 2023

    work page 2024

Show all 30 references
  1. [9]

    Colazzo, E

    I. Colazzo, E. Jespers, A. Van Antwerpen, and C. Verwimp. Left non-degenerate set-theoretic solutions of the Yang-Baxter equation and semitrusses. Journal of Algebra, 610:409–462, 2022

    2022

  2. [10]

    Dehornoy

    P. Dehornoy. Set-theoretic solutions of the Yang–Baxter equation, RC-calculus, and Garside germs. Adv. Math., 282:93–127, 2015

    2015

  3. [11]

    Dietzel, S

    C. Dietzel, S. Properzi, and S. Trappeniers. Indecomposable involutive set-theoretical solutions to the Yang–Baxter equation of size p2. Communications in Algebra, 53(3):1238–1256, 2025

    2025

  4. [12]

    V. G. Drinfeld. On some unsolved problems in quantum group theory. In Quantum Groups, pages 1–8, Berlin, Heidelberg, 1992. Springer Berlin Heidelberg

    1992

  5. [13]

    Eisermann

    M. Eisermann. Yang–Baxter deformations of quandles and racks. Algebraic & Geometric Topology , 5(2):537 – 562, 2005

    2005

  6. [14]

    Etingof, T

    P. Etingof, T. Schedler, and A. Soloviev. Set-theoretical solutions to the quantum Yang-Baxter equation. Duke Math. J., 100(2):169 – 209, 1999

    1999

  7. [15]

    Feingesicht

    E. Feingesicht. Dehornoy’s class and Sylows for set-theoretical solutions of the Yang–Baxter equation. Interna- tional Journal of Algebra and Computation , 34(01):147–173, 2024

    2024

  8. [16]

    Gateva-Ivanova and M

    T. Gateva-Ivanova and M. Van den Bergh. Semigroups of I-type. J. Algebra, 206:97–112, 1998

    1998

  9. [17]

    Guarnieri and L

    L. Guarnieri and L. Vendramin. Skew braces and the Yang-Baxter equation. Math. Comp., 86(307):2519–2534, 2017

    2017

  10. [18]

    V. F. R. Jones. Hecke algebra representations of braid groups and link polynomials. Annals of Mathematics , 126(2):335–388, 1987

    1987

  11. [19]

    Lebed, S

    V. Lebed, S. Ram´ ırez, and L. Vendramin. Involutive Yang-Baxter: cabling, decomposability, Dehornoy class. Revista Matem´ atica Iberoamericana, 40(2):623–635, 2024

    2024

  12. [20]

    J.-H. Lu, M. Yan, and Y.-C. Zhu. On the set-theoretical Yang-Baxter equation. Duke Mathematical Journal , 104(1):1 – 18, 2000

    2000

  13. [21]

    Nightingale, ¨Ozg¨ ur Akg¨ un, I

    P. Nightingale, ¨Ozg¨ ur Akg¨ un, I. P. Gent, C. Jefferson, I. Miguel, and P. Spracklen. Automatically improving constraint models in savile row. Artificial Intelligence, 251:35–61, 2017

    2017

  14. [22]

    Ram´ ırez and L

    S. Ram´ ırez and L. Vendramin. Decomposition Theorems for Involutive Solutions to the Yang–Baxter Equation. International Mathematics Research Notices, 2022(22):18078–18091, 08 2021. ENDOCABLING OF SOLUTIONS / SOLUTIONS WHOSE DIAGONAL IS A CYCLIC PERMUTATION 25

    2022

  15. [23]

    W. Rump. A decomposition theorem for square-free unitary solutions of the quantum Yang-Baxter equation. Adv. Math., 193(1):40–55, 2005

    2005

  16. [24]

    W. Rump. Braces, radical rings, and the quantum Yang–Baxter equation. J. Algebra, 307(1):153–170, 2007

    2007

  17. [25]

    W. Rump. Classification of cyclic braces. Journal of Pure and Applied Algebra , 209(3):671–685, 2007

    2007

  18. [26]

    W. Rump. Primes in coverings of indecomposable involutive set-theoretic solutions to the Yang-Baxter equation. Bulletin of the Belgian Mathematical Society , 30(2):260 – 280, 2023

    2023

  19. [27]

    Stanovsk´ y and P

    D. Stanovsk´ y and P. Vojtˇ echovsk´ y. Idempotent solutions of the Yang-Baxter equation and twisted group division. Fundam. Math., 255(1):51–68, 2021

    2021

  20. [28]

    Stefanello and S

    L. Stefanello and S. Trappeniers. On bi-skew braces and brace blocks. Journal of Pure and Applied Algebra , 227(5):107295, 2023

    2023

  21. [29]

    V. G. Turaev. The Yang-Baxter equation and invariants of links. Invent. Math., 92:527–553, 1988

    1988

  22. [30]

    C. N. Yang. Some exact results for the many-body problem in one dimension with repulsive delta-function interaction. Phys. Rev. Lett., 19:1312–1315, 1967. Appendix: Savile Row code for Lemma 5.10 language ESSENCE’ 1.0 find C : matrix indexed by [int(0..15),int(0..15)] of int(0...

    1967

Pith tools

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