Automated Conjecturing of Frobenius Numbers via Grammatical Evolution. Issue 2 (3rd April 2017)

• Record Type: Journal Article
• Authors: Adžaga, Nikola
• Is Part Of: Experimental mathematics. Volume 26:Issue 2(2017)
• Page Start: 247
• Page End: 252
• Publication Date: 2017-04-03
• Subjects: automated conjecturing -- Frobenius problem -- grammatical evolution; 11D07 -- 68Q42; Mathematics -- Periodicals; Mathematics -- Research -- Periodicals; 510.724
• DOI: 10.1080/10586458.2016.1175393
• Languages: English
• ISSNs: 1058-6458

Abstract

Abstract: Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from faster conjecturing but also from finding conjectures previously out of our grasp. Grammatical evolution (GE), a genetic programming technique, can be used for automated conjecturing in mathematics. Concretely, this work describes how one can interpret the Frobenius problem as a symbolic regression problem, and then apply GE to it. In this manner, a few formulas for Frobenius numbers of specific quadruples were found automatically. The sketch of the proof of one conjectured formula, using lattice point enumeration method, is provided as well. The same method can easily be used on other problems to speed up and enhance the research process.