Discovery Early Career Researcher Award - Grant ID: DE130101191
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
Formation of the osteocyte network in bone matrix. The formation of new bone, which occurs throughout life for bone renewal and acutely after fractures, entraps a network of cells that can detect micro-damage and direct repair mechanisms. Mathematical and computational methods will be used to understand how this network can lead to a self-detecting and self-repairing biomaterial.
Discovery Early Career Researcher Award - Grant ID: DE180100957
Funder
Australian Research Council
Funding Amount
$339,328.00
Summary
Partial differential equations, free boundaries and applications. This project aims to investigate fundamental problems in the analysis of partial differential equations and free boundary theory, to develop advanced mathematical theories with the possibility of important applications. The expected outcome is the establishment of a regularity and classification theory for nonlocal equations and for free boundary problems in linear and nonlinear settings. The benefit of the project lies in a concr ....Partial differential equations, free boundaries and applications. This project aims to investigate fundamental problems in the analysis of partial differential equations and free boundary theory, to develop advanced mathematical theories with the possibility of important applications. The expected outcome is the establishment of a regularity and classification theory for nonlocal equations and for free boundary problems in linear and nonlinear settings. The benefit of the project lies in a concrete advancement of the mathematical research with advantages for a deeper understanding of complex phenomena in physics and biology. Some of the problems also provide results useful for industrial applications.Read moreRead less
Optimising disease surveillance to support decision-making. COVID-19 has demonstrated the critical role of epidemic data and analytics in guiding government response to pandemic threats, reducing disease and saving lives. The demand for epidemic analytics for response to threats of national significance will only grow. The goals of this project are to 1) determine the combination(s) of surveillance methods that provide the most useful data for epidemic analysis and 2) translate these findings in ....Optimising disease surveillance to support decision-making. COVID-19 has demonstrated the critical role of epidemic data and analytics in guiding government response to pandemic threats, reducing disease and saving lives. The demand for epidemic analytics for response to threats of national significance will only grow. The goals of this project are to 1) determine the combination(s) of surveillance methods that provide the most useful data for epidemic analysis and 2) translate these findings into the blueprint for a next-generation infectious disease surveillance system for Australia. We will use a simulation-evaluation approach, coupling methods from infectious disease modelling with those from information theory optimal design. Outcomes will enable more tailored and effective pandemic response.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
Symmetrical graphs, generalized polygons and expanders. This project proposes to study a class of highly symmetrical graphs -- locally s-arc-transitive graphs. Studying the class of graphs has been one of the central topics in algebraic graph theory for over 50 years. This class of graphs has been effectively used in computer science, communication network, group theory, geometry, and other areas. This project will develop new methods to solve several fundamental problems regarding locally s-arc ....Symmetrical graphs, generalized polygons and expanders. This project proposes to study a class of highly symmetrical graphs -- locally s-arc-transitive graphs. Studying the class of graphs has been one of the central topics in algebraic graph theory for over 50 years. This class of graphs has been effectively used in computer science, communication network, group theory, geometry, and other areas. This project will develop new methods to solve several fundamental problems regarding locally s-arc-transitive graphs, and apply the outcomes to solve important problems in communication networks, graph theory, group theory, and geometry.Read moreRead less
Numerical Algorithms for Constructing Feedback Control Laws. Many decision making problems in engineering, finance and management are governed by optimal feedback control systems. These systems are normally too complex to be solved by conventional numerical methods. In this project, we propose to develop novel numerical algorithms for constructing feedback control laws. We will also investigate the procatical significance of these algorithms for solving real-world problems. The outcome of the pr ....Numerical Algorithms for Constructing Feedback Control Laws. Many decision making problems in engineering, finance and management are governed by optimal feedback control systems. These systems are normally too complex to be solved by conventional numerical methods. In this project, we propose to develop novel numerical algorithms for constructing feedback control laws. We will also investigate the procatical significance of these algorithms for solving real-world problems. The outcome of the project will provide efficient and accurate tools for constructing feedback laws in high dimensions.Read moreRead less
Exact structure in graphs and matroids. One of the main goals of mathematics is to understand and describe the structure of the mathematical world. This project will contribute to this goal, and deepen our understanding of the fundamental mathematical structures called graphs and matroids, by providing exact structural descriptions of a number of important minor-closed classes.
Real chromatic roots of graphs and matroids. This project will develop the theory of real chromatic roots of graphs, especially as it applies to minor-closed classes of graphs, with the aim of extending this theory to minor-closed classes of matroids. One of the fundamental results from the study of real chromatic roots in graph theory is that any minor-closed class of graphs has an absolute upper bound on its chromatic roots. However, while many results on minor-closed classes on graphs have cl ....Real chromatic roots of graphs and matroids. This project will develop the theory of real chromatic roots of graphs, especially as it applies to minor-closed classes of graphs, with the aim of extending this theory to minor-closed classes of matroids. One of the fundamental results from the study of real chromatic roots in graph theory is that any minor-closed class of graphs has an absolute upper bound on its chromatic roots. However, while many results on minor-closed classes on graphs have close analogues or mild variants for minor-closed classes of matroids, this upper bound on real chromatic roots appears, somewhat mysteriously, to apply only to graphs. By studying the upper root-free intervals of minor-closed classes of matroids, this project aims to shed light on this phenomenon.Read moreRead less
Complex dynamical systems: inferring form and function of interacting biological systems. Often in biology a large number of simple parts interacting according to simple rules can result in behaviour that is rich and varied. This project aims to develop the mathematics of complex systems theory to describe how such collections of simple interacting parts can form large complicated structures, and to deduce what dynamical behaviour can result.
Symmetries of finite digraphs. Highly symmetrical graphs are well-studied and, in many respects, the theory for dealing with them is well-established. By comparison, our understanding of symmetrical digraphs is much poorer. There are some rather basic questions about these about which we know shamefully little. The aim of this project is to remedy this shortage of knowledge by extending many important results and theories about symmetrical graphs to digraphs.