{"publisher":"Wiley","issue":"2","publication_identifier":{"eissn":["1098-2418"],"issn":["1042-9832"]},"year":"2018","abstract":[{"lang":"eng","text":"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."}],"oa_version":"Preprint","status":"public","article_type":"original","extern":"1","date_created":"2021-06-18T12:47:25Z","type":"journal_article","citation":{"mla":"Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.” Random Structures and Algorithms, vol. 52, no. 2, Wiley, 2018, pp. 181–96, doi:10.1002/rsa.20742.","ista":"Kwan MA, Sudakov B. 2018. Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. 52(2), 181–196.","short":"M.A. Kwan, B. Sudakov, Random Structures and Algorithms 52 (2018) 181–196.","ieee":"M. A. Kwan and B. Sudakov, “Intercalates and discrepancy in random Latin squares,” Random Structures and Algorithms, vol. 52, no. 2. Wiley, pp. 181–196, 2018.","ama":"Kwan MA, Sudakov B. Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. 2018;52(2):181-196. doi:10.1002/rsa.20742","apa":"Kwan, M. A., & Sudakov, B. (2018). Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20742","chicago":"Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.” Random Structures and Algorithms. Wiley, 2018. https://doi.org/10.1002/rsa.20742."},"title":"Intercalates and discrepancy in random Latin squares","date_updated":"2023-02-23T14:01:09Z","month":"03","scopus_import":"1","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":" 52","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.04981"}],"oa":1,"page":"181-196","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","publication":"Random Structures and Algorithms","day":"01","publication_status":"published","date_published":"2018-03-01T00:00:00Z","volume":52,"_id":"9568","doi":"10.1002/rsa.20742","author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","last_name":"Kwan","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"}],"external_id":{"arxiv":["1607.04981"]}}