You are here:
Publication details
Quasirandom Latin squares
Authors | |
---|---|
Year of publication | 2022 |
Type | Article in Periodical |
Magazine / Source | Random Structures & Algorithms |
MU Faculty or unit | |
Citation | |
web | https://arxiv.org/abs/2011.07572 |
Doi | http://dx.doi.org/10.1002/rsa.21060 |
Keywords | combinatorial limit; Latin square; Latinon; quasirandomness |
Description | 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. |
Related projects: |