Pith. sign in

REVIEW 4 major objections 4 minor 11 references

Fuzzy latin squares and balanced permutation pattern statistics

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

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

Pith's one-line read For sufficiently large n, ordinary row-normalized Latin squares span the entire space of fuzzy Latin squares, whose dimension is n! - (n-1)^2.

desk verdict Genuinely new dimension result for fuzzy latin squares, but the alternating-character case leans on an external o(1/n) estimate that is only sketched; patch that and it's a solid paper. read the letter →

arxiv 2608.05335 v1 pith:RM2BFV7N submitted 2026-08-05 math.CO

Joy Cooper , Peter J. Dukes This is my paper · ORCID
classification math.CO MSC 05B1520C3005A05
keywords fuzzylatinsquarespermutationmatricessquaredimensionquasirandompermutationssymmetricgroupcharactersvanishingsumspatternstatisticsderangementparity
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 studies a fractional relaxation of Latin squares in which the permutation-matrix summands are replaced by fuzzy permutation matrices that smear a short permutation σ ∈ S_k onto an n×n frame. A fuzzy Latin square is a rational linear combination of these fuzzy matrices equal to a constant matrix. The paper's main result is that for all sufficiently large n, the subspace L_n spanned by ordinary row-normalized Latin squares equals the whole space F_n of fuzzy Latin squares, with dimension n! - (n-1)^2. This says the fuzzy relaxation introduces no genuinely new degrees of freedom at large order: every constant-line-sum combination of fuzzy permutation matrices is a rational combination of ordinary Latin squares. The proof combines representation theory of the symmetric group with a parity-equidistribution input about two rows in a random Latin square, and the paper also classifies four-term vanishing squares and six-term non-vanishing fuzzy Latin squares.

What carries the argument

The central object is the eigenvalue decomposition of the incidence Gram matrix M M^T, where M is the n! × ℓ_n matrix of permutations versus row-normalized Latin squares. Its eigenvalues are character sums θ_μ = Σ_σ ℓ_n(id, σ) χ_μ(σ)/χ_μ(1^n). The zero eigenspace for the standard representation μ = (n-1,1) has dimension (n-1)^2; the whole proof is showing every other θ_μ > 0 for large n. The deciding input for the alternating character μ = 1^n is Proposition 2.2, the parity-equidistribution estimate κ(A_n)/κ(S_n) = 1/2 + o(1/n), imported from work on parities in random Latin squares.

What would settle it

Enumerate, for as large an n as feasible, the parity distribution of the second row relative to the first in uniformly random row-normalized Latin squares; if for some n the ratio κ(A_n)/κ(S_n) deviates from 1/2 by an amount that is not o(1/n), Proposition 2.2 is false and Theorem 2.1 no longer follows by this route. Alternatively, exhibit for a specific large n a fuzzy Latin square that is provably not in the span of ordinary Latin squares, which would directly contradict dim L_n = n! - (n-1)^2 for that order.

Watch

Extended reading notes

Core claim

In the paper's own terms, Theorem 2.1 establishes that dim L_n = n! - (n-1)^2, hence L_n = F_n for sufficiently large n. Here L_n is the subspace of Q[S_n] spanned by the symbol sets of row-normalized Latin squares of order n, and F_n is the space of fuzzy Latin squares whose constituent permutations all have length exactly n. The proof shows that the Gram matrix M M^T, indexed by permutations against Latin squares, has all eigenvalues strictly positive except the zero eigenvalue of multiplicity (n-1)^2 coming from the standard representation; the alternating-character eigenvalue is forced positive by the asymptotic κ(A_n)/κ(S_n) = 1/2 + o(1/n), and the remaining characters are handled by Larsen–Shalev bounds and split-merge estimates. For n ≤ 11 the dimension formula is verified computationally.

Load-bearing premise

The proof of Theorem 2.1 relies on the parity-equidistribution estimate κ(A_n)/κ(S_n) = 1/2 + o(1/n) for two rows in a random Latin square, stated as Proposition 2.2 and only sketched via intercalate switching; if that error rate fails, the positivity of the alternating-character eigenvalue, and with it the equality L_n = F_n, breaks.

Editorial extensions

If this is right

  • For all sufficiently large n, every fuzzy Latin square of order n is a rational linear combination of ordinary row-normalized Latin squares; the fuzzy relaxation does not enlarge the space of balanced permutation statistics asymptotically.
  • The dimension formula dim L_n = n! - (n-1)^2 now holds for every n ≤ 11 and for all large n; only finitely many orders are left unresolved.
  • Since quasirandom-forcing statistics must be fuzzy Latin squares, the six-term classification delimits which six-permutation pattern statistics can force quasirandomness; a next step suggested by the paper is to test whether the expression (5.1) is the unique six-term forcing expression.
  • Vanishing fuzzy Latin squares with four terms can only have length profiles (n,n,n,n), (n,n,n-1,n-1), or one of the three sporadic profiles (3,3,3,2), (3,3,3,1), and (4,4,3,2).

Reading between the lines

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

  • If L_n = F_n for large n, then any positive-coefficient fuzzy Latin square is asymptotically a limit of ordinary Latin squares in the vector-space sense; a testable consequence is that the quasirandom-forcing threshold, currently six patterns, cannot be lowered by using fuzzy mixed-length statistics alone.
  • The algebraic positive-semidefinite argument already gives κ(A_n)/κ(S_n) ≥ 1/2 - Θ(1/n), so a direct combinatorial proof of the matching o(1/n) upper error rate would make Theorem 2.1 self-contained rather than dependent on imported intercalate-switching machinery.
  • The exceptional vanishing length profiles at small orders suggest that any failure of the large-n picture lives at bounded order; checking n = 12 and n = 13 with the appendix data of reference [2] would pinpoint the smallest order at which the dimension formula holds.
  • A fuzzy analogue of orthogonality for Latin squares, floated in the conclusion, becomes more natural now that F_n and L_n coincide asymptotically: orthogonal pairs would correspond to complementary decompositions of the all-ones matrix within a common span.
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 introduces fuzzy permutation matrices P_σ^{↑n} and fuzzy latin squares as Q-linear combinations of such matrices equal to a constant matrix. It computes the dimension of the space F_n of fuzzy latin squares on S_n, proves that ordinary row-normalized latin squares span all of F_n for sufficiently large n (Theorem 2.1), gives a partial classification of four-term vanishing fuzzy latin squares, and reports a computer-assisted classification of six-term non-vanishing fuzzy latin squares. The proof of Theorem 2.1 uses the representation theory of S_n, an asymptotically equidistributed parity result for derangements in random latin squares imported from the unpublished preprint [9], and several auxiliary character computations.

Significance. If Theorem 2.1 is correct, it closes the dimension question for fuzzy latin squares and shows that no additional fuzzy degrees of freedom appear at large order; this would be a genuine advance connecting latin square enumeration with permutation pattern statistics. The paper also contributes a substantial computational census with explicit data and source-code references, and the arguments are parameter-free rather than fitted. However, the main theorem is not yet established at the required level of rigor: its positivity argument for the alternating character rests on an external unpublished result that is only sketched, and the treatment of several exceptional characters contains gaps or incorrect quantitative claims.

major comments (4)
  1. [Appendix A and §2.4, Eq. (2.7)] Proposition 2.2 is load-bearing for the conclusion θ_{1^n} > 0, but the appendix does not prove it. Lemmas A.1–A.3 are restated from [9] without proofs, and the paragraph following Lemma A.3 merely asserts that independent stable-intercalate switching produces a uniformly random latin square in which the first two rows have equal parity with probability exactly 1/2. No argument is given for the parity-mixture claim, for the preservation of uniformity under the switching process, or for the accumulation of the stated o(1/n) error from the individual failure probabilities. Since [9] is an unpublished preprint, this is not a minor omission.
  2. [§2.4, case μ = 2 1^{n-2}] The text says that when n is even, χ_μ(n) = 1, when n is odd χ_μ(3,2^{(n-3)/2}) = 1, and then 'It follows from (2.6) that θ_μ > 0.' This does not follow: with χ_μ(1^n) = n-1, the displayed value gives max |χ_μ(λ)|/χ_μ(1^n) = 1/(n-1), so the lower bound in (2.6) is only nonnegative, not positive. A separate estimate for the contribution of the extremal conjugacy class in (2.4) is needed and is not supplied.
  3. [§2.4, case μ = (n−2,2)] The assertion that χ_μ(2^{n/2}) > 0 implies θ_μ > 0 via (2.6) is not justified. Positivity at one conjugacy class does not control the maximum of |χ_μ(λ)|/χ_μ(1^n) over all derangement classes, which is what (2.6) requires. No bound on that maximum is given for this character, so the conclusion θ_μ > 0 is unsupported.
  4. [§2.4, case μ = 2^2 1^{n−4}, after Lemma 2.5] The split-merge argument contains a quantitative error. The text claims that for n ≥ 8, |C_{λ'}| > n |C_λ| for λ' = 4 1^{n−4} and λ = 2^{n/2}, and then uses Lemma 2.3 to conclude κ(λ') ≥ n κ(λ)/2. The class-size claim is false in the relevant parameter range: for n = 14, |C_{2^7}| = 135135 while |C_{4 1^{10}}| = 6006, so the opposite inequality holds. Consequently the displayed lower bound for θ_μ in this case is unsupported, and the proof of positivity for μ = 2^2 1^{n−4} is incomplete. Since Lemma 2.5 itself is also delegated to the unpublished thesis [3] without proof, this entire exceptional case needs a revised argument.
minor comments (4)
  1. [§4, Table 4/Table 5] The table labelled 'Table 4' is referenced twice for two different objects; the second reference, which lists irreducible six-term fuzzy latin squares, should point to a separate table (probably Table 5).
  2. [§4, search description] The text says 966 length lists were enumerated, but Table 4 only displays totals for n = 4, 5, 6; it would be helpful to state explicitly how many candidate lists survived the Lemmas 4.1 and 4.2 filters for each n.
  3. [§3.2, Theorem 3.6 proof] In the first case of the proof, 'We may therefore assume wlog that c_1, c_2 > 0 and c_3 < 0' requires more justification: scaling by a negative constant and permuting terms does not by itself put the coefficients into this sign pattern, and the subsequent support-size argument depends on that pattern.
  4. [§2.4, Eq. (2.6)] The notation in the line '1̸∈λ⊢n' is nonstandard; writing λ with no part equal to 1 as '1̸∈λ' is understandable but should be defined explicitly the first time it is used.

Circularity Check

0 steps flagged · score 1.0 of 10

No circularity found: the dimension theorem is an independent representation-theoretic proof modulo external parity and character results.

full rationale

The paper's central claim, dim L_n = n! - (n-1)^2 for large n, is not obtained by reusing its own target as an input. The upper bound follows from the exact computation dim F_n = n! - (n-1)^2, which itself follows from the Birkhoff-von Neumann theorem and the dimension of the space of matrices with constant line sums; no fitted parameter is involved. The lower bound is then shown by studying the incidence matrix MM^T and its character-theoretic eigenvalues. The only genuinely load-bearing imported statement is Proposition 2.2, the parity estimate kappa(A_n)/kappa(S_n) = 1/2 + o(1/n), taken from the external preprint [9] and sketched in Appendix A via stable intercalate switching. This is an external, parameter-free result rather than a relabelling of the present paper's conclusion; its error rate is an assumption whose failure would be a correctness risk, not a circularity. The paper does cite its own prior work: [5] supplies definitions and length-list constraints, and [3] supplies an elementary character ratio (Lemma 2.5) and support-size bounds (Lemma 3.5). These citations are genuine supporting lemmas and are not used to define the dimension result into existence, nor do they smuggle in the theorem as an ansatz. Even though some cited lemmas are only stated and not reproved, no step in the derivation reduces by construction to the conclusion being proved. Hence no specific circular reduction can be exhibited.

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

No free parameters and no new physical entities are introduced; the paper is deductive combinatorics. It does import several external theorems, including a parity result from [9] that is only sketched, plus lemmas from the first author's thesis [3] that are not proved in the preprint.

assumptions (7)
  • standard math Birkhoff-von Neumann theorem identifies the affine span of permutation matrices with the space H_n of matrices with constant line sums.
    Used in Section 2.1 to conclude im phi = H_n and compute dim W_{<=n}.
  • standard math Larsen-Shalev bound |chi_mu(lambda)| <= chi_mu(1)^{1/2+o(1)} for derangements lambda.
    Used in Section 2.4 to make the naive eigenvalue lower bound positive for characters of degree Omega(n^3).
  • domain assumption Cavenagh-Greenhill-Wanless split-merge inequality (Lemma 2.3) controlling kappa(C_lambda)/|C_lambda| ratios.
    Used in Section 2.4 for partitions near 2^{n/2} to lower-bound theta_mu.
  • domain assumption Proposition 2.2: kappa(A_n)/kappa(S_n) = 1/2+o(1/n), adapted from [9, Theorem 6.4].
    Load-bearing for theta_{1^n} > 0; Appendix A only sketches the adaptation and defers key lemmas to [9].
  • domain assumption Lemma 2.5: exact second-smallest character ratio for mu = 2^2 1^{n-4} and the split-merge estimates that follow.
    Used in Section 2.4 to handle n congruent to 2 mod 4; proof not in the preprint, cited to [3].
  • domain assumption Lemma 3.5: support-size bounds n^2 - k(k-1) <= ||P_sigma^{^up n}||_0 <= k(n-k+1)^2 from [3].
    Load-bearing in Theorem 3.6 for excluding impossible length tuples; proof not included.
  • domain assumption Lemmas 4.1 and 4.2: length-list inequalities for irreducible non-vanishing fuzzy latin squares from [5].
    Used to prune the 966 candidate length lists in the six-term census; [5] is co-authored by Dukes.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Fuzzy latin squares and balanced permutation pattern statistics." pith.science (2026). https://pith.science/paper/RM2BFV7N

@misc{pith2026260805335,
  author       = {Pith},
  title        = {Pith review of: Fuzzy latin squares and balanced permutation pattern statistics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RM2BFV7N}},
  note         = {Machine review of arXiv:2608.05335}
}
abstract

A latin square of order $n$ can be viewed as a partition of the $n \times n$ all-ones matrix into permutation matrix summands. Here, we consider a relaxation in which the matrix summands are allowed to be induced from shorter permutations. For $\sigma \in S_k$, the `fuzzy permutation matrix' $P_\sigma^{\uparrow n}$ arises from combining all $\binom{n}{k}^2$ order-preserving embeddings of the $k \times k$ permutation matrix $P_\sigma$ into an $n \times n$ matrix. We define a fuzzy latin square as a linear combination of $n \times n$ fuzzy permutation matrices $P_\sigma^{\uparrow n}$ equaling a constant matrix. We study various aspects of these objects, including certain relevant vector space dimensions and a census of fuzzy latin squares with a small number of terms. In particular, we determine strong conditions on four-term fuzzy latin squares in the `vanishing' case (when the constant matrix is all zeros). We also report on a computer-assisted classification of six-term fuzzy latin squares in the non-vanishing case.

Figures

Figures reproduced from arXiv: 2608.05335 by the authors.

Figure 1
Figure 1. The matrices Pσ and P ↑n σ where σ = 123...k. In this paper, we study objects which generalize latin squares in the sense that the permutation matrices in (1.1) are allowed to be fuzzy permutation matrices P ↑n σi for various permutations σi (of possibly mixed lengths). In more detail, we let S≤n := ∪ n k=1Sk and define a fuzzy latin square of order n as a function c : S≤n → Q such that (1.3) X σ∈S≤n c(σ)P ↑n σ = cJ… view at source ↗
Figure 2
Figure 2. Matrices Pσ in the latin square 3412 + 2143 + 1234 + 4321. 3 3 3 3 3 3 3 3 9 3 3 5 4 4 5 3 3 9 3 6 9 3 4 5 6 6 5 4 3 9 6 3 [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Matrix terms in the fuzzy latin square 3(3412) + 3(2143) + 4(123) + 3(21). We emphasize that fuzzy latin squares differ from ordinary latin squares in a few ways. First, we allow permutations of different lengths; this motivates our adjective ‘fuzzy’. Additionally, we allow coefficients in Q, rather than {0, 1}, and the constant c can be arbitrary, instead of 1. This fractional relaxation is convenient for facilitat… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

  1. [5]

    Crudele, P.J

    G. Crudele, P.J. Dukes and J.A. Noel, Six permutation patterns force quasirandomness.Discrete Analysis8 (2024), 26 pp

    work page 2024

  2. [2]

    Cavenagh, C

    N. Cavenagh, C. Greenhill and I. Wanless, The cycle structure of two rows in a random latin square.Random Struct. Algorithms33 (2008), 286–309

    work page 2008

  3. [9]

    M. Kwan, K. Petrova and M. Sawhney, Parities in random latin squares, preprinthttps://arxiv.org/abs/2509. 13125

    work page

  4. [3]

    Cooper, Fuzzy latin squares as balanced linear combinations of mixed-length permutations, MSc thesis, Uni- versity of Victoria, 2026

    J. Cooper, Fuzzy latin squares as balanced linear combinations of mixed-length permutations, MSc thesis, Uni- versity of Victoria, 2026

    work page 2026

  5. [1]

    Birkhoff, Tres observaciones sobre el algebra lineal, Univ

    G. Birkhoff, Tres observaciones sobre el algebra lineal, Univ. Nac. Tucum´ an Rev. Ser. A 5 (1946) 147–151

    work page 1946

  6. [4]

    Cooper, Repository on fuzzy latin squares,https://github.com/JoyCooper/FuzzyLatinSquaresWithRTerms

    J. Cooper, Repository on fuzzy latin squares,https://github.com/JoyCooper/FuzzyLatinSquaresWithRTerms

    work page

  7. [6]

    Delsarte, An algebraic approach to the association schemes of coding theory.Philips Res

    Ph. Delsarte, An algebraic approach to the association schemes of coding theory.Philips Res. Rep. Suppl.10 (1973)

    work page 1973

  8. [7]

    Frolov, Sur les permutations carr´ es,J

    M. Frolov, Sur les permutations carr´ es,J. de Math. Sp´ ec.IV (1890), 25–30

    work page

Show all 11 references
  1. [8]

    Kr´ al’, J.-B

    D. Kr´ al’, J.-B. Lee and J.A. Noel, Forcing quasirandomness with 4-point permutations, preprinthttps://arxiv. org/abs/2407.06869

    arXiv

  2. [10]

    Larsen and A

    M. Larsen and A. Shalev, Characters of symmetric groups: Sharp bounds and applications.Inventiones Math. 174 (2008), 645–687

    2008

  3. [11]

    Sagan, The Symmetric Group, 2nd Edition

    B.E. Sagan, The Symmetric Group, 2nd Edition.. Graduate Texts in Mathematics Vol. 203, Springer, 2013. Mathematics and Statistics, University of Victoria, Victoria, BC, Canada Email address:joycooper@uvic.ca; dukes@uvic.ca 15

    2013

Pith tools

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