betaFeedback

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 HH is present in a uniformly random n×nn\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×33\times 3 Latin subsquares in a uniformly random n×nn\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×nn\times n Latin square are statistically indistinguishable from a random derangement (answering a conjecture of Cameron and Cavenagh-Greenhill-Wanless).

Paper details

vlnc:W_yvy6nkjt
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…