几何Hales-Jewett型猜想的反例

V. Gruslys
{"title":"几何Hales-Jewett型猜想的反例","authors":"V. Gruslys","doi":"10.20382/jocg.v5i1a11","DOIUrl":null,"url":null,"abstract":"Por and Wood conjectured that for all $k,l \\ge 2$ there exists $n \\ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then there must be a line (that is, a maximal set of collinear points) all of whose points have the same colour. The conjecture is easily seen to be true for $l = 2$ (by the pigeonhole principle) and in the case $k = 2$ it is an immediate corollary of the Motzkin-Rabin theorem. In this note we show that the conjecture is false for $k, l \\ge 3$.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"38 1","pages":"245-249"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A counterexample to a geometric Hales-Jewett type conjecture\",\"authors\":\"V. Gruslys\",\"doi\":\"10.20382/jocg.v5i1a11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Por and Wood conjectured that for all $k,l \\\\ge 2$ there exists $n \\\\ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then there must be a line (that is, a maximal set of collinear points) all of whose points have the same colour. The conjecture is easily seen to be true for $l = 2$ (by the pigeonhole principle) and in the case $k = 2$ it is an immediate corollary of the Motzkin-Rabin theorem. In this note we show that the conjecture is false for $k, l \\\\ge 3$.\",\"PeriodicalId\":54969,\"journal\":{\"name\":\"International Journal of Computational Geometry & Applications\",\"volume\":\"38 1\",\"pages\":\"245-249\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20382/jocg.v5i1a11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v5i1a11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

摘要

Por和Wood推测,对于所有$k, $ 1 + $ 2$,存在$n$ 2$,具有以下性质:每当在平面上选择$n$点,其中没有$ 1 + 1$共线,并且每个点被赋予$k$颜色中的一个,则必须存在一条所有点具有相同颜色的直线(即共线点的最大集合)。这个猜想很容易在$l = 2$时被证明是正确的(通过鸽子洞原理),在$k = 2$的情况下,它是Motzkin-Rabin定理的直接推论。在这篇笔记中,我们证明这个猜想对于$k, $ l \ $ 3$是假的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A counterexample to a geometric Hales-Jewett type conjecture
Por and Wood conjectured that for all $k,l \ge 2$ there exists $n \ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then there must be a line (that is, a maximal set of collinear points) all of whose points have the same colour. The conjecture is easily seen to be true for $l = 2$ (by the pigeonhole principle) and in the case $k = 2$ it is an immediate corollary of the Motzkin-Rabin theorem. In this note we show that the conjecture is false for $k, l \ge 3$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
4
审稿时长
>12 weeks
期刊介绍: The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.
期刊最新文献
On morphs of 1-plane graphs A Geometric Approach to Inelastic Collapse Near-optimal algorithms for point-line fitting problems Algorithms for approximate sparse regression and nearest induced hulls Recognizing weighted and seeded disk graphs
×
引用
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