Author:
Szekeres George,Peters Lindsay
Abstract
AbstractWe describe a computer proof of the 17-point version of a conjecture originally made by Klein-Szekeres in 1932 (now commonly known as the “Happy End Problem”) that a planar configuration of 17 points, no 3 points collinear, always contains a convex 6-subset. The proof makes use of a combinatorial model of planar configurations, expressed in terms of signature functions satisfying certain simple necessary conditions. The proof is more general than the original conjecture as the signature functions examined represent a larger set of configurations than those which are realisable. Three independent implementations of the computer proof have been developed, establishing that the result is readily reproducible.
Publisher
Cambridge University Press (CUP)
Subject
Mathematics (miscellaneous)
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献