Search arXivSearch

arXiv · 2606.25884

Generalising Latin square orthogonality and Frobenius-König with alternating sign matrices

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önig type result for a class of $(0,\pm1)$-matrices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alena Ernst, Stefano Lia, Cian O'Brien, John Sheekey, Jens Zumbrägel. 2026-06-24. Generalising Latin square orthogonality and Frobenius-König with alternating sign matrices. https://arxiv.org/abs/2606.25884

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO