Acquiring Maps of Interrelated Conjectures on Sharp Bounds

Anselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos, Georg MartiusarXiv 2022 · DOI · arXiv

Abstract

To automate the discovery of conjectures on combinatorial objects, we introduce the concept of a map of sharp bounds on characteristics of combinatorial objects, that provides a set of interrelated sharp bounds for these combinatorial objects. We then describe a Bound Seeker, a CP-based system, that gradually acquires maps of conjectures. The system was tested for searching conjectures on bounds on characteristics of digraphs: it constructs sixteen maps involving 431 conjectures on sharp lower and upper-bounds on eight digraph characteristics.
BibTeX
@misc{paulus2022acquiring,
  author = {Anselm Paulus and Michal Rolínek and Vít Musil and Brandon Amos and Georg Martius},
  title = {{Acquiring Maps of Interrelated Conjectures on Sharp Bounds}},
  year = {2022},
  eprint = {2105.02343},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2105.02343},
}

Loading related content...

Figure