Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and g ....Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and groups, and the theory of rewriting systems, together with recent breakthroughs by the team ensures that significant results can be expected.
Benefits include training research students and postdoctoral researchers in cutting-edge techniques, and advancing fundamental knowledge in mathematics and computer science.Read moreRead less
Towards the prime power conjecture. This project attacks a famous and long standing conjecture in pure mathematics that has important ramifications in many applied areas. The project aims to determine when it is possible to produce more efficient codes for electronic communication and statistically balanced designs for experiments in areas as diverse as agriculture and psychology.
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 unit ....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.Read moreRead less
Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from ....Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from the field of parameterised complexity, creating powerful, practical solutions for these problems. It is expected to shed much-needed light on the vast and puzzling gap between theory and practice, and give researchers fast new software tools for large-scale experimentation and cutting-edge computer proofs.Read moreRead less