晶格色的混合性质

IF 0.9 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Combinatorics, Probability & Computing Pub Date : 2020-10-19 DOI:10.1017/s0963548320000395
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}
引用次数: 3

摘要

我们研究并分类了lgd格的固有q-着色,确定了具有不同组合行为的三种区域。(1)当$q\le d+1$时,存在冻结着色,即存在不能在任意有限子集上被修改的适q-着色。(2)证明了一个强表着色性质,该性质表明,当$q\ge d+2$时,边长为$n \ge d+2$的盒子的边界的任何适当q-着色都可以推广为整个盒子的适当q-着色。(3)当$q\geq 2d+1$时,后者适用于任何$n \ge 1$。因此,我们根据它们的混合性质对素格的固有q色空间进行了分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mixing properties of colourings of the ℤd lattice
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Combinatorics, Probability & Computing
Combinatorics, Probability & Computing 数学-计算机:理论方法
CiteScore
2.40
自引率
11.10%
发文量
33
审稿时长
6-12 weeks
期刊介绍: 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.
期刊最新文献
Spanning trees in graphs without large bipartite holes Approximate discrete entropy monotonicity for log-concave sums A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree Mastermind with a linear number of queries On oriented cycles in randomly perturbed digraphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1