pith. sign in

arxiv: 2606.25884 · v1 · pith:H6QVT3IDnew · submitted 2026-06-24 · 🧮 math.CO

Generalising Latin square orthogonality and Frobenius-K\"onig with alternating sign matrices

Alena Ernst , Stefano Lia , Cian O'Brien , John Sheekey , Jens Zumbr\"agel This is my paper

Pith reviewed 2026-06-25 19:14 UTC · model grok-4.3

classification 🧮 math.CO
keywords Italian squaresalternating sign hypermatricesLatin squaresorthogonalityFrobenius-König theoremtransversals(0,±1)-matrices
0
0 comments X

The pith

Italian squares generalize Latin squares using alternating sign hypermatrices and fix an orthogonality inconsistency from prior work.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces Italian squares as a generalization of Latin squares constructed from alternating sign hypermatrices. It defines a notion of orthogonality for these objects that eliminates an inconsistency in the earlier approach of Brualdi and Dahl. The authors then establish upper bounds on the size of maximal pairwise orthogonal collections, conditions guaranteeing an orthogonal mate, constructions of infinite families of orthogonal pairs, and the presence of transversals. They further prove a Frobenius-König type theorem that applies to a specified class of matrices whose entries lie in {0, ±1}.

Core claim

We develop the theory of Italian squares, a related generalisation of Latin squares, together with a notion of orthogonality that resolves an inconsistency in the definition of Brualdi and Dahl. Building on classical questions from Latin square theory, we obtain results including upper bounds on the maximal size of a pairwise orthogonal set, conditions for the existence of an orthogonal mate, infinite families of orthogonal pairs, and transversals. As part of our exploration of alternating sign matrices, we also prove a Frobenius-König type result for a class of (0,±1)-matrices.

What carries the argument

Italian squares, defined via 3-dimensional alternating sign hypermatrices that generalize the permutation hypermatrices underlying Latin squares, together with the associated orthogonality relation.

If this is right

  • Upper bounds hold on the largest possible number of mutually orthogonal Italian squares of a given order.
  • Explicit conditions determine when a given Italian square possesses an orthogonal mate.
  • Infinite families of orthogonal pairs of Italian squares exist and can be constructed explicitly.
  • Transversals exist in Italian squares under the same combinatorial conditions that apply to classical Latin squares.
  • A Frobenius-König type theorem applies to the indicated class of (0,±1)-matrices.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The corrected orthogonality relation makes it possible to ask the same existence questions for orthogonal mates that are standard in Latin square theory.
  • The (0,±1)-matrix result may be tested directly by checking small matrices that satisfy the row and column sum conditions but avoid the predicted zero submatrix.
  • Enumeration of Italian squares of small orders would allow direct verification of the stated upper bounds on orthogonal sets.

Load-bearing premise

Alternating sign hypermatrices form the appropriate framework for generalizing Latin squares, and the proposed orthogonality definition is the natural choice that resolves the inconsistency in the earlier definition.

What would settle it

A concrete (0,±1)-matrix belonging to the class considered in the paper that contains no zero submatrix of the size predicted by the Frobenius-König type statement yet still satisfies the signed-permanent or row-column sum conditions that the theorem claims are equivalent.

Figures

Figures reproduced from arXiv: 2606.25884 by Alena Ernst, Cian O'Brien, Jens Zumbr\"agel, John Sheekey, Stefano Lia.

Figure 1
Figure 1. Figure 1: Pair of orthogonal Latin-like squares of order 6 with their correspond [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Latin square L with transversals T1, T2, T3, T4 (left) and the orthogonal L ′ obtained from these transversals (right). Recall from Section 2.2 that ⟨A, B⟩ denotes the Frobenius inner product of the matrices A and B. Finding a transversal of a Latin square L is equivalent to finding a permutation matrix P for which ⟨P, Lk⟩ = 1 for all planes Lk of L. For example, each of the following permutation matrices … view at source ↗
Figure 3
Figure 3. Figure 3: The planes E1, E2, E3, E4 of the diamond Italian square D4. Lemma 5.9. For every n ≥ 1 satisfying n ≡ ±1 mod 6, the diamond Dn has a transversal permutation matrix P given by the non-zero entries ( (2ℓ−1, 4ℓ−2) and (2ℓ, 4ℓ−1) for ℓ = 1, . . . , ⌈ n−1 4 ⌉ , (n−2ℓ+1, 4ℓ) and (n−2ℓ, 4ℓ + 1) for ℓ = 1, . . . , ⌊ n−1 4 ⌋ , as well as (n, 1). Proof. We show that ⟨Ek, P⟩ = 1 for each of the planes Ek of the diamo… view at source ↗
read the original abstract

The theory of Latin squares has a long history. While the objects themselves appeared earlier, the study of their general mathematical theory dates back to Euler in the 18th century. Latin squares can be interpreted as 3-dimensional permutation hypermatrices, and alternating sign matrices often arise as a natural generalisation of permutation matrices. In 2018, Brualdi and Dahl introduced a generalisation of classical Latin squares using alternating sign hypermatrices. Inspired by their definition, we develop the theory of Italian squares, a related generalisation of Latin squares, together with a notion of orthogonality that resolves an inconsistency in the definition of Brualdi and Dahl. Building on classical questions from Latin square theory, we obtain results including upper bounds on the maximal size of a pairwise orthogonal set, conditions for the existence of an orthogonal mate, infinite families of orthogonal pairs, and transversals. As part of our exploration of alternating sign matrices, we also prove a Frobenius-K\"onig type result for a class of $(0,\pm1)$-matrices.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 0 minor

Summary. The manuscript develops the theory of Italian squares, a generalization of Latin squares based on alternating sign hypermatrices. It introduces a notion of orthogonality that resolves an inconsistency in Brualdi and Dahl's definition. Results include upper bounds on the size of pairwise orthogonal sets, conditions for orthogonal mates, infinite families of orthogonal pairs, transversals, and a Frobenius-König type theorem for a class of (0,±1)-matrices.

Significance. This work extends the classical theory of Latin squares and their orthogonality to the setting of alternating sign hypermatrices, providing a consistent definition that addresses previous issues. The generalization allows for new results on orthogonal sets and transversals, and the Frobenius-König type result broadens the applicability of such theorems to (0,±1)-matrices. The approach is definitional with asserted proofs for the main claims.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and their recommendation to accept.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper introduces definitional generalizations (Italian squares via alternating sign hypermatrices) and proves independent combinatorial results including bounds on orthogonal sets, existence of mates, infinite families, transversals, and a Frobenius-König theorem for (0,±1)-matrices. No equations or claims reduce by construction to fitted parameters, self-definitions, or load-bearing self-citations; the derivation chain consists of new definitions followed by proofs that do not presuppose the target statements. The modeling choice and resolution of an external inconsistency (Brualdi-Dahl) are framework decisions, not circular steps.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on standard definitions of Latin squares, alternating sign matrices, and hypermatrices from prior literature; no free parameters, no invented physical entities, and no ad-hoc axioms beyond ordinary matrix algebra are indicated in the abstract.

axioms (1)
  • standard math Standard algebraic and combinatorial properties of matrices and hypermatrices as used in the definition of alternating sign matrices
    The paper builds directly on existing definitions from Brualdi and Dahl without stating new foundational axioms.

pith-pipeline@v0.9.1-grok · 5730 in / 1397 out tokens · 46063 ms · 2026-06-25T19:14:28.412265+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

18 extracted references

  1. [1]

    Bose, S.S

    R.C. Bose, S.S. Shrikhande, and E.T. Parker. Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler’s conjecture.Canad. J. Math., 12:189–203, 1960. 27

    1960

  2. [2]

    Brualdi and G

    R. Brualdi and G. Dahl. Alternating sign matrices and hypermatrices, and a generalization of Latin squares.Adv. in Appl. Math., 95:116–151, 2018

    2018

  3. [3]

    Brualdi and G

    R. Brualdi and G. Dahl. Frobenius-K¨ onig theorem for classes of (0,±1)-matrices. Discrete Math., 347:113951, 2024

    2024

  4. [4]

    Brualdi and H

    R. Brualdi and H. Kim. A generalization of alternating sign matrices.J. Combin. Des., 23:204–215, 2014

    2014

  5. [5]

    Brualdi and M

    R. Brualdi and M. Schroeder. Alternating sign matrices and their Bruhat order. Discrete Math., 340:1996–2019, 2017

    1996

  6. [6]

    Colbourn and J

    C. Colbourn and J. Dinitz.Handbook of Combinatorial Designs. Chapman & Hall/CRC, 2006

    2006

  7. [7]

    D. Gale. A theorem on flows in networks.Pacific J. Math., 7:1073–1082, 1957

    1957

  8. [8]

    P. Hall. On representatives of subsets.J. Lond. Math. Soc., 1(10), 1935

    1935

  9. [9]

    Donald Keedwell and J´ ozsef D´ enes.Latin squares and their applications

    A. Donald Keedwell and J´ ozsef D´ enes.Latin squares and their applications. Elsevier/North-Holland, Amsterdam, second edition, 2015

    2015

  10. [10]

    Lascoux and M.P

    A. Lascoux and M.P. Sch¨ utzenberger. Treillis et bases des groupes de coxeter. Electron. J. Combin., 3(2):1–35, 1996

    1996

  11. [11]

    Mills, D

    W. Mills, D. Robbins, and H. Rumsey. Alternating-sign matrices and descending plane partitions.J. Combin. Theory Ser. A, 34:340–359, 1983

    1983

  12. [12]

    C. O’Brien. Alternating sign hypermatrix decompositions of latin-like squares. Adv. in Appl. Math., 121:102097, 16, 2020

    2020

  13. [13]

    C. O’Brien. Weighted projections of alternating sign matrices: Latin-like squares and the asm polytope.Electron. J. Combin., 31(1):Paper No. 1.10, 16, 2024

    2024

  14. [14]

    H. Ryser. Combinatorial properties of matrices of zeros and ones.Canad. J. Math., 9:371–377, 1957

    1957

  15. [15]

    Schneider

    H. Schneider. The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, K¨ onig and Markov.Lin. Alg. Appl., 18(2):139–162, 1977

    1977

  16. [16]

    G. Tarry. Le probl` eme des 36 officiers.C. R. Assoc. Franc. Av. Sci., 1(2):170–203, 1901

    1901

  17. [17]

    van Lint and R

    J. van Lint and R. Wilson.A Course in Combinatorics. Cambridge University Press, 1992

    1992

  18. [18]

    I.M. Wanless. Transversals in Latin squares: a survey. InSurveys in combina- torics 2011, volume 392 ofLondon Math. Soc. Lecture Note Ser., pages 403–437. Cambridge Univ. Press, Cambridge, 2011. Alena Ernst,Department of Mathematical Sciences, Worcester Polytechnic Insti- tute, Worcester, MA, USA Email address:aernst@wpi.edu Stefano Lia,Department of Math...

    2011