Automated conjecturing of Frobenius numbers via grammatical evolution

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@Misc{oai:arXiv.org:1410.0532,
  title =        "Automated conjecturing of Frobenius numbers via
                 grammatical evolution",
  note =         "Comment: 8 pages, 2 tables; added a clear
                 introduction, otherwise reduced text significantly",
  author =       "Nikola Adzaga",
  year =         "2014",
  month =        feb # "~17",
  abstract =     "Conjecturing formulae and other symbolic relations
                 occurs frequently in number theory and combinatorics.
                 If we could automate conjecturing, we could benefit not
                 only from speeding up, 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 for one conjectured formula, using lattice point
                 enumeration method, is provided as well. Same method
                 can easily be used on other problems to speed up and
                 enhance the research process.",
  bibsource =    "OAI-PMH server at export.arxiv.org",
  oai =          "oai:arXiv.org:1410.0532",
  keywords =     "genetic algorithms, genetic programming, grammatical
                 evolution, mathematics, number theory, mathematics -
                 combinatorics",
  URL =          "http://arxiv.org/abs/1410.0532",
  notes =        "Faculty of Civil Engineering, University of Zagreb",
}

Genetic Programming entries for Nikola Adzaga

Citations