Hypergraph models for complex discrete systems. This project aims to better understand the structure and properties of very large hypergraphs of various kinds. Hypergraphs are very general mathematical objects which can be used to model complex discrete systems. They arise naturally in many areas such as ecology, chemistry and computer science. Despite this, our theoretical understanding of very large, or random, hypergraphs lags far behind the intensely-studied special case of graphs. This proj ....Hypergraph models for complex discrete systems. This project aims to better understand the structure and properties of very large hypergraphs of various kinds. Hypergraphs are very general mathematical objects which can be used to model complex discrete systems. They arise naturally in many areas such as ecology, chemistry and computer science. Despite this, our theoretical understanding of very large, or random, hypergraphs lags far behind the intensely-studied special case of graphs. This project will answer many fundamental questions about large, random hypergraphs. The expected outcomes of the project also include new tools for working with hypergraphs, such as efficient algorithms for sampling hypergraphs. These outcomes will benefit researchers who use hypergraphs in their work and will enhance Australia's reputation for research in this area.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE200100056
Funder
Australian Research Council
Funding Amount
$403,019.00
Summary
Statistical shape analysis using persistent homology. Statistical shape analysis is the quantitative study of variation in geometric shape. An innovative approach applies concepts from algebraic topology in the form of the persistent homology transform. This project aims to prove mathematical theory relating to the persistent homology transform, to develop new statistical theory and methodology, and to apply this theory to a range of applications including the analysis of bird beaks, human skull ....Statistical shape analysis using persistent homology. Statistical shape analysis is the quantitative study of variation in geometric shape. An innovative approach applies concepts from algebraic topology in the form of the persistent homology transform. This project aims to prove mathematical theory relating to the persistent homology transform, to develop new statistical theory and methodology, and to apply this theory to a range of applications including the analysis of bird beaks, human skulls and boundary contours of stem cells. An anticipated goal is the generation of new and significant theoretical results in topological data analysis. Expected outcomes include a topologically motivated platform for shape analysis that is statistically rigorous and has firm mathematical foundations.
Read moreRead less
Spectral Theory of Hamiltonian Dynamical Systems. Stability theory of steady states, travelling waves, periodic waves, and other coherent structures in nonlinear Hamiltonian partial differential equations is a cornerstone of modern dynamical systems. In particular it is of utmost importance to reliably compute eigenvalues, which determine the stability or instability of such structures. This project will develop methods to compute the spectrum of Hamiltonian operators in more than one spatial di ....Spectral Theory of Hamiltonian Dynamical Systems. Stability theory of steady states, travelling waves, periodic waves, and other coherent structures in nonlinear Hamiltonian partial differential equations is a cornerstone of modern dynamical systems. In particular it is of utmost importance to reliably compute eigenvalues, which determine the stability or instability of such structures. This project will develop methods to compute the spectrum of Hamiltonian operators in more than one spatial dimension. It will use the powerful geometric tools of the Maslov index and the Evans function. We will use these to simultaneously advance, and bring together the theories of the two dimensional Euler equations and Jacobi operators.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE190100666
Funder
Australian Research Council
Funding Amount
$381,000.00
Summary
Extremal combinatorics meets finite geometry. This project aims to investigate important open problems lying at the intersection of two areas of mathematics, extremal combinatorics and finite geometry. The project will focus on the area of discrete mathematics, which has been at the centre of some of recent developments in mathematics and computer science. This project proposes new methods, derived from algebra, geometry and computer science, to tackle important extremal problems in finite geome ....Extremal combinatorics meets finite geometry. This project aims to investigate important open problems lying at the intersection of two areas of mathematics, extremal combinatorics and finite geometry. The project will focus on the area of discrete mathematics, which has been at the centre of some of recent developments in mathematics and computer science. This project proposes new methods, derived from algebra, geometry and computer science, to tackle important extremal problems in finite geometry. The project will provide answers to a number of open problems in extremal combinatorics and finite geometry. Moreover, new methods will be developed which will have an interdisciplinary impact.Read moreRead less
The Zarankiewicz problem through linear hypergraphs and designs. The Zarankiewicz problem is a famous open problem with deep connections to many different areas of mathematics. Despite continued attention from some of the world's most celebrated mathematicians, it has remained unsolved for over 70 years. This project aims to make major progress on the Zarankiewicz problem by utilising a novel approach based in the field of combinatorial design theory. This approach will leverage recent major bre ....The Zarankiewicz problem through linear hypergraphs and designs. The Zarankiewicz problem is a famous open problem with deep connections to many different areas of mathematics. Despite continued attention from some of the world's most celebrated mathematicians, it has remained unsolved for over 70 years. This project aims to make major progress on the Zarankiewicz problem by utilising a novel approach based in the field of combinatorial design theory. This approach will leverage recent major breakthroughs in design theory concerning edge decompositions of dense hypergraphs.Read moreRead less
New directions in extremal and structural graph theory. This project aims to attack unsolved problems at the intersection of extremal and structural graph theory, two of the most significant branches of graph theory. Graph theory, which is the mathematics of networks, models many real-world problems and is a key component of modern mathematics. This project expects to develop a theory that synthesises the latest developments in the two fields. It is expected that the tools developed will be wide ....New directions in extremal and structural graph theory. This project aims to attack unsolved problems at the intersection of extremal and structural graph theory, two of the most significant branches of graph theory. Graph theory, which is the mathematics of networks, models many real-world problems and is a key component of modern mathematics. This project expects to develop a theory that synthesises the latest developments in the two fields. It is expected that the tools developed will be widely applicable, for example, in algorithms for network optimisation. The project will build collaborations between Australian researchers and world-leading international mathematicians, and will provide advanced training for talented young researchers.Read moreRead less
Enumeration and properties of large discrete structures. This project aims to study a fundamental property of random graphs, by further developing a recently introduced approach to the problem of enumerating graphs with given degrees. Using this new method, the project expects to generate new knowledge on the number of connections that each node has with other nodes in a random graph, and to develop new strategies for counting the graphs or networks with a given property. The project expects to ....Enumeration and properties of large discrete structures. This project aims to study a fundamental property of random graphs, by further developing a recently introduced approach to the problem of enumerating graphs with given degrees. Using this new method, the project expects to generate new knowledge on the number of connections that each node has with other nodes in a random graph, and to develop new strategies for counting the graphs or networks with a given property. The project expects to produce new theoretical results as well as enhanced capabilities of mathematical research. Potential benefits arise through the uses of these theoretical combinatorial objects to study naturally occurring networks such as social networks, the network of the world wide web, and chemical compounds.Read moreRead less
Enumeration and random generation of contingency tables with given margins. This project aims to find algorithms to construct random tables of numbers having given totals across the rows and down the columns. The aim is also to study properties of such tables. A significant aspect of the project is that it is expected to cover scenarios where all existing methods fail, by deploying recently developed powerful techniques used for random networks in combinatorics. Expected outcomes of this project ....Enumeration and random generation of contingency tables with given margins. This project aims to find algorithms to construct random tables of numbers having given totals across the rows and down the columns. The aim is also to study properties of such tables. A significant aspect of the project is that it is expected to cover scenarios where all existing methods fail, by deploying recently developed powerful techniques used for random networks in combinatorics. Expected outcomes of this project include the development of efficient algorithms that can be used in statistics for identifying relationships between variables in large data sets. This would help bring Australia to the forefront of research in an area that is significant both in data analysis and in discrete mathematics.
Read moreRead less
Triangulations: linking geometry and topology with combinatorics. Triangulations are the method of choice to represent geometric objects given by a finite sample of points. Prominent examples include the pictures produced by the finite element method, polytopes in optimisation, or surfaces in computer graphics.
Knowledge about the triangulations of an object and how they relate to each other is essential for these applications. Seemingly canonical and straightforward methods perform well - or n ....Triangulations: linking geometry and topology with combinatorics. Triangulations are the method of choice to represent geometric objects given by a finite sample of points. Prominent examples include the pictures produced by the finite element method, polytopes in optimisation, or surfaces in computer graphics.
Knowledge about the triangulations of an object and how they relate to each other is essential for these applications. Seemingly canonical and straightforward methods perform well - or not at all, depending on intricate and highly involved mathematical properties.
In this project we combine geometric and topological viewpoints to tackle high-profile questions about triangulations. This will unlock the full potential of combinatorial methods and practical algorithms in applications.Read moreRead less
A unified approach to the design of minimum length networks. This project aims to develop a new approach to designing minimum length interconnection networks by analysing their geometric structure. These networks form the basis of communication, power and transport systems. Optimising the design of such networks is a mathematically challenging problem of high computational complexity. This project will use an innovative method based on a relationship between the geometry of networks and a type o ....A unified approach to the design of minimum length networks. This project aims to develop a new approach to designing minimum length interconnection networks by analysing their geometric structure. These networks form the basis of communication, power and transport systems. Optimising the design of such networks is a mathematically challenging problem of high computational complexity. This project will use an innovative method based on a relationship between the geometry of networks and a type of partitioning of the plane called an oriented Voronoi diagram. The outcome will be efficient new algorithms for designing physical networks, which, in practice, will ultimately lead to a reduction in network infrastructure costs for industries in Australia.
Read moreRead less