N. Alon, R. Briceño, Nishant Chandgotia, A. Magazinov, Yinon Spinka
{"title":"晶格色的混合性质","authors":"N. Alon, R. Briceño, Nishant Chandgotia, A. Magazinov, Yinon Spinka","doi":"10.1017/s0963548320000395","DOIUrl":null,"url":null,"abstract":"We study and classify proper q-colourings of the ℤd lattice, identifying three regimes where different combinatorial behaviour holds. (1) When \n$q\\le d+1$\n, there exist frozen colourings, that is, proper q-colourings of ℤd which cannot be modified on any finite subset. (2) We prove a strong list-colouring property which implies that, when \n$q\\ge d+2$\n, any proper q-colouring of the boundary of a box of side length \n$n \\ge d+2$\n can be extended to a proper q-colouring of the entire box. (3) When \n$q\\geq 2d+1$\n, the latter holds for any \n$n \\ge 1$\n. Consequently, we classify the space of proper q-colourings of the ℤd lattice by their mixing properties.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Mixing properties of colourings of the ℤd lattice\",\"authors\":\"N. Alon, R. Briceño, Nishant Chandgotia, A. Magazinov, Yinon Spinka\",\"doi\":\"10.1017/s0963548320000395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study and classify proper q-colourings of the ℤd lattice, identifying three regimes where different combinatorial behaviour holds. (1) When \\n$q\\\\le d+1$\\n, there exist frozen colourings, that is, proper q-colourings of ℤd which cannot be modified on any finite subset. (2) We prove a strong list-colouring property which implies that, when \\n$q\\\\ge d+2$\\n, any proper q-colouring of the boundary of a box of side length \\n$n \\\\ge d+2$\\n can be extended to a proper q-colouring of the entire box. (3) When \\n$q\\\\geq 2d+1$\\n, the latter holds for any \\n$n \\\\ge 1$\\n. Consequently, we classify the space of proper q-colourings of the ℤd lattice by their mixing properties.\",\"PeriodicalId\":10513,\"journal\":{\"name\":\"Combinatorics, Probability & Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2020-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorics, Probability & Computing\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/s0963548320000395\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorics, Probability & Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/s0963548320000395","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
We study and classify proper q-colourings of the ℤd lattice, identifying three regimes where different combinatorial behaviour holds. (1) When
$q\le d+1$
, there exist frozen colourings, that is, proper q-colourings of ℤd which cannot be modified on any finite subset. (2) We prove a strong list-colouring property which implies that, when
$q\ge d+2$
, any proper q-colouring of the boundary of a box of side length
$n \ge d+2$
can be extended to a proper q-colouring of the entire box. (3) When
$q\geq 2d+1$
, the latter holds for any
$n \ge 1$
. Consequently, we classify the space of proper q-colourings of the ℤd lattice by their mixing properties.
期刊介绍:
Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.