Continued Fractions and Torsion on Hyperelliptic Curves. Scientific advance should not blindly add to our knowledge; a true advance brings insights that collapse different issues into one. Understanding more is to need to remember less. For an important class of examples, this project identifies the study of a fundamental invariant of a quadratic number field, its regulator and hence its class number, with maximum torsion on the Jacobian variety of an hyperelliptic curve. The investigator's meth ....Continued Fractions and Torsion on Hyperelliptic Curves. Scientific advance should not blindly add to our knowledge; a true advance brings insights that collapse different issues into one. Understanding more is to need to remember less. For an important class of examples, this project identifies the study of a fundamental invariant of a quadratic number field, its regulator and hence its class number, with maximum torsion on the Jacobian variety of an hyperelliptic curve. The investigator's methods will surprise some longstanding problems into submission and in particular will lead them to reveal full data on torsion on hyperelliptic curves of low genus.
Read moreRead less
Asymptotic Geometric Analysis and Machine Learning. Phenomena in large dimensions appear in a number of domains of Mathematics and adjacent domains of science (e.g. Computer Science), dealing with functions of infinitely growing number of parameters. Here, we focus on several questions naturally linked to Asymptotic Geometric Analysis which have natural applications to Statistical Learning Theory. We intend to use geometric, probabilistic and combinatorial methods to investigate these problems, ....Asymptotic Geometric Analysis and Machine Learning. Phenomena in large dimensions appear in a number of domains of Mathematics and adjacent domains of science (e.g. Computer Science), dealing with functions of infinitely growing number of parameters. Here, we focus on several questions naturally linked to Asymptotic Geometric Analysis which have natural applications to Statistical Learning Theory. We intend to use geometric, probabilistic and combinatorial methods to investigate these problems, with an emphasis on modern tools in Empirical Processes Theory and the theory of Random Matrices.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE120100040
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
Partitioning and ordering Steiner triple systems. Steiner triple systems are fundamental mathematical objects with many real-world applications. This project will develop deep new insights into these objects, resulting in systems allowing many users to simultaneously use a communication channel, and in schemes for preventing the loss of computer data due to hard disk failures.
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
Chromatic polynomials, random graphs, and error-correcting codes: a unified approach to graph colouring problems. Through a unified approach involving cutting-edge results on chromatic polynomials, random graphs, matroids, and error-correcting codes, this project will establish the foundations for a rigorous mathematical framework for attempting to provide a short, transparent and illuminating solution to the Four Colour Problem. The project will support developments in computer science and sta ....Chromatic polynomials, random graphs, and error-correcting codes: a unified approach to graph colouring problems. Through a unified approach involving cutting-edge results on chromatic polynomials, random graphs, matroids, and error-correcting codes, this project will establish the foundations for a rigorous mathematical framework for attempting to provide a short, transparent and illuminating solution to the Four Colour Problem. The project will support developments in computer science and statistical mechanics and is likely to have flow-on effects in real-world disciplines such as network communication. This project will also strengthen Australia's international presence in discrete mathematics and will further strengthen ties between Australian and international mathematicians.Read moreRead less
Dynamics of eigenvalue/eigenspace algorithms with applications to signal processing. Many problems in signal and systems lead naturally to an eigenvalue/eigenspace determination and tracking problem; for example (acoustic) echo-cancellation, crosstalk suppression in ADSL modems, direction of arrival determination with an array of sensors, linear system identification etc. Exploiting methods from global analysis and dynamical systems theory we will study the available algorithms for eigenspace de ....Dynamics of eigenvalue/eigenspace algorithms with applications to signal processing. Many problems in signal and systems lead naturally to an eigenvalue/eigenspace determination and tracking problem; for example (acoustic) echo-cancellation, crosstalk suppression in ADSL modems, direction of arrival determination with an array of sensors, linear system identification etc. Exploiting methods from global analysis and dynamical systems theory we will study the available algorithms for eigenspace determination to characterise their computational efficiency, accuracy and effectiveness in various data scenarios. The analysis will lead to improved designs for eigenvalue/eigenspace algorithms, as well as design tools to engineer algorithms to specific situations.Read moreRead less
Multiplicative structure of rational functions. This project aims to develop new methods of investigating fundamental number theoretic notions of torsion and multiplicative dependence between objects of great interest such as rational functions and their values. This includes investigating such celebrated objects as torsion points on elliptic curves and torsion subgroups on algebraic varieties. The goal is to develop new methods and make pivotal advances towards solving several fundamental probl ....Multiplicative structure of rational functions. This project aims to develop new methods of investigating fundamental number theoretic notions of torsion and multiplicative dependence between objects of great interest such as rational functions and their values. This includes investigating such celebrated objects as torsion points on elliptic curves and torsion subgroups on algebraic varieties. The goal is to develop new methods and make pivotal advances towards solving several fundamental problems where multiplicative dependence plays a crucial role. The expected outcome is to provide deeper understanding of the intriguing nature of torsion and multiplicative dependence and thus open new perspectives for their applications in number theory and beyond.Read moreRead less
Stochastic Geometry for Multi-sensor Data Fusion System. The aim of this project is to develop efficient algorithms for tracking and sensor management in a multi-sensor multi-target environment. Finite random set theory provides a natural way of representing a random number of (random) object states, an issue that has been largely ignored in the tracking literature until recently. Although a satisfactory foundation for multiple object filtering has been provided by random set theory, in this ear ....Stochastic Geometry for Multi-sensor Data Fusion System. The aim of this project is to develop efficient algorithms for tracking and sensor management in a multi-sensor multi-target environment. Finite random set theory provides a natural way of representing a random number of (random) object states, an issue that has been largely ignored in the tracking literature until recently. Although a satisfactory foundation for multiple object filtering has been provided by random set theory, in this early stage no algorithm capable of tracking many targets has emerged from this framework. We are confident that efficient algorithms can be developed by exploiting the insights and mathematical tools of stochastic geometryRead moreRead less
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
Algebraic Schubert geometry and unitary reflection groups. This project aims to generalise the recent work of Elias and Williamson to the complex case. Fundamental to the study of symmetry are the ubiquitous Coxeter groups, which have an associated set of critically important ‘Kazhdan-Lusztig polynomials’. For some Coxeter groups, these may be interpreted in terms of classical geometry, leading to deep positivity properties for their coefficients. Elias and Williamson have recently shown that th ....Algebraic Schubert geometry and unitary reflection groups. This project aims to generalise the recent work of Elias and Williamson to the complex case. Fundamental to the study of symmetry are the ubiquitous Coxeter groups, which have an associated set of critically important ‘Kazhdan-Lusztig polynomials’. For some Coxeter groups, these may be interpreted in terms of classical geometry, leading to deep positivity properties for their coefficients. Elias and Williamson have recently shown that this geometry may be simulated algebraically for any Coxeter group, so positivity for Kazhdan-Lusztig polynomials holds for all Coxeter groups. This result has explosive consequences in many areas of geometry and algebra. This project is designed to extend these results to complex unitary reflection groups, with potentially dramatic consequences in number theory, representation theory and topology.Read moreRead less