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
The fundamental structure of combinatorial configurations. Combinatorial configurations are fundamental mathematical tools used to model physical problems in the information sciences. Combinatorial trades arise from the differences between combinatorial configurations. They uniquely determine the underlying structure of the configuration and are central to the determination of defining sets. With this proposal we shall study the existence, properties and applications of combinatorial trades and ....The fundamental structure of combinatorial configurations. Combinatorial configurations are fundamental mathematical tools used to model physical problems in the information sciences. Combinatorial trades arise from the differences between combinatorial configurations. They uniquely determine the underlying structure of the configuration and are central to the determination of defining sets. With this proposal we shall study the existence, properties and applications of combinatorial trades and the associated defining sets. Our results will have applications in the areas of biotechnology, information systems, information security and experimental design.Read moreRead less
Expander graphs, isoperimetric numbers, and forwarding indices. Expanders are sparse but well connected networks. With numerous applications to modern technology, they have attracted many world leaders in mathematics and computer science. This project aims at substantial advancement on some important problems on expanders and related areas. It will put Australia at the forefront of this topical field.
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
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
Ring constructions and algorithms for enhancing performance of BCH codes. BCH codes form a major class of codes used in modern communication systems. The aim of this project is to enhance the efficiency of this class of codes by combining them in constructions enabling correction of deletion and insertion errors, and develop efficient implementations of encoding and decoding algorithms incorporating soft decision methods for enhanced error correction. Significance of the project is explained by ....Ring constructions and algorithms for enhancing performance of BCH codes. BCH codes form a major class of codes used in modern communication systems. The aim of this project is to enhance the efficiency of this class of codes by combining them in constructions enabling correction of deletion and insertion errors, and develop efficient implementations of encoding and decoding algorithms incorporating soft decision methods for enhanced error correction. Significance of the project is explained by the role of fast, secure and reliable communications in modern information and communication technology. Expected outcomes include new efficient algorithms and commercial modules available for symbolic computation systems with applications in telecommunications industry.
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