Quasirandom Latin squares
Combinatorics
2021-08-27 v2
Abstract
We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is the best possible in the sense that 2x3 cannot be replaced with 2x2 or 1xN for any N.
Cite
@article{arxiv.2011.07572,
title = {Quasirandom Latin squares},
author = {Jacob W. Cooper and Daniel Kral and Ander Lamaison and Samuel Mohr},
journal= {arXiv preprint arXiv:2011.07572},
year = {2021}
}