WorksMathematics
Asymptotic probabilities in random Latin squares
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 is present in a uniformly random 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 Latin subsquares in a uniformly random Latin square (resolving conjectures of McKay-Wanless and Kwan-Sah-Sawhney), and we show that the first two rows of a random Latin square are statistically indistinguishable from a random derangement (answering a conjecture of Cameron and Cavenagh-Greenhill-Wanless).