REVIEW 4 major objections 5 minor 36 references
Distributive Mendelsohn triple systems and the Eisenstein integers
T0 review · 4 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Every distributive Mendelsohn triple system of order coprime with 3 decomposes via the Eisenstein integers.
desk verdict Real structural classification with a fixable but real enumeration bug; worth peer review despite the error. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the Eisenstein integer ring $\mathbb{Z}[\zeta]=\mathbb{Z}[X]/(X^2-X+1)$ with $\zeta=e^{\pi i/3}$. A linear Mendelsohn quasigroup $\operatorname{Lin}(M,R)$ on an abelian group $M$ is exactly an Eisenstein module: multiplication is $xy=xR+y(1-R)$, and the semisymmetric law forces $R^2-R+1=0$, so $R$ acts as $\zeta$. Because $\mathbb{Z}[\zeta]$ is a Euclidean domain, every finite module splits into cyclic primary components $\mathbb{Z}[\zeta]/(\pi^n)$, and the prime classification separates split primes ($p\equiv1\pmod3$), inert primes ($p\equiv2\pmod3$), and the ramified prime $(1+\zeta)$. The key technical lemma shows that over $\mathbb{Z}/p^n$ with $p\equiv2\pmod3$, every $2\times2$ matrix annihilated by $X^2-X+1$ has determinant and trace $1$, so it is similar to the companion matrix; this pins down the unique inert factor.
What would settle it
Perform the missing exhaustive search over $M_2(\mathbb{Z}/9)$: a single matrix $A$ with $A^2-A+I=0$ and $\det(A)\neq1$ would refute Lemma 3.4 and remove the uniqueness of the inert factor $\operatorname{Lin}(\mathbb{Z}/q^n[\zeta])$ from Theorem 3.7.
Extended reading notes
Core claim
The central claim is Theorem 3.7: if $Q$ is a distributive Mendelsohn quasigroup of order $n=\prod_i p_i^{r_i}\prod_j q_j^{s_j}$, with $p_i\equiv1\pmod3$ and $q_j\equiv2\pmod3$, then $Q$ is isomorphic to a direct product of factors $\operatorname{Lin}(\mathbb{Z}/p^{t},a)$, where $a$ is a root of $X^2-X+1$ modulo $p^{t}$, and factors $\operatorname{Lin}(\mathbb{Z}/q^{u}[\zeta])$, the unique class on the module $(\mathbb{Z}/q^u)^2$ with multiplication by the companion matrix of that polynomial. Each way of splitting the exponent $r_i$ into a partition of $t$-values gives a different isomorphism class, so the number $d(p^n)$ of classes is a sum over integer partitions of $n$ for $p\equiv1\pmod3$, while $p\equiv2\pmod3$ gives $d(p^{2n})=PE(n)$, the number of partitions of $2n$ into even parts. Theorem 5.13 adds that for any entropic (abelian-group-linear) MTS, non-ramified, pure, and self-orthogonal are equivalent.
Load-bearing premise
The classification of the inert-prime and even-ramified factors rests on Lemma 3.4, whose verification for matrices over $\mathbb{Z}/9$ is a computer calculation not included in the manuscript; if that check fails, the companion-matrix form for those factors is not established.
Editorial extensions
If this is right
- Every DNR MTS is pure: no two distinct points commute under the quasigroup multiplication.
- For $p\equiv1\pmod3$, $d(p^n)=\sum_{(\mathcal X,\mu)\vdash n}\sum_{r\in\mathcal X}(\mu(r)+1)$; for $p\equiv2\pmod3$, $d(p^n)=PE(n)$, so in particular $d(p^{2k+1})=0$.
- A DNR MTS is self-converse exactly when all primes dividing its order are $2\pmod3$.
- Entropic MTS of order divisible by $3$ are never pure; the paper conjectures the isomorphism classes of order $3^n$ are counted by the partition number $P(n)$.
- Every distributive Mendelsohn quasigroup is principally isotopic to a left Eisenstein quasigroup, linking these systems to $3$-web coordinatization.
Reading between the lines
- Beyond the paper: the theorem gives an isomorphism certificate: two DNR MTS of the same order are isomorphic exactly when their split-prime partition data and root choices agree, so isomorphism testing reduces to comparing partition records.
- Beyond the paper: the same partition-counting pattern across split, inert, and ramified primes suggests a uniform conjecture for all linear MTS: the number of isomorphism classes of a fixed order should always be a partition count of the exponents, with split primes contributing root multiplicities.
- Beyond the paper: the principal isotopy to a left Eisenstein quasigroup raises the possibility of reading the triples of an MTS as coordinates in a $3$-web over an Eisenstein module, a geometric reading the manuscript does not pursue.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies distributive Mendelsohn triple systems (MTS), i.e., Mendelsohn quasigroups that are self-distributive, and focuses on the case of order coprime with 3, called distributive non-ramified (DNR). The main structural theorem, Theorem 3.7, states that every DNR MTS is a direct product of linear MTS of the form Lin(Z/p^t, a) for primes p ≡ 1 mod 3 and Lin(Z/q^u[ζ]) for primes q ≡ 2 mod 3. This is obtained by representing entropic Mendelsohn quasigroups as finite modules over the Eisenstein integers Z[ζ] via a functor in Theorem 2.15, then applying the structure theory of modules over a PID. The paper also proposes an enumeration of isomorphism classes in Theorem 3.8, gives partial results for orders divisible by 3, proves that an entropic MTS is non-ramified iff it is pure iff it is self-orthogonal, and discusses self-converse systems. The core classification framework is elegant and appears sound, but the paper contains several false or unsupported load-bearing claims, especially in the enumeration formula for p ≡ 1 mod 3 and in the characterization of self-converse systems.
Significance. If the results were correct as stated, the paper would be a significant contribution: it gives a structural classification of all distributive Mendelsohn triple systems of order coprime with 3 using the Eisenstein integers, extends earlier work by Donovan, Griggs, McCourt, Opršal, and Stanovský, and provides a uniform module-theoretic framework that is parameter-free and derived from standard theorems (Fischer-Galkin-Smith, Kepka-Nemec, Bruck-Murdoch-Toyoda). The classification theorem is conceptually clean and likely correct. However, the enumeration claim in Theorem 3.8(a) is false, the self-converse characterization in Theorem 5.9 is false, and a key lemma used in the ramified case relies on an unshipped computer calculation. These errors affect both the abstract's enumeration promise and several secondary theorems, so the paper cannot be accepted in its present form. The strengths of the framework justify asking for a major revision rather than immediate rejection.
major comments (4)
- [Theorem 3.8(a), Eq. (3.5)] The enumeration formula (3.5) is incorrect: for a fixed partition (X, μ) of n, the choices of root a vs. a^{-1} on the μ(r) copies of Z/p^r are independent across distinct part sizes r, because these copies correspond to distinct primary components of the Z[ζ]-module with different annihilators, and Theorem 2.12 identifies quasigroup isomorphism with module isomorphism. The count for a fixed partition is therefore ∏_{r∈X}(μ(r)+1), not Σ_{r∈X}(μ(r)+1). For example, the partition (2,1,1) of n=4 gives (1+1)(2+1)=6 classes, not 5, and summing over all partitions of 4 gives 20, not 19. The proof's sentence 'This count applies to each element of X' incorrectly converts a product of independent choices into a sum. Replacing the inner sum by a product repairs the enumeration and does not affect Theorem 3.7.
- [Lemma 5.8 and Theorem 5.9] The converse of Lemma 5.8 is false: an isomorphism between direct products need not restrict to isomorphisms of the individual factors, and for linear MTS the relevant automorphism may permute factors. Consequently Theorem 5.9 is false. For p ≡ 1 mod 3, the DNR MTS Lin(Z/p, a) × Lin(Z/p, a^{-1}) is self-converse, since the swap automorphism of (Z/p)^2 conjugates the diagonal action diag(a, a^{-1}) to its inverse, yet its order has a prime p ≡ 1 mod 3. The correct self-converse criterion is a symmetry condition on the multiset of exponents attached to π and π̅ for each p ≡ 1 mod 3, not the condition that all primes dividing the order be ≡ 2 mod 3. This also invalidates Conjecture 5.10 and the self-converse portion of the theorem stated in the introduction.
- [Lemma 3.4 (case S = Z/3^n)] The proof of Lemma 3.4 for S = Z/9 depends on a GAP verification that is not shipped, and the argument for n ≥ 3 reduces to that verification. Since Lemma 3.4 is used in Proposition 5.4 and in the proof of the equivalence Theorem 5.13 for all entropic MTS, the computation (code and output, or a mathematical proof) must be included before the claimed equivalence is established. This is a missing support for a stated theorem, not merely a presentation issue.
- [Introduction, second displayed theorem] The introductory theorem characterizing DNR MTS states that an entropic Mendelsohn triple system has order coprime with 3 if and only if it is pure if and only if it is 'self-converse (orthogonal to its converse).' This conflates two distinct notions: self-converse means isomorphic to the converse (Definition 5.7), while 'orthogonal to its converse' is self-orthogonality (Definition 5.11). The paper's own Theorem 5.9 and Theorem 5.13 give different characterizations for these two properties, so the introductory statement is internally inconsistent and must be corrected.
minor comments (5)
- [Lemma 3.4 statement] As written, Lemma 3.4 quantifies over a prime p ≡ 2 mod 3 and then allows S = Z/3^n; since 3 is not congruent to 2 mod 3, the lemma should be split into separate cases for Z, for Z/p^n with p ≡ 2 mod 3, and for Z/3^n.
- [Example 2.13] In Example 2.13, the text 'Lin(Z/7, 3), Lin(Z/7, 3)' should presumably read 'Lin(Z/7, 5)' in the second occurrence.
- [Section 4, Proposition 4.2] There is a typo in Proposition 4.2 ('By Theorem, 2.23.(c)') and a missing comma after 'Theorem'.
- [Global terminology] The acronym DNR is introduced as 'distributive, non-ramified'; the standard English term is 'unramified'. Consider using 'unramified' throughout for consistency with number-theoretic usage.
- [Proposition 3.5 proof] The proof of Proposition 3.5 invokes Nakayama's lemma and a result from [28] after reducing modulo p; the reduction step is only sketched. A sentence explaining why the lifted minimal generating set is a basis (beyond the cited theorem) would help the reader.
Circularity Check
No significant circularity found: the classification is derived from external structure theorems and module theory, with no fitted inputs or self-citation chain; remaining caveats are correctness concerns, not circularity.
full rationale
The paper's derivation chain is self-contained relative to its stated external tools. The main classification Theorem 3.7 follows from the Fischer-Galkin-Smith decomposition (Theorem 2.10), the Kepka-Nemec isomorphism criterion (Theorem 2.12), the faithful dense functor from Z[zeta]-modules to linear MTS (Theorem 2.15), the structure theorem for modules over the PID Z[zeta] (Theorem 2.17), the quotient classification (Theorem 2.23), and the factor classifications in Propositions 3.3 and 3.5. None of these steps defines its target in terms of itself, and no parameter is fitted to data and then renamed as a prediction. Citations to Donovan et al. [13] and to Kepka-Nemec [22] are external, not self-citations, and they provide independent support rather than a load-bearing self-citation chain. The paper also openly labels Conjecture 4.6 as a conjecture, so there is no circular presentation of that case as a derived result. Two caveats should be recorded, but they are not circularity. First, Lemma 3.4's Z/9 case rests on an unshipped GAP computation: 'By analyzing congruence relations for 2 x 2 integral matrices modulo 9 in GAP, we were able to verify that no matrix in M2(Z/9) annihilated by f(X) has both off-diagonal entries divisible by 3.' This is a missing-support/correctness gap, not a circular reduction, because the computation is an independent check and does not restate the target classification. Second, the enumeration formula in Theorem 3.8(a) appears to add independent factor choices instead of multiplying them: for a fixed partition (X,mu), the choices of root a versus a^{-1} on distinct primary components are independent, so the count for that partition should be the product over r in X of (mu(r)+1), not the sum. This is a mathematical correctness issue in the enumeration claim, not circularity, and it does not affect the structural classification Theorem 3.7. Overall, the central claim is not forced by definition, by fitted parameters, or by a self-citation chain.
Assumptions & free parameters
assumptions (7)
- standard math Z[zeta] is a Euclidean domain and a PID
- standard math Fischer-Galkin-Smith decomposition (Theorem 2.10)
- standard math Kepka-Nemec isomorphism theorem (Theorem 2.12)
- domain assumption Lemma 3.2 on roots of X^2-X+1 modulo p^n
- ad hoc to paper GAP verification that no 2x2 matrix over Z/9 annihilated by f has both off-diagonal entries divisible by 3
- standard math Prokip's similarity criterion over commutative rings ([28, Th. 1])
- standard math Hillar-Rhea description of automorphisms of finite abelian groups ([18])
Cite this review
Pith. "Pith review of Distributive Mendelsohn triple systems and the Eisenstein integers." pith.science (2026). https://pith.science/paper/D6QO7FGA
@misc{pith2026190804966,
author = {Pith},
title = {Pith review of: Distributive Mendelsohn triple systems and the Eisenstein integers},
year = {2026},
howpublished = {\url{https://pith.science/paper/D6QO7FGA}},
note = {Machine review of arXiv:1908.04966}
}
abstract
We define a Mendelsohn triple system (MTS) with self-distributive quasigroup multiplication and order coprime with $3$ to be distributive, non-ramified (DNR). We classify, up to isomorphism, all DNR MTS and enumerate isomorphism classes (extending the work of Donovan, Griggs, McCourt, Opr\v{s}al, and Stanovsk\'{y}). The classification is accomplished via the representation theory of the Eisenstein integers, $\mathbb{Z}[\zeta]=\mathbb{Z}[X]/(X^2-X+1)$. Containing the class of DNR MTS is that of MTS with an entropic (linear over an abelian group) quasigroup operation. Partial results on the classification of entropic MTS with order divisible by $3$ are given, and a complete classification is conjectured. We also prove that for any entropic MTS, the qualities of being non-ramified, pure, and self-orthogonal are equivalent. We introduce the varieties $\mathbf{RE}$ and $\mathbf{LE}$ of (resp. right and left) Eisenstein quasigroups, whose respective linear representation theories correspond to the alternative presentation $\mathbb{Z}[X]/(X^2+X+1)$ of the Eisenstein integers.
Reference graph
Works this paper leans on
-
[1]
N. Andruskiewitsch and M. Gra˜ na,From racks to pointed Hopf algebras, Adv. Math., 178 (2003) 177-243
work page 2003
-
[2]
V. D. Belousov, On structure of distributive quasigroups , Math. Sb. (N. S.), 50(92) 1960, 267-298 (Russian)
work page 1960
-
[3]
F. E. Bennett and N. S. Mendelsohn, On pure cyclic triple systems and semisym- metric quasigroups , Ars Combin., 5 (1978), 13-22
work page 1978
-
[4]
R. H. Bruck, Some results in the theory of quasigroups , Trans. Amer. Math. Soc., 55 (1944), 19-52
work page 1944
-
[5]
Bu¸ caj, Finding factors of factor rings over the Eisenstein integer s, Int
V. Bu¸ caj, Finding factors of factor rings over the Eisenstein integer s, Int. Math. Forum, 9 (2014), 1521-1537. MTS AND THE EISENSTEIN INTEGERS 29
work page 2014
-
[6]
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra , The Millennium Edition, 2012,
work page 2012
- [7]
- [8]
Show all 36 references
-
[9]
C. J. Colbourn and A. Rosa, Directed and Mendelsohn triple syste ms, in Contem- porary Design Theory: A Collection of Surveys , Wiley, Hoboken, NJ, 97-136
-
[10]
Dehernoy, Braids and Self-Distributivity , Birkh¨ auser, Basel, 2000
P. Dehernoy, Braids and Self-Distributivity , Birkh¨ auser, Basel, 2000
2000
-
[11]
Diamond and J
F. Diamond and J. Shurman, A First Course in Modular Forms , Springer, New York, 2005
2005
-
[12]
J. W. Di Paola and E. Nemeth, Generalized triple systems and medial quasigroups , in Proc. Seventh Conf. Combinatorics, Graph Theory, and Computin g, 1976, Congres- sus Numerantium, No. XVII (Utilitas Math., Winnipeg Manitoba, 1976) , 298-306
1976
-
[13]
D. M. Donovan, T. S. Griggs, T. A. McCourt, J. Oprˇ sal, and D. Stanovsk´ y,Dis- tributive and anti-distributive Mendelsohn triple system s, Canadian Math. Bull., 59 (2016), 36-49
2016
-
[14]
Fischer, Distributive quasigruppen endlicher ordnung , Math
B. Fischer, Distributive quasigruppen endlicher ordnung , Math. Z., 83 (1964), 267- 303 (German)
1964
-
[15]
V. M. Galkin, Finite distributive quasigroups , Mat. Zametki, 24 (1978), 39-41 (Rus- sian)
1978
-
[16]
The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.10.1 ; 2019, https://www.gap-system.org
2019
-
[17]
G. H. Hardy and E. M Wright, An Introduction to the Theory of Numbers , 4th edition, Oxford Univ. Press, Oxford, 1960
1960
-
[18]
C. J. Hillar and D. L. Rhea, Automorphisms of finite abelian groups , Amer. Math. Monthly, 114 (2007), 917-923
2007
-
[19]
Ireland and M
K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory , 2nd edition, Springer, Berlin, 1990
1990
-
[20]
Jedliˇ cka, D
P. Jedliˇ cka, D. Stanovsk´ y, and P. Vojtˇ echovsk´ y,Distributive and trimedial quasi- groups of order 243, Discrete Math., 340 (2017), 404-415
2017
-
[21]
Joyce, A classifying invariant of knots, the knot quandle , J
D. Joyce, A classifying invariant of knots, the knot quandle , J. Pure Appl. Algebra, 23 (1982), 37-65
1982
-
[22]
Kepka and P
T. Kepka and P. Nˆ emec, Commutative Moufang loops and distributive groupoids of small orders , Czechoslovak Math. J., 31 (1981), 633-669
1981
-
[23]
Matsumura, Commutative Ring Theory , Cambridge Univ
H. Matsumura, Commutative Ring Theory , Cambridge Univ. Press, Cambridge UK, 1989
1989
-
[24]
N. S. Mendelsohn, A natural generalization of Steiner triple systems , Computers in number theory (Proc. Sci. Res. Council Atlas Sympos. no. 2, Oxf ord, 1969), Academic Press, London, 1971, 323–338
1969
-
[25]
Misaghian, Factor rings and their decomposition in the Eisenstein inte gers ring Z[ω ], Armenian J
M. Misaghian, Factor rings and their decomposition in the Eisenstein inte gers ring Z[ω ], Armenian J. Math., 5 (2013), 58-68
2013
-
[26]
D. C. Murdoch, Structure of abelian quasi-groups , Trans. Amer. Math. Soc., 49 (1941), 392-409
1941
-
[27]
P. T. Nagy and K. Strambach, Loops, their cores and symmetric spaces , Israel J. Math., 105 (1998), 285-322
1998
-
[28]
Prokip, On similarity of matrices over commutative rings , Linear Algebra Appl., 399 (2005), 225-233
V. Prokip, On similarity of matrices over commutative rings , Linear Algebra Appl., 399 (2005), 225-233. 30 A. W. NOW AK
2005
-
[29]
Sabinin, Smooth Quasigroups and Loops , Springer, Dordrecht, 1999
L. Sabinin, Smooth Quasigroups and Loops , Springer, Dordrecht, 1999
1999
-
[30]
Sade, Quasigroupes demi-sym´ etriques
A. Sade, Quasigroupes demi-sym´ etriques. Isotopies pr´ eservant la demi-sym´ etrie, Math. Nacr., 33 (1967), 177-188 (French)
1967
-
[31]
Sade, Quasigroupes demi-sym´ etriques
A. Sade, Quasigroupes demi-sym´ etriques. III. Constructions lin´eares, A-maps, Ann. Soc. Sci. Bruxelles S´ er I., 81 (1967), 5-17 (French)
1967
-
[32]
J. D. H. Smith, Finite distributive quasigroups , Math. Proc. Cambridge Philos. Soc., 80 (1976), 37-41
1976
-
[33]
J. D. H. Smith, An Introduction to Quasigroups and Their Representations, CRC Press, Boca Raton, FL, 2007
2007
-
[34]
J. D. H. Smith, Quasigroup homotopies, semisymmetrization, and reversib le au- tomata, Internat. J. Algebra Comput., 18 (2008), 1203-1221
2008
-
[35]
Stanovsk´ y, A guide to self-distributive quasigroups, or Latin quandle s, Quasi- groups and Related Systems, 23 (2015), 129-163
D. Stanovsk´ y, A guide to self-distributive quasigroups, or Latin quandle s, Quasi- groups and Related Systems, 23 (2015), 129-163
2015
-
[36]
Toyoda, On axioms of linear functions , Proc
K. Toyoda, On axioms of linear functions , Proc. Imp. Acad. Tokyo, 17 (1941), 221-227
1941
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.