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
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
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
Discovery Early Career Researcher Award - Grant ID: DE130100762
Funder
Australian Research Council
Funding Amount
$309,609.00
Summary
The interplay between structures and algorithms in combinatorial optimisation. Networks are ubiquitous in science, technology, and virtually all aspects of life. The project aims to make progress on central questions in the mathematical theory of networks. These include designing efficient algorithms for approximating the Hadwiger number, which is a key measure of the complexity of a network.
Discovery Early Career Researcher Award - Grant ID: DE190100888
Funder
Australian Research Council
Funding Amount
$333,924.00
Summary
Linear recurrence sequences over function fields and their applications. This project aims to deeply and systematically develop the theory of linear recurrence sequences (LRS) defined over function fields. Linear recurrence sequences (LRS) appear almost everywhere in mathematics and computer science. The project is expected to expand our knowledge on LRS and will span a wide range of new research directions. Through investigating and revealing the theoretical and practical aspects of LRS over fu ....Linear recurrence sequences over function fields and their applications. This project aims to deeply and systematically develop the theory of linear recurrence sequences (LRS) defined over function fields. Linear recurrence sequences (LRS) appear almost everywhere in mathematics and computer science. The project is expected to expand our knowledge on LRS and will span a wide range of new research directions. Through investigating and revealing the theoretical and practical aspects of LRS over function fields, the project will enrich the toolkits for cybersecurity by providing new approaches to cryptography. The outcomes of the project will help position Australia as a leader in this field.Read moreRead less
Topological containment and the Hajós Conjecture: new structure theorems from computer search. This projects aims to characterise when a network contains within it the topology, or shape, of a specific smaller network. It will develop new tools that use computer search to find such characterisations. The outcomes of this project will be used to attack one of the remaining unsolved cases of a famous conjecture dating back over sixty years.
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.