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
Complexity of group algorithms and statistical fingerprints of groups. This project aims to shape the next generation of efficient randomised algorithms in the field of group theory, the mathematics of symmetry. Fundamental mathematics underpins modern technological tasks such as web searches, sorting and data compression. This project aims to determine characteristic statistical fingerprints of key building-block groups. These group statistics lead to much faster procedures to essentially facto ....Complexity of group algorithms and statistical fingerprints of groups. This project aims to shape the next generation of efficient randomised algorithms in the field of group theory, the mathematics of symmetry. Fundamental mathematics underpins modern technological tasks such as web searches, sorting and data compression. This project aims to determine characteristic statistical fingerprints of key building-block groups. These group statistics lead to much faster procedures to essentially factor huge groups into smaller building-block groups in a manner akin to factoring an integer into its prime factors. The anticipated goal is to include the outcomes in publicly available symbolic algebra computer packages. As the theory of symmetry has broad applications in the mathematical and physical sciences, there is the potential for far reaching benefits.Read moreRead less
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
The arithmetic of supersingular elliptic curves. The proposed research will have substantial benefits both in the area of pure mathematics, and to the standing of number theory within Australia generally. If successful, the investigators envisage: - fundamental advances in the study of both elliptic curves and modular forms; - key progress in our understanding of the final Millenium Prize Problem in Mathematics; - academic software to compute special values of L-functions; - applications to com ....The arithmetic of supersingular elliptic curves. The proposed research will have substantial benefits both in the area of pure mathematics, and to the standing of number theory within Australia generally. If successful, the investigators envisage: - fundamental advances in the study of both elliptic curves and modular forms; - key progress in our understanding of the final Millenium Prize Problem in Mathematics; - academic software to compute special values of L-functions; - applications to computational mathematics, particularly elliptic curve cryptosystems; - a huge boost to the development of number theory Australia-wide.
Read moreRead less
From quantum integrable systems to algebraic geometry and combinatorics. The purpose of this project is to investigate the deep connections that have recently emerged between the study of an area of mathematical physics (quantum integrable systems) and subjects of pure mathematics (enumerative and algebraic combinatorics, and algebraic geometry). These connections have a common root, which this project plans to reveal using novel methods coming from quantum integrability. This approach is expect ....From quantum integrable systems to algebraic geometry and combinatorics. The purpose of this project is to investigate the deep connections that have recently emerged between the study of an area of mathematical physics (quantum integrable systems) and subjects of pure mathematics (enumerative and algebraic combinatorics, and algebraic geometry). These connections have a common root, which this project plans to reveal using novel methods coming from quantum integrability. This approach is expected to illuminate these subjects leading to a new unified and interdisciplinary picture, and to resolve important open problems in the study of certain algebraic varieties and of their cohomology in the theory of symmetric functions, and related counting problems.Read moreRead less
Explicit Construction of Global Function Fields with Many Rational Places. The use of error-correcting codes and cryptosystems is fundamental to the secure and reliable operation of many technological devices that we depend upon in our everyday lives. Essentially invisible, both coding theory and cryptography are essential for banking (ATM machines, e-banking), commerce (e-commerce), defense (cryptography) and entertainment (digital TV and radio, music CDs, DVDs). While certain families of "goo ....Explicit Construction of Global Function Fields with Many Rational Places. The use of error-correcting codes and cryptosystems is fundamental to the secure and reliable operation of many technological devices that we depend upon in our everyday lives. Essentially invisible, both coding theory and cryptography are essential for banking (ATM machines, e-banking), commerce (e-commerce), defense (cryptography) and entertainment (digital TV and radio, music CDs, DVDs). While certain families of "good" codes and cryptosystems can be constructed from specific function fields whose existence is guaranteed by abstract theory, often no actual construction for the function field is currently known. We aim to close this gap, making a greater range of "good" codes and cryptosystems available for practical applications.
Read moreRead less
Constructive Representation Theory and its Applications. The algorithms developed will make it possible to determine the different ways (representations) in which a group of symmetries may be realised as transformations of some space. Such knowledge is required in many areas including differential equations, digital signal processing, engineering ('strut-and-cable' constructions), the design of telephone networks, crystallography and quantum information processing. The high-performance tools fo ....Constructive Representation Theory and its Applications. The algorithms developed will make it possible to determine the different ways (representations) in which a group of symmetries may be realised as transformations of some space. Such knowledge is required in many areas including differential equations, digital signal processing, engineering ('strut-and-cable' constructions), the design of telephone networks, crystallography and quantum information processing. The high-performance tools for linear algebra developed will also find application in cryptography and coding theory. This work represents the latest stage in a long-term project to discover practical algorithms for elucidating the properties of complex algebraic structures - an area where Australia is a world-leader.Read moreRead less
Computational Methods for Matrix Groups and Group Representations. The symmetry of a system is captured mathematically by the notion of a group. A set of matrices closed under multiplication and the taking of inverses is an important example of a group. For instance, the symmetries of many physical systems and other objects are captured by a group of matrices over the complex numbers. This project will develop the computational tools necessary for constructing and analyzing finite matrix groups ....Computational Methods for Matrix Groups and Group Representations. The symmetry of a system is captured mathematically by the notion of a group. A set of matrices closed under multiplication and the taking of inverses is an important example of a group. For instance, the symmetries of many physical systems and other objects are captured by a group of matrices over the complex numbers. This project will develop the computational tools necessary for constructing and analyzing finite matrix groups over infinite fields such as the complex numbers. These methods will find immediate application to many areas of science and engineering and, in particular, to the theory of quantum computation.
Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE140100088
Funder
Australian Research Council
Funding Amount
$378,628.00
Summary
Computing with matrix groups and Lie algebras: new concepts and applications. Computational algebra combines symbolic computation and pure research in algebra, and is concerned with the design of algorithms for solving mathematical problems endowed with algebraic structure. Matrix groups and Lie algebras are prominent algebraic objects describing the natural concept of symmetry. Despite being very common and important in science, there is a paucity of algorithms to study their structure. This pr ....Computing with matrix groups and Lie algebras: new concepts and applications. Computational algebra combines symbolic computation and pure research in algebra, and is concerned with the design of algorithms for solving mathematical problems endowed with algebraic structure. Matrix groups and Lie algebras are prominent algebraic objects describing the natural concept of symmetry. Despite being very common and important in science, there is a paucity of algorithms to study their structure. This project will develop deep new mathematical theories for computing with these objects, leading to ground-breaking advances in computational algebra, and providing powerful tools facilitating new research, including in other sciences. The new functionality will be used to solve two classification problems in group and Lie theory.Read moreRead less
Algorithms and computation in four-dimensional topology. This project will establish Australia as a world leader in computational topology, particularly in the all-important areas of topology in three and four dimensions. In four dimensions this work will be truly groundbreaking; until now the field has seen little development due to the complexity of the algorithms and computations required, and the applicant is in the unique position of having the necessary tools to make significant progress ....Algorithms and computation in four-dimensional topology. This project will establish Australia as a world leader in computational topology, particularly in the all-important areas of topology in three and four dimensions. In four dimensions this work will be truly groundbreaking; until now the field has seen little development due to the complexity of the algorithms and computations required, and the applicant is in the unique position of having the necessary tools to make significant progress in a feasible time frame. In three dimensions this project will strengthen the distinguished computational topology community in Melbourne, led by pioneers such as Rubinstein, Goodman, Hodgson as well as the applicant himself.Read moreRead less