Automated Conjecturing of Frobenius Numbers via Grammatical Evolution
Created by W.Langdon from
gpbibliography.bib Revision:1.7954
 @Article{Adzaga:2017:EM,

author = "Nikola Adzaga",

title = "Automated Conjecturing of {Frobenius} Numbers via
Grammatical Evolution",

journal = "Experimental Mathematics",

year = "2017",

volume = "26",

number = "2",

pages = "247252",

keywords = "genetic algorithms, genetic programming, grammatical
evolution, automated conjecturing, Frobenius problem",

ISSN = "10586458",

publisher = "Taylor \& Francis",

DOI = "doi:10.1080/10586458.2016.1175393",

size = "6 pages",

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.",

notes = "See also \cite{oai:arXiv.org:1410.0532}
Department of Mathematics, Faculty of Civil
Engineering, University of Zagreb, Zagreb, Croatia",
 }
Genetic Programming entries for
Nikola Adzaga
Citations