Asymptotic probabilities in random Latin squares

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).

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24564
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Asymptotic probabilities in random Latin squares

Richard Montgomery, Kalina Petrova, Matthew Kwan, Lenka Kopfová
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Asymptotic probabilities in random Latin squares

Richard Montgomery, Kalina Petrova, Matthew Kwan, Lenka Kopfová
preprint en

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).

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon