关于van der Waerden永久猜想的注解

Andrew M. Gleason
{"title":"关于van der Waerden永久猜想的注解","authors":"Andrew M. Gleason","doi":"10.1016/S0021-9800(70)80008-4","DOIUrl":null,"url":null,"abstract":"<div><p>The van der Waerden permanent conjecture is shown to belong to a large family of conjectured inequalities which are of some interest in themselves and all of which <em>might</em> be provable by a routine computation with convex bodies. In fact, the permanent conjecture in cases <em>n</em>=3 and 4 does yield to this method. For <em>n</em>=5, with the computations made by hand, no proof was found, but a slight extension of the computation (which would probably require electronic assistance) could still settle this case and perhaps even a few more small values of <em>n</em>. The question of whether the method must work remains open.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 1","pages":"Pages 54-64"},"PeriodicalIF":0.0000,"publicationDate":"1970-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80008-4","citationCount":"6","resultStr":"{\"title\":\"Remarks on the van der Waerden permanent conjecture\",\"authors\":\"Andrew M. Gleason\",\"doi\":\"10.1016/S0021-9800(70)80008-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The van der Waerden permanent conjecture is shown to belong to a large family of conjectured inequalities which are of some interest in themselves and all of which <em>might</em> be provable by a routine computation with convex bodies. In fact, the permanent conjecture in cases <em>n</em>=3 and 4 does yield to this method. For <em>n</em>=5, with the computations made by hand, no proof was found, but a slight extension of the computation (which would probably require electronic assistance) could still settle this case and perhaps even a few more small values of <em>n</em>. The question of whether the method must work remains open.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"8 1\",\"pages\":\"Pages 54-64\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80008-4\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800084\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

van der Waerden永久猜想属于一大族的猜想不等式,这些猜想不等式本身就很有趣,而且所有的猜想不等式都可以用凸体的常规计算来证明。事实上,在n=3和4的情况下,永久猜想确实屈服于这种方法。对于n=5,通过手工计算,没有找到证据,但是稍微扩展一下计算(可能需要电子辅助)仍然可以解决这个问题,甚至可能解决几个更小的n值。这个方法是否一定有效的问题仍然存在。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Remarks on the van der Waerden permanent conjecture

The van der Waerden permanent conjecture is shown to belong to a large family of conjectured inequalities which are of some interest in themselves and all of which might be provable by a routine computation with convex bodies. In fact, the permanent conjecture in cases n=3 and 4 does yield to this method. For n=5, with the computations made by hand, no proof was found, but a slight extension of the computation (which would probably require electronic assistance) could still settle this case and perhaps even a few more small values of n. The question of whether the method must work remains open.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Announcement A rank inequality for finite geometric lattices On the factorisation of the complete graph into factors of diameter 2 On nonreconstructable tournaments The number of classes of isomorphic graded partially ordered sets
×
引用
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