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
A new model for random discrete structures: distributions, counting and sampling. Random discrete structures are used in countless applications across science for modelling complex systems. This project will study a new, very general model of random discrete structures which encapsulates both random networks and random matrices. This project will develop general tools for working with this model, thereby unlocking the model for use by practitioners in areas such as physics, biology, statistics a ....A new model for random discrete structures: distributions, counting and sampling. Random discrete structures are used in countless applications across science for modelling complex systems. This project will study a new, very general model of random discrete structures which encapsulates both random networks and random matrices. This project will develop general tools for working with this model, thereby unlocking the model for use by practitioners in areas such as physics, biology, statistics and cryptography. The questions that will be tackled are fundamental problems in probability, and include as special cases the analysis of subgraph distribution in models of random networks, and the joint distribution of entries of contingency tables, which are important in statistics.Read moreRead less
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.
Analysis of the structure of latin squares. The benefits to Australia of fundamental research in core disciplines such as mathematics are well documented. Discrete mathematics and combinatorics are boom disciplines of the computer age and this project seeks new knowledge concerning basic building blocks of combinatorial mathematics. The outcomes will be of interest to theoretical discrete mathematicians around the world, enhancing Australia's already high research profile in this important area ....Analysis of the structure of latin squares. The benefits to Australia of fundamental research in core disciplines such as mathematics are well documented. Discrete mathematics and combinatorics are boom disciplines of the computer age and this project seeks new knowledge concerning basic building blocks of combinatorial mathematics. The outcomes will be of interest to theoretical discrete mathematicians around the world, enhancing Australia's already high research profile in this important area of pure mathematical research. Importantly, the problems under investigation offer substantial opportunity for excellent postgraduate training, critical for the future of Australian research. Read moreRead less
Cycle decompositions of graphs. The benefits to Australia of fundamental research in core disciplines such as mathematics are well documented. This project aims to solve long-standing and significant open problems in the field of mathematics known as graph theory. Solving such problems will undoubtedly bring Australian research in this field to the fore, and help to enhance Australia's international research profile generally. The project offers substantial postgraduate training in the form of t ....Cycle decompositions of graphs. The benefits to Australia of fundamental research in core disciplines such as mathematics are well documented. This project aims to solve long-standing and significant open problems in the field of mathematics known as graph theory. Solving such problems will undoubtedly bring Australian research in this field to the fore, and help to enhance Australia's international research profile generally. The project offers substantial postgraduate training in the form of three excellent PhD projects in discrete mathematics. The computer age has ensured that this is a booming discipline and an increasing component of undergraduate syllabi around the world. It is thus a crucial area in which to be providing quality research training.Read moreRead less
Australian Laureate Fellowships - Grant ID: FL120100125
Funder
Australian Research Council
Funding Amount
$1,796,966.00
Summary
Advances in the analysis of random structures and their applications. This project will provide new approaches, insights and results for probabilistic combinatorics. This area has contributed in exciting ways elsewhere in mathematics and provides versatile tools of widespread use in algorithmic computer science, with other applications in physics, coding theory for communications, and genetics.
A new approach to compressed sensing. Compressed sensing is an exciting new paradigm promising vastly improved signal sampling and reconstruction in a wide variety of applications including digital cameras, mobile phones and MRI machines. This project will explore a newly discovered approach to compressed sensing which uses mathematical arrays known as hash families.
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.
Virtual transport networks. This project will develop specialised time-dependent networks for use in algorithmic software testing and development, focussing on public transportation networks, but applicable elsewhere. The virtual transport networks developed in this project will significantly reduce the cost of producing software products that perform network searches.
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