Automated conjecturing of Frobenius numbers via grammatical evolution (CROSBI ID 226666)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Adžaga, Nikola
engleski
Automated conjecturing of Frobenius numbers via grammatical evolution
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, 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 grammatical evolution 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.
automated conjecturing ; Frobenius number ; grammatical evolution
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
26 (2)
2017.
247-252
objavljeno
1058-6458
1944-950X
10.1080/10586458.2016.1175393