关于格着色的最优性

Y. Ben-Haim, T. Etzion
{"title":"关于格着色的最优性","authors":"Y. Ben-Haim, T. Etzion","doi":"10.1137/S0895480104439589","DOIUrl":null,"url":null,"abstract":"For z/sub 1/, z/sub 2/, z/sub 3/ /spl isin/ Z/sup 2/, the tristance d/sub 3/(z/sub 1/, z/sub 2/, z/sub 3/) is a generalization of the L/sub 1/-distance on Z/sup 2/ to a quality that reflects the relative dispersion of three points rather than two. We prove that at least 3k/sup 2/ colors are required to color the points of Z/sup 2/, such that the tristance between any three distinct points, colored with the same color, is at least 4k. We also prove that 3k/sup 2/+3k+1 colors are required if the tristance is at least 4k+2. For the first case we show an infinite family of colorings with 3k/sup 2/ colors and conjecture that these are the only colorings with 3k/sup 2/ colors.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"On the optimality of coloring with a lattice\",\"authors\":\"Y. Ben-Haim, T. Etzion\",\"doi\":\"10.1137/S0895480104439589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For z/sub 1/, z/sub 2/, z/sub 3/ /spl isin/ Z/sup 2/, the tristance d/sub 3/(z/sub 1/, z/sub 2/, z/sub 3/) is a generalization of the L/sub 1/-distance on Z/sup 2/ to a quality that reflects the relative dispersion of three points rather than two. We prove that at least 3k/sup 2/ colors are required to color the points of Z/sup 2/, such that the tristance between any three distinct points, colored with the same color, is at least 4k. We also prove that 3k/sup 2/+3k+1 colors are required if the tristance is at least 4k+2. For the first case we show an infinite family of colorings with 3k/sup 2/ colors and conjecture that these are the only colorings with 3k/sup 2/ colors.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/S0895480104439589\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/S0895480104439589","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

对于z/sub 1/, z/sub 2/, z/sub 3/ /spl isin/ z/ sup 2/,距离d/sub 3/(z/sub 1/, z/sub 2/, z/sub 3/)是z/ sup 2/上的L/sub 1/-距离的泛化,反映了三个点而不是两个点的相对色散。我们证明至少需要3k/sup 2/的颜色来为Z/sup 2/的点上色,使得任何三个不同的点之间的距离至少为4k,用相同的颜色上色。我们还证明,如果距离至少为4k+2,则需要3k/sup 2/+3k+1颜色。对于第一种情况,我们展示了无限种具有3k/sup 2/颜色的着色,并推测这些是唯一具有3k/sup 2/颜色的着色。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the optimality of coloring with a lattice
For z/sub 1/, z/sub 2/, z/sub 3/ /spl isin/ Z/sup 2/, the tristance d/sub 3/(z/sub 1/, z/sub 2/, z/sub 3/) is a generalization of the L/sub 1/-distance on Z/sup 2/ to a quality that reflects the relative dispersion of three points rather than two. We prove that at least 3k/sup 2/ colors are required to color the points of Z/sup 2/, such that the tristance between any three distinct points, colored with the same color, is at least 4k. We also prove that 3k/sup 2/+3k+1 colors are required if the tristance is at least 4k+2. For the first case we show an infinite family of colorings with 3k/sup 2/ colors and conjecture that these are the only colorings with 3k/sup 2/ colors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A new optimal double periodical construction of one target two-dimensional arrays Distributed power and admission control for time-varying wireless networks Optimal Bregman prediction and Jensen's equality Permutation codes: achieving the diversity-multiplexing tradeoff Subtree decomposition for network coding
×
引用
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