Generalised topological spaces. Pure mathematics creates abstractions of real-world entities; one such is the idea of a 'topological space', which abstracts from geometric forms like cubes and toruses. But topological spaces fail to capture geometric structures arising in areas like quantum physics; and this project seeks to rectify this, by developing a new more general notion.
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
Combinatorial structures for computer security and communication. Hadamard matrices in their various guises arise many times in the study of reliable communications and secure communications. The aim of this research project is to use the theory of cyclotomy in both fields and rings to find new number theoretic results which will then be used to obtain new with zero or small autocorrelation functions.
The significance of this research is to propose new construction of Hadamard matrices and bloc ....Combinatorial structures for computer security and communication. Hadamard matrices in their various guises arise many times in the study of reliable communications and secure communications. The aim of this research project is to use the theory of cyclotomy in both fields and rings to find new number theoretic results which will then be used to obtain new with zero or small autocorrelation functions.
The significance of this research is to propose new construction of Hadamard matrices and block designs for computer security and wireless network communication.
We expect some new classes of Hadamard matrices and block designs can be constructed for security and communication applications and several papers would be submitted or published.
Read moreRead less
Reflection groups. The study of symmetry in geometrical and abstract contexts is a central issue in such diverse areas as mathematical physics, singularity theory, algebraic geometry, quantum groups and the study of knots and braids. Group theory provides the mathematical framework for the analysis of symmetry. Reflection groups, simple examples of which are the symmetry groups of the five platonic solids, play a key role in all of the areas mentioned above. Thus an improved understanding of ref ....Reflection groups. The study of symmetry in geometrical and abstract contexts is a central issue in such diverse areas as mathematical physics, singularity theory, algebraic geometry, quantum groups and the study of knots and braids. Group theory provides the mathematical framework for the analysis of symmetry. Reflection groups, simple examples of which are the symmetry groups of the five platonic solids, play a key role in all of the areas mentioned above. Thus an improved understanding of reflection groups will significantly enhance the development of several important theories.
Read moreRead less
Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints. Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distribution of goods etc. - and the theoretical analysis of such networks has become a subject of fundamental importance. Networks can be modelled by graphs. This project will provide new theoretical results which will improve our knowledge of network topologi ....Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints. Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distribution of goods etc. - and the theoretical analysis of such networks has become a subject of fundamental importance. Networks can be modelled by graphs. This project will provide new theoretical results which will improve our knowledge of network topologies. The new knowledge will then be utilised in the construction of large graphs with respect to given maximum degree and distance constraints.Read moreRead less
Pyramids and decomposition numbers for the symmetric and general linear groups. This project takes a novel approach to the decomposition number problem for the symmetric and general linear groups by setting up a new framework for computing them using the combinatorics of pyramids. The decomposition numbers of an algebra are an important statistic which gives detailed structural information about its representations. These numbers can be used to compute the dimensions of the irreducible represen ....Pyramids and decomposition numbers for the symmetric and general linear groups. This project takes a novel approach to the decomposition number problem for the symmetric and general linear groups by setting up a new framework for computing them using the combinatorics of pyramids. The decomposition numbers of an algebra are an important statistic which gives detailed structural information about its representations. These numbers can be used to compute the dimensions of the irreducible representations of the algebra and they play an important role in the applications of representation theory to other fields such as knot theory and statistical mechanics.Read 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 categories and categorical algebra. Algebra is the study of operations, such as addition and multiplication, and the relationships between these operations. This project will study two exciting new branches of algebra, quantum algebra and postmodern algebra, which will lead to important advances in physics, geometry, and computing.
The language complexity of problems in algebra and logic. This project focuses on a major problem at the intersection of algebra, logic and computer science, concerning equations over free groups and free monoids. Expected outcomes include a language-theoretic characterisation of solutions of equations in a wide class of groups and monoids, a language-theoretic understanding of the existential and first-order theories of free groups, and a classification of groups with indexed multiplication tab ....The language complexity of problems in algebra and logic. This project focuses on a major problem at the intersection of algebra, logic and computer science, concerning equations over free groups and free monoids. Expected outcomes include a language-theoretic characterisation of solutions of equations in a wide class of groups and monoids, a language-theoretic understanding of the existential and first-order theories of free groups, and a classification of groups with indexed multiplication tables and EDT0L word problem. The project is designed to expand the frontiers of knowledge in theoretical computer science and pure mathematics, but in the longer term to deepen our understanding of computers, their computational power and intrinsic limitations.Read moreRead less
Discrete differential geometry: theory and applications. Sophisticated freeform structures made of glass and metal panels are omnipresent and their architectural design has been shown to be intimately related to a new area of mathematics, namely discrete differential geometry. This project is concerned with the theoretical basis of discrete differential geometry and its real world applications.