Intercalates and discrepancy in random Latin squares
From MaRDI portal
Abstract: An intercalate in a Latin square is a Latin subsquare. Let be the number of intercalates in a uniformly random Latin square. We prove that asymptotically almost surely , and that (therefore asymptotically almost surely for any ). 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.
Recommendations
Cited in
(18)- Most Latin squares have many subsquares
- Covers and partial transversals of Latin squares
- Latin squares and low discrepancy allocation of two-dimensional data
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- Discrepancy of high-dimensional permutations
- The cycle structure of two rows in a random Latin square
- scientific article; zbMATH DE number 1066160 (Why is no real title available?)
- scientific article; zbMATH DE number 1744081 (Why is no real title available?)
- Random Latin squares and 2-dimensional expanders
- Almost all Steiner triple systems are almost resolvable
- On the threshold problem for Latin boxes
- Substructures in Latin squares
- Hamilton transversals in random Latin squares
- Large deviations in random latin squares
- Subsquares in random Latin squares and rectangles
- Isotopisms of quadratic quasigroups
- The degree-restricted random process is far from uniform
- Uniform semi-Latin squares and their pairwise-variance aberrations
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)