{"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}
引用次数: 6
Abstract
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.
van der Waerden永久猜想属于一大族的猜想不等式,这些猜想不等式本身就很有趣,而且所有的猜想不等式都可以用凸体的常规计算来证明。事实上,在n=3和4的情况下,永久猜想确实屈服于这种方法。对于n=5,通过手工计算,没有找到证据,但是稍微扩展一下计算(可能需要电子辅助)仍然可以解决这个问题,甚至可能解决几个更小的n值。这个方法是否一定有效的问题仍然存在。