Limits of Latin squares
Graphons and permutons were introduced in [\textit{L. Lovász} and \textit{B. Szegedy}, J. Comb. Theory, Ser. B 96, No. 6, 933--957 (2006; Zbl 1113.05092)] and [\textit{C. Hoppen} et al., ibid. 103, No. 1, 93--113 (2013; Zbl 1255.05174)], respectively, as limits for convergent graphs and permutation sequences. In this paper, the authors use both concepts to introduce the notion of Latinon as the limit for a convergent sequence of Latin squares. More precisely, if \((\Omega,\mu)\) denotes an arbitrary separable atomless probability space and \(\mathcal{B}\) is the space of all Borel probability measures on \([0, 1]\), then a Latinon is a pair \((W,f)\) such that \(W:\Omega^2\rightarrow\mathcal{B}\) is a distribution-valued bigraphon, \(f:\Omega\rightarrow [0,1]\) is a measure preserving function, and the following two conditions hold for all measurable \(S,T\subseteq [0,1]\).\N\begin{itemize}\N\item The measure \(\mu_{W,x}^1\) on \([0,1]^2\) that is defined by \(\mu_{W,x}^1(S\times T):=\int_{y\in f^{-1}(S)} W(x,y)(T)\,dy\) is a permuton for almost all \(x\in\Omega^4\).\N\item The measure \(\mu_{W,y}^2\) on \([0,1]^2\) that is defined by \(\mu_{W,y}^2(S\times T):=\int_{x\in f^{-1}(S)} W(x,y)(T)\,dx\) is a permuton for almost all \(y\in\Omega\).\N\end{itemize}\NThen, the notion of density in finite permutations is generalized to that of density in finite Latin squares. This notion is extended to density in Latinons so that a Latinon is the limit of a sequence of Latin squares if the density of the former is the limit of a left-convergent series of densities of the latter. Then, the authors prove the compactness for Latinons so that in any sequence of Latinons over arbitrary ground spaces, there is a subsequence that is left-convergent to a Latinon. Even more, for every Latinon, one may find a sequence of Latin squares that is left-convergent to the former. Examples, representations, and alternative definitions of Latinons are described. In addition, the authors introduce an analogue of the cut distance for Latinons and state related counting lemmas that imply the equivalence of the two topologies generated by left-convergence and the cut distance, respectively. They also state a sampling lemma for Latinons. They also show how to construct an approximating sequence of Latin squares for a given Latinon. Finally, some possible applications concerning asymptotic extremal questions about Latin squares are considered.
This page was built for publication: Limits of Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962337)
