Skip to main content
Article thumbnail
Location of Repository

Using tabu search and genetic algorithms in mathematics research

By Colin G. Johnson

Abstract

This paper discusses an ongoing project which uses computational heuristic search techniques such as tabu search and genetic algorithms as a tool for mathematics research. We discuss three ways in which such search techniques can be useful for mathematicians: in nding counterexamples to conjectures, in enumerating examples, and in nding sequences of transformations between two objects which are conjectured to be related. These problem-types are discussed using examples from topology

Topics: QA76
Publisher: Nottingham Trent University
Year: 2004
OAI identifier: oai:kar.kent.ac.uk:14050

Suggested articles

Citations

  1. (1983). Classi of knot projections. Topology and its Applications, doi
  2. (1983). Classification of knot projections. Topology and its Applications, doi
  3. (2001). Finding qualitative examples with genetic algorithms. doi
  4. (1996). Knot Theory and its Applications. doi
  5. (1996). Knot Theory and its Applications. Birkh auser, doi
  6. On vortex motion. doi
  7. (1989). Quantum- theory and the Jones polynomial. doi
  8. (1989). Quantum-field theory and the Jones polynomial. doi
  9. The enumeration, description, and construction of knots of fewer than ten crossings. doi
  10. (1994). The Knot Book. doi
  11. (2001). Understanding complex systems through examples: a framework for qualitative example- Systems Research and Information Systems,
  12. (2001). Understanding complex systems through examples: a framework for qualitative example-finding. Systems Research and Information Systems,
  13. (1990). Untangling DNA. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.