Computer solution to the 17-point Erdös-Szekeres problem

• Autores: George Szekeres, Lindsay Peters
• Localización: Anziam journal: The Australian & New Zealand industrial and applied mahtematics journal, ISSN 1446-1811, Vol. 48, Nº 2, 2006, págs. 151-164
• Idioma: inglés
• DOI: 10.1017/s144618110000300x
• Texto completo no disponible (Saber más ...)
• Resumen

  • We 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.