Pith. sign in

REVIEW 4 major objections 4 minor 32 references

Isotopisms of quadratic quasigroups

T0 review · 4 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Quadratic quasigroups of order q are isotopic exactly when a field automorphism relates their defining pairs, with one exception for the diagonal case a=b; for a≠b every autotopism is an automorphism.

desk verdict Solid extension of the isomorphism classification to isotopisms and autotopisms, but the main theorem leans on character-sum estimates the paper never actually shows. read the letter →

arxiv 2506.02446 v1 pith:PD5H7YGC submitted 2025-06-03 math.CO math.GR

Jack Allsop This is my paper
classification math.COmath.GR MSC 05B1520N0512E20
keywords quadraticquasigroupsisotopismsautotopismsLatinsquaresintercalatesfinitefieldsautomorphismgroups2-transitivepermutation
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

This paper aims to complete the equivalence classification of quadratic quasigroups, finite quasigroups built from a field by choosing one of two multipliers, a or b, according to whether the difference of two elements is a square. It proves that two quadratic quasigroups of order q are isotopic exactly when an automorphism of the field sends one defining pair to the other, with one degenerate exception where both pairs are equal singletons. In particular, for distinct a and b, isotopy between quadratic quasigroups is no more flexible than isomorphism. The paper also proves that for a≠b every autotopism is an automorphism, so the autotopism group coincides with the known automorphism group, and counts the intercalates, the 2×2 subsquares, in quadratic Latin squares as a tool. A reader should care because this settles the natural next question after the known isomorphism and automorphism classifications for a widely used family of quasigroups and Latin squares.

What carries the argument

The argument is carried by the quadratic character map φ(x)=ax when χ(x)=1 and bx otherwise, which encodes the quasigroup operation, and by the row-permutation identity r_{i,j}=τ_j∘φ∘τ_{i−j}∘$φ^{{-1}}$∘τ_{−i} for the corresponding Latin square. Intercalates correspond exactly to transpositions in these row permutations, so the paper counts 2×2 subsquares by counting transpositions using quadratic character-sum estimates of Weil type and a classification of finite 2-transitive permutation groups containing an elementary abelian regular subgroup. The latter classification, applied to each projection Atp_i(Q) of the autotopism group, is what forces a nontrivial autotopism back into the affine group and ultimately collapses it to an automorphism.

What would settle it

Exhaustively enumerate all quadratic quasigroups of order at most 23 and test every pair with a≠b and a'≠b' for an isotopism; if any such pair is isotopic while no automorphism of F_q relates their parameter pairs, Theorem 1.3 is false. Independently, recompute the intercalate counts for all valid parameter pairs of those orders and compare them with Theorem 1.6.

Watch

Extended reading notes

Core claim

The central discovery is Theorem 1.3: the quadratic quasigroups Q_{a,b} and Q_{a',b'} of order q are isotopic if and only if either there exists θ∈Aut(F_q) with {a,b}={θ(a'),θ(b')}, or a=b and a'=b'. Together with Theorem 1.4, the paper shows that when a≠b the autotopism group Atp(Q_{a,b}) equals Aut(Q_{a,b}), so every isotopism of a non-degenerate quadratic quasigroup is actually an isomorphism; when a=b the autotopism group is the semidirect product $T_q^{2}$⋊GL_d(p), whose elements have an explicit three-translation form. The proof proceeds by counting intercalates in the associated quadratic Latin square, showing the generic count is 0 or q(q−1), with Θ($q^{3}$) counts in three exceptional parameter families, and then uses structural bounds on 2-transitive permutation groups to force each coordinate projection of an autotopism into the affine group.

Load-bearing premise

The main theorem for all orders rests on the assertion that all orders up to 23 were verified by computer, but the paper includes neither the code nor the output; if that verification is wrong, the complete classification is not established.

Editorial extensions

If this is right

  • For a≠b, any isotopism between quadratic quasigroups is an isomorphism, so isotopic equivalence classes of these quasigroups coincide with their isomorphism classes.
  • The autotopism group of every quadratic quasigroup is now known: the diagonal case a=b contributes a semidirect product T_q^2⋊GL_d(p) of translations, while non-diagonal cases add no new symmetries beyond automorphisms.
  • A generic quadratic Latin square contains either no intercalates or exactly q(q−1) intercalates; the three exceptional parameter families produce Θ(q^3) intercalates, within a constant factor of the maximum possible for any Latin square of that order.
  • There are at least Ω(q^2/log q) species of Latin squares of order q that contain an N2 quadratic Latin square, since isotopy classes of these squares now have a precise orbit description.
  • In the language of cyclotomic orthomorphisms of least index 2, any two isotopic quasigroups generated by such maps are isomorphic, and every autotopism of one is an automorphism.

Reading between the lines

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

  • A reader who wants the complete classification for all orders must supply the promised computer verification for q≤23, since the paper provides neither code nor output for that part of the proof.
  • The proof strategy suggests a broader principle for quasigroup families defined by cyclotomic orthomorphisms of least index n: isotopy may collapse to isomorphism precisely when no group-like diagonal case interferes, and the paper's counterexamples for n=4 and n=6 mark the boundary worth mapping.
  • The transposition-counting method developed for intercalates may transfer to other cyclotomic Latin squares: whenever row permutations admit a similar four-signature classification, one can expect exact or near-exact intercalate counts of the same form.
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 determines when quadratic quasigroups Q_{a,b} of odd prime-power order are isotopic and determines their autotopism groups. The central results are Theorem 1.3, which says that for a≠b and a′≠b′, isotopy between Q_{a,b} and Q_{a′,b′} is equivalent to isomorphism (i.e., {a,b}={θ(a′),θ(b′)} for some θ∈Aut(F_q)), and Theorem 1.4, which says that for a≠b every autotopism is an automorphism, so Atp(Q)=Aut(Q). Along the way the paper counts intercalates in quadratic Latin squares (Theorem 1.6). The proof strategy is to count transpositions in row permutations, then analyze the projections of the autotopism group, using a classification of 2-transitive groups with an elementary abelian regular subgroup. The arguments are structured in six sections: intercalate counts (§2), autotopisms with affine-linear components (§3), non-2-transitive projections (§4), 2-transitive projections (§5), and assembly of the main theorems (§6).

Significance. If correct, the paper resolves a natural question left open by Drápal–Wanless's isomorphism and automorphism results, and the intercalate counting theorem is of independent interest. The main theorems are clean and the overall strategy is plausible. The paper makes good use of external results (Weil, Li, Browning–Stones–Wanless, Drápal–Wanless) and of the author's prior work, and the conclusions are stated in a falsifiable, parameter-free form. However, the central proof relies on several technical character-sum estimates that are asserted without details, and on an unprovided computer verification for small orders; as written, the verification is incomplete even if the underlying arguments are likely correct. The contribution is significant but the manuscript currently is not fully self-contained in the places that support the main theorems.

major comments (4)
  1. [§3, Lemma 3.1] The proof of Lemma 3.1 contains the sentence 'We can use Theorem 2.11 and Theorem 2.12 in the usual way to show that Y(x) ≠ ∅ for all x ∈ X. This conclusion relies on the fact that q > 23.' This nonemptiness is load-bearing: it is the step that yields χ(g(a^{-1}x)+v)=1 for all x∈X, which leads to the contradiction between 'at least q−5 elements' and 'exactly (q−1)/2 elements' and forces v=0. Without an explicit Weil-bound calculation, Lemma 3.1, and hence Theorem 1.4 and Theorem 1.3 in the a≠b case, are unsupported. A similar 'usual way' assertion is used later in the same lemma to produce the element k. Please supply the complete estimates: the polynomials involved, their root multiplicities, and the resulting lower bound for |Y(x)| uniformly in x∈X, or give a precise citation to an identical calculation in the literature.
  2. [§2, Lemma 2.13 and Lemmas 2.6/2.7/2.9/2.10] The proof of Lemma 2.13 jumps from 'Expanding W ... we can write S as a sum ...' to 'Doing this, we obtain the following inequalities' without displaying the expansion or the application of Theorems 2.11 and 2.12. Lemma 2.13 is used in Lemma 2.15 and again in Lemma 5.8, where it is needed to rule out the PGL_u(2) case in Theorem 5.2. In addition, Lemmas 2.6, 2.7, 2.9, and 2.10 are justified only by 'following the proof of [1, Lemma 4.1]' or '[1, Lemma 4.2]'. Since these results are essential for Theorem 1.6 and for the transposition-counting input to Section 5, please either provide full proofs or itemize precisely which equations in [1] imply each of these four lemmas.
  3. [§3 and §6, small orders] The paper assumes q>23 in Sections 3–5, states 'Theorem 1.4 is easy to verify using a computer if q ≤ 23' in Section 3, but then in Section 6 says 'if q < 23' and concludes that Theorem 1.4 for a≠b and q ≥ 23 follows from Lemmas 3.1, 4.1, and 5.1 (which are proved only for q>23). The status of q=23 is therefore inconsistent: it is covered by the Section 3 statement but not by the Section 6 statement. Moreover, no code, pseudocode, or numerical output is supplied for the claimed q≤23 verification, so the reader cannot check this part of the theorem. Please provide a reproducible computation (e.g., a short GAP/Sage script enumerating all valid pairs (a,b) and all autotopisms for q≤23) and reconcile the ranges used throughout.
  4. [§5, Lemma 5.6] In the proof of Lemma 5.6 the exceptional case (u,v)=(3,8), which gives q=73, is excluded by the assertion 'We can use a computer to verify that PΓL_3(8) has no element of order 36.' This verification is needed to rule out case (iii) of Theorem 5.2 when v≠2. Please include the computation or give an explicit finite-group proof, such as listing possible element orders of PΓL_3(8), so that this exclusion is reproducible by the reader.
minor comments (4)
  1. [§2, after Lemma 2.13] There is a typo: 'technqiue' should be 'technique' in the sentence about the standard technique.
  2. [Theorem 1.3] The second bullet 'a=b and a′=b′' is redundant, since the first bullet already covers this case by taking θ=id. Consider removing it or rephrasing to avoid suggesting it is a separate condition.
  3. [§3, first paragraph] The notation 'q < 23' in Section 6 and 'q ≤ 23' in Section 3 should be made uniform; as noted in the major comments, this affects whether q=23 is verified or assumed.
  4. [§5, Lemma 5.8] The sentence 'By taking parastrophes, it suffices to prove the statement assuming that i=1' would benefit from a short explanation of why the number of fixed points and the number of transpositions are preserved under the parastrophic transformations used.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the isotopism and autotopism theorems are derived from external theorems and independent prior work, with no fitted input or self-referential reduction.

full rationale

Walking the derivation chain, no circular step is present. Theorem 1.3 is proved from Theorem 1.1 (Drápal–Wanless, external) and Theorem 1.4; Theorem 1.4 for a ≠ b is assembled from Lemma 3.1, Lemma 4.1, and Lemma 5.1. Lemma 3.1's hard step is a character-sum contradiction via Weil's bound (Theorems 2.11 and 2.12); although the estimate is suppressed ('We can use Theorem 2.11 and Theorem 2.12 in the usual way to show that Y(x) ≠ ∅ for all x ∈ X'), this is an omitted calculation, not an input renamed as an output. Lemmas 2.6–2.10 and 2.14 are cited from or proved by following the author's earlier paper [1], but [1] concerns cycles of quadratic Latin squares and is not the isotopism theorem being derived; no Theorem 1.3 or Theorem 1.4 statement is assumed in [1]. The intercalate-counting lemmas feed Lemma 5.8, which rules out PGL_u(2) projections by a bound on transpositions; again this bound is not the target classification. The a = b case uses the standard fact that Q_{a,a} is isotopic to the additive group and [13, Theorem 1.3]; no circularity. The conclusion's restatement (11)–(12) is a corollary, not a renaming that does the work. The small-q appeal to computer verification is unverified but explicitly outside the proof range q > 23 and is not a circularity. Overall score 0.

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

The paper introduces no free parameters or new entities. Its axioms are standard external theorems from finite field theory, permutation group classification, and Latin square theory. The only 'unpaid' ingredient is the asserted computer check for q≤23, which is not provided as an artefact.

assumptions (6)
  • standard math Weil bound on character sums over finite fields (Theorem 2.11)
    Used in Lemma 2.13 and elsewhere to estimate character sums of polynomial products.
  • standard math Bound on character sums of quadratic polynomials (Theorem 2.12)
    Used together with the Weil bound in the standard counting technique.
  • standard math Li's classification of finite 2-transitive permutation groups with abelian regular subgroup (Theorem 5.2)
    Used to constrain 2-transitive projections of the autotopism group in Section 5.
  • standard math Browning-Stones-Wanless bound on the number of autotopisms of a Latin square (equation (6))
    Used in Lemma 5.3 to rule out Sym and Alt as autotopism projections.
  • standard math Drápal-Wanless classification of automorphism groups of quadratic quasigroups (Theorem 1.2)
    Used as an external benchmark and in proving Theorem 1.3.
  • standard math Carlitz's theorem on permutations preserving quadratic character
    Used in the proof of Lemma 4.1 to show elements of the projection are affine.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Isotopisms of quadratic quasigroups." pith.science (2026). https://pith.science/paper/PD5H7YGC

@misc{pith2026250602446,
  author       = {Pith},
  title        = {Pith review of: Isotopisms of quadratic quasigroups},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PD5H7YGC}},
  note         = {Machine review of arXiv:2506.02446}
}
abstract

A quasigroup is a pair $(Q, \cdot)$ where $Q$ is a non-empty set and $\cdot$ is a binary operation on $Q$ such that for every $(u, v) \in Q^2$ there exists a unique $(x, y) \in Q^2$ such that $u \cdot x = v = y \cdot u$. Let $q$ be an odd prime power, let $\mathbb{F}_q$ denote the finite field of order $q$, and let $\mathcal{R}_q$ denote the set of non-zero squares in $\mathbb{F}_q$. Let $\{a, b\} \subseteq \mathbb{F}_q$ be such that $\{ab, (a-1)(b-1)\} \subseteq \mathcal{R}_q$. Let $\mathcal{Q}_{a, b}$ denote the quadratic quasigroup $(\mathbb{F}_q, *_{a, b})$ where $*_{a, b}$ is defined by \[ \left\{ \begin{array}{ll} x+a(y-x) & \text{if } y-x \in \mathcal{R}_q,\\ x+b(y-x) & \text{otherwise}. \end{array} \right. \] The operation table of a quadratic quasigroup is a quadratic Latin square. Recently, it has been determined exactly when two quadratic quasigroups are isomorphic and the automorphism group of any quadratic quasigroup has been determined. In this paper, we extend these results. We determine exactly when two quadratic quasigroups are isotopic and we determine the autotopism group of any quadratic quasigroup. In the process, we count the number of $2 \times 2$ subsquares in quadratic Latin squares.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

  1. [1]

    Cycles of quadratic Latin squares and antiperfect 1-factorisations

    J. Allsop. “Cycles of quadratic Latin squares and antiperfect 1-factorisations”. J. Combin. Des. 31.9 (2023), pp. 447–475

    work page 2023

  2. [2]

    Row-Hamiltonian Latin squares and Falconer varieties

    J. Allsop and I. M. Wanless. “Row-Hamiltonian Latin squares and Falconer varieties”. Pro- ceedings of the London Mathematical Society 128.1 (2024), 28pp

    work page 2024

  3. [3]

    Elements of quasigroup theory: a special course

    V. D. Belousov. “Elements of quasigroup theory: a special course”. Kishinev State University Printing House, Kishinev (1981)

    work page 1981

  4. [4]

    Bounds on the number of autotopisms and subsquares of a Latin square

    J. Browning, D. S. Stones, and I. M. Wanless. “Bounds on the number of autotopisms and subsquares of a Latin square”. Combinatorica 33.1 (2013), pp. 11–22

    work page 2013

  5. [5]

    Bounds on the number of small Latin subsquares

    J. M. Browning, P. J. Cameron, and I. M. Wanless. “Bounds on the number of small Latin subsquares”. J. Combin. Theory Ser. A 124 (2014), pp. 41–56

    work page 2014

  6. [6]

    Abelian regular subgroups of the affine group and radical rings

    A. Caranti, F. Dalla Volta, and M. Sala. “Abelian regular subgroups of the affine group and radical rings”. Publ. Math. Debrecen 69.3 (2006), pp. 297–308

    work page 2006

  7. [7]

    A theorem on permutations in a finite field

    L. Carlitz. “A theorem on permutations in a finite field”. Proc. Amer. Math. Soc. 11 (1960), pp. 456–459

    work page 1960

  8. [8]

    Latin bitrades derived from quasigroup autoparatopisms

    N. Cavenagh and R. Falc´ on. “Latin bitrades derived from quasigroup autoparatopisms”. arXiv:2308.14987 (2023)

    work page Pith review arXiv 2023

Show all 32 references
  1. [9]

    The cycle structure of two rows in a random Latin square

    N. J. Cavenagh, C. Greenhill, and I. M. Wanless. “The cycle structure of two rows in a random Latin square”. Random Structures Algorithms 33.3 (2008), pp. 286–309

    2008

  2. [10]

    Calculating the order of an invertible matrix

    F. Celler and C. R. Leedham-Green. “Calculating the order of an invertible matrix”. Groups and computation, II (New Brunswick, NJ, 1995) . Vol. 28. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. Amer. Math. Soc., Providence, RI, 1997, pp. 55–60

    1995

  3. [11]

    Intercalates everywhere

    P. Danziger and E. Mendelsohn. “Intercalates everywhere”. Geometry, combinatorial de- signs and related structures (Spetses, 1996) . Vol. 245. London Math. Soc. Lecture Note Ser. Cambridge Univ. Press, Cambridge, 1997, pp. 69–88

    1996

  4. [12]

    Finite primitive linear groups of prime degree

    J. D. Dixon and A. E. Zalesskii. “Finite primitive linear groups of prime degree”. J. London Math. Soc. (2) 57.1 (1998), pp. 126–134

    1998

  5. [13]

    Isomorphisms of quadratic quasigroups

    A. Dr´ apal and I. M. Wanless. “Isomorphisms of quadratic quasigroups”. Proc. Edinb. Math. Soc. (2) 66.4 (2023), pp. 1085–1109

    2023

  6. [14]

    Maximally nonassociative quasigroups via quadratic ortho- morphisms

    A. Dr´ apal and I. M. Wanless. “Maximally nonassociative quasigroups via quadratic ortho- morphisms”. Algebr. Comb. 4.3 (2021), pp. 501–515

    2021

  7. [15]

    On the number of quadratic orthomorphisms that produce maximally nonassociative quasigroups

    A. Dr´ apal and I. M. Wanless. “On the number of quadratic orthomorphisms that produce maximally nonassociative quasigroups”. J. Aust. Math. Soc. 115.3 (2023), pp. 311–336

    2023

  8. [16]

    A. B. Evans. Orthogonal Latin squares based on groups . Vol. 57. Developments in Mathe- matics. Springer, Cham Switzerland, 2018, pp. xv+537. 20

    2018

  9. [17]

    A. B. Evans. Orthomorphism graphs of groups . Vol. 1535. Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1992, pp. viii+114

    1992

  10. [18]

    Perfect 1-factorisations of K16

    M. J. Gill and I. M. Wanless. “Perfect 1-factorisations of K16”. Bull. Aust. Math. Soc. 101 (2020), pp. 177–185

    2020

  11. [19]

    The maximum number of intercalates in a Latin square

    K. Heinrich and W. D. Wallis. “The maximum number of intercalates in a Latin square”. Combinatorial mathematics, VIII (Geelong, 1980). Vol. 884. Lecture Notes in Math. Springer, Berlin, 1981, pp. 221–233

    1980

  12. [20]

    Large deviations in random Latin squares

    M. Kwan, A. Sah, and M. Sawhney. “Large deviations in random Latin squares”. Bull. Lond. Math. Soc. 54.4 (2022), pp. 1420–1438

    2022

  13. [21]

    Substructures in Latin squares

    M. Kwan, A. Sah, M. Sawhney, and M. Simkin. “Substructures in Latin squares”. Israel J. Math. 256.2 (2023), pp. 363–416

    2023

  14. [22]

    Intercalates and discrepancy in random Latin squares

    M. Kwan and B. Sudakov. “Intercalates and discrepancy in random Latin squares”. Random Structures Algorithms 52.2 (2018), pp. 181–196

    2018

  15. [23]

    The finite primitive permutation groups containing an abelian regular subgroup

    C. H. Li. “The finite primitive permutation groups containing an abelian regular subgroup”. Proc. London Math. Soc. (3) 87.3 (2003), pp. 725–747

    2003

  16. [24]

    Lidl and H

    R. Lidl and H. Niederreiter. Finite fields . Second Edition. Vol. 20. Encyclopedia of Mathe- matics and its Applications. Cambridge University Press, Cambridge, 1997, pp. xiv+755

    1997

  17. [25]

    Maximal nonassociativity via fields

    P. Lisonˇ ek. “Maximal nonassociativity via fields”.Des. Codes Cryptogr. 88.12 (2020), pp. 2521– 2530

    2020

  18. [26]

    Small Latin squares, quasigroups, and loops

    B. D. McKay, A. Meynert, and W. Myrvold. “Small Latin squares, quasigroups, and loops”. J. Combin. Des. 15.2 (2007), pp. 98–119

    2007

  19. [27]

    Most Latin squares have many subsquares

    B. D. McKay and I. M. Wanless. “Most Latin squares have many subsquares”. J. Combin. Theory Ser. A 86.2 (1999), pp. 322–347

    1999

  20. [28]

    The order of automorphisms of quasigroups

    B. D. McKay, I. M. Wanless, and X. Zhang. “The order of automorphisms of quasigroups”. J. Combin. Des. 23.7 (2015), pp. 275–288

    2015

  21. [29]

    Latin squares with a unique intercalate

    M. J. L. Mendis and I. M. Wanless. “Latin squares with a unique intercalate”. J. Combin. Des. 24.6 (2016), pp. 279–293

    2016

  22. [30]

    Atomic Latin squares based on cyclotomic orthomorphisms

    I. M. Wanless. “Atomic Latin squares based on cyclotomic orthomorphisms”. Electron. J. Combin. 12 (2005), Research Paper 22, 23pp

    2005

  23. [31]

    Symmetries that Latin squares inherit from 1-factorizations

    I. M. Wanless and E. C. Ihrig. “Symmetries that Latin squares inherit from 1-factorizations”. J. Combin. Des. 13.3 (2005), pp. 157–172

    2005

  24. [32]

    On some exponential sums

    A. Weil. “On some exponential sums”. Proc. Nat. Acad. Sci. U.S.A. 34 (1948), pp. 204–207. 21

    1948

Pith tools

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