随机拉丁方格中的子方格

arXiv - MATH - Combinatorics Pub Date : 2024-09-13 DOI:arxiv-2409.08446

Jack Allsop, Ian M. Wanless

{"title":"随机拉丁方格中的子方格","authors":"Jack Allsop, Ian M. Wanless","doi":"arxiv-2409.08446","DOIUrl":null,"url":null,"abstract":"We prove that with probability $1-o(1)$ as $n \\to \\infty$, a uniformly random\nLatin square of order $n$ contains no subsquare of order $4$ or more, resolving\na conjecture of McKay and Wanless. We also show that the expected number of\nsubsquares of order 3 is bounded.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"92 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Subsquares in random Latin squares\",\"authors\":\"Jack Allsop, Ian M. Wanless\",\"doi\":\"arxiv-2409.08446\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that with probability $1-o(1)$ as $n \\\\to \\\\infty$, a uniformly random\\nLatin square of order $n$ contains no subsquare of order $4$ or more, resolving\\na conjecture of McKay and Wanless. We also show that the expected number of\\nsubsquares of order 3 is bounded.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":\"92 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08446\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们证明，随着 $n \to \infty$ 的概率为 1-o(1)$ ，阶为 $n$ 的均匀随机拉丁方阵不包含阶为 $4$ 或更多的子方阵，从而解决了麦凯和万利斯的猜想。我们还证明了阶为 3 的子方格的预期数目是有界的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Subsquares in random Latin squares

We prove that with probability $1-o(1)$ as $n \to \infty$, a uniformly random Latin square of order $n$ contains no subsquare of order $4$ or more, resolving a conjecture of McKay and Wanless. We also show that the expected number of subsquares of order 3 is bounded.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - MATH - Combinatorics

自引率

0.00%

发文量

期刊最新文献

A note on connectivity in directed graphs Proof of a conjecture on graph polytope Generalized Andrásfai--Erdős--Sós theorems for odd cycles The repetition threshold for ternary rich words Isomorphisms of bi-Cayley graphs on generalized quaternion groups