---
res:
bibo_abstract:
- An intercalate in a Latin square is a 2×2 Latin subsquare. Let N be the number
of intercalates in a uniformly random n×n Latin square. We prove that asymptotically
almost surely N≥(1−o(1))n2/4, and that EN≤(1+o(1))n2/2 (therefore asymptotically
almost surely N≤fn2 for any f→∞). 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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Matthew Alan
foaf_name: Kwan, Matthew Alan
foaf_surname: Kwan
foaf_workInfoHomepage: http://www.librecat.org/personId=5fca0887-a1db-11eb-95d1-ca9d5e0453b3
- foaf_Person:
foaf_givenName: Benny
foaf_name: Sudakov, Benny
foaf_surname: Sudakov
bibo_doi: 10.1002/rsa.20742
bibo_issue: '2'
bibo_volume: 52
dct_date: 2018^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/1042-9832
- http://id.crossref.org/issn/1098-2418
dct_language: eng
dct_publisher: Wiley@
dct_title: Intercalates and discrepancy in random Latin squares@
...