AttributesValues
type
value
  • We consider three graphs, [Formula: see text], [Formula: see text], and [Formula: see text], related to Keller’s conjecture in dimension 7. The conjecture is false for this dimension if and only if at least one of the graphs contains a clique of size [Formula: see text]. We present an automated method to solve this conjecture by encoding the existence of such a clique as a propositional formula. We apply satisfiability solving combined with symmetry-breaking techniques to determine that no such clique exists. This result implies that every unit cube tiling of [Formula: see text] contains a facesharing pair of cubes. Since a faceshare-free unit cube tiling of [Formula: see text] exists (which we also verify), this completely resolves Keller’s conjecture.
Subject
  • Economic country classifications
  • International economic organizations
  • Logical expressions
  • 21st-century diplomatic conferences
  • 20th-century diplomatic conferences
  • Intergovernmental organizations
  • Organizations established in 1975
  • Cubes
  • Group of Seven
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software