Intercalates and discrepancy in random Latin squares

From MaRDI portal




Abstract: An intercalate in a Latin square is a 2imes2 Latin subsquare. Let N be the number of intercalates in a uniformly random nimesn Latin square. We prove that asymptotically almost surely Ngeleft(1oleft(1ight)ight),n2/4, and that mathbbENleleft(1+oleft(1ight)ight),n2/2 (therefore asymptotically almost surely Nlefn2 for any foinfty). This significantly improves the previous best lower and upper bounds. We also give an upper tail bound for the number of intercalates in two fixed rows of a random Latin square. In addition, we discuss a problem of Linial and Luria on low-discrepancy Latin squares.











This page was built for publication: Intercalates and discrepancy in random Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564855)