Improved Bound for the Gerver-Ramsey Collinearity Problem

T. Lidbetter
{"title":"Improved Bound for the Gerver-Ramsey Collinearity Problem","authors":"T. Lidbetter","doi":"10.48550/arXiv.2303.14579","DOIUrl":null,"url":null,"abstract":"Let $S$ be a finite subset of $\\mathbb{Z}^n$. A vector sequence $(\\mathbf{z}_i)$ is an $S$-walk if and only if $\\mathbf{z}_{i+1} - \\mathbf{z}_i$ is an element of $S$ for all $i$. Gerver and Ramsey showed in 1979 that for $S\\subset \\mathbb{Z}^3$ there exists an infinite $S$-walk in which no $5^{11} + 1=48{\\small,}828{\\small,}126$ points are collinear. Here, we use the same general approach, but with the aid of a computer search, to improve the bound to $189$.","PeriodicalId":21749,"journal":{"name":"SIAM J. Discret. Math.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM J. Discret. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2303.14579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Let $S$ be a finite subset of $\mathbb{Z}^n$. A vector sequence $(\mathbf{z}_i)$ is an $S$-walk if and only if $\mathbf{z}_{i+1} - \mathbf{z}_i$ is an element of $S$ for all $i$. Gerver and Ramsey showed in 1979 that for $S\subset \mathbb{Z}^3$ there exists an infinite $S$-walk in which no $5^{11} + 1=48{\small,}828{\small,}126$ points are collinear. Here, we use the same general approach, but with the aid of a computer search, to improve the bound to $189$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Gerver-Ramsey共线性问题的改进界
设$S$是$\mathbb{Z}^n$的有限子集。向量序列$(\mathbf{z}_i)$是$S$-walk当且仅当$\mathbf{z}_{i+1} - \mathbf{z}_i$对于所有$i$都是$S$的元素。Gerver和Ramsey在1979年证明了对于$S\子集\mathbb{Z}^3$存在一个无限$S$-walk,其中没有$5^{11}+ 1=48{\small,}828{\small,}126$点共线。在这里,我们使用相同的一般方法,但借助计算机搜索,将绑定提高到$189$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Which is the Worst-Case Nash Equilibrium? On Book Crossing Numbers of the Complete Graph Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths A family of counterexamples for a conjecture of Berge on α-diperfect digraphs Expanders on Matrices over a Finite Chain Ring, II
×
引用
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