Discovery Projects - Grant ID: DP140104246

Funded Activity Summary

Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unites geometric techniques with powerful methods from operations research, such as linear and discrete optimisation, to build fast, powerful tools that can for the first time systematically solve large topological problems. Theoretically, this project has significant impact on the famous open problem of detecting knottedness in fast polynomial time.

Funded Activity Details

Start Date: 01-01-2014

End Date: 31-12-2017

Funding Scheme: Discovery Projects

Funding Amount: $350,000.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

Analysis of Algorithms and Complexity | Optimisation | Pure Mathematics | Topology

ANZSRC Socio-Economic Objective (SEO)

Expanding Knowledge in the Information and Computing Sciences | Application Software Packages (excl. Computer Games) | Expanding Knowledge in the Mathematical Sciences |

Other Keywords

Analysis of Algorithms and Complexity | Application Software Packages (excl. Computer Games) | Expanding Knowledge in the Information and Computing Sciences | Expanding Knowledge in the Mathematical Sciences | Optimisation | Pure Mathematics | Topology

Related Links