Work

Asymptotic probabilities in random Latin squares

Year: 2026
Type: preprint
Abstract: We introduce some new general techniques for studying asymptotic probabilities in random Latin squares. Using these techniques, we obtain an asymptotic formula for the probability that a given 'small' partial Latin square $H$ is present in a uniformly random $n\times n$ Latin square (as conjectured by Divoux-Kelly-Kennedy-Sidhu). As applications, we determine which configurations are likely to appear in random Latin squares (resolving a conjecture of Allsop-Morris), we determine the asymptotic distribution of the number of $3\times 3$ Latin subsquares in a uniformly random $n\times n$ Latin square (resolving conjectures of McKay-Wanless and Kwan-Sah-Sawhney), and we show that the first two rows of a random $n\times n$ Latin square are statistically indistinguishable from a random derangement (answering a conjecture of Cameron and Cavenagh-Greenhill-Wanless).
Language: English
Open Access status: green
OpenAlex ID: W7236580828
Cites:
Cited by:
Related to: 10