The Australian Research Data Commons (ARDC) invites you to participate in a short survey about your
interaction with the ARDC and use of our national research infrastructure and services. The survey will take
approximately 5 minutes and is anonymous. It’s open to anyone who uses our digital research infrastructure
services including Reasearch Link Australia.
We will use the information you provide to improve the national research infrastructure and services we
deliver and to report on user satisfaction to the Australian Government’s National Collaborative Research
Infrastructure Strategy (NCRIS) program.
Please take a few minutes to provide your input. The survey closes COB Friday 29 May 2026.
Complete the 5 min survey now by clicking on the link below.
New Applications of Additive Combinatorics in Number Theory and Graph Theory. The project aims to advance significantly the interplay between additive combinatorics, number theory and graph theory. The project will use and advance methods and results of additive combinatorics and give new applications to such fundamental problems on Cayley graphs as connectivity, random walks, colouring and dominating sets. The significance of the project is ensured by its goal of advancing existing results and ....New Applications of Additive Combinatorics in Number Theory and Graph Theory. The project aims to advance significantly the interplay between additive combinatorics, number theory and graph theory. The project will use and advance methods and results of additive combinatorics and give new applications to such fundamental problems on Cayley graphs as connectivity, random walks, colouring and dominating sets. The significance of the project is ensured by its goal of advancing existing results and methods of additive combinatorics and also in finding their new applications that have long-lasting impact on paramount problems for Cayley graphs that underlie the architecture of crucial communication networks. Achieving progress on these problems and developing relevant methods of additive combinatorics will be the main outcomes. Read moreRead less
Symmetric functions and Hodge polynomials. This project aims to explain a connection between two seemingly disparate mathematical notions: mixed Hodge polynomials of certain varieties, naturally arising in algebraic geometry, and Macdonald polynomials from the theory of symmetric functions. This project will resolve this connection using symmetric function theory, algebraic combinatorics and representation theory. This project could enhance Australia's international reputation in algebraic combi ....Symmetric functions and Hodge polynomials. This project aims to explain a connection between two seemingly disparate mathematical notions: mixed Hodge polynomials of certain varieties, naturally arising in algebraic geometry, and Macdonald polynomials from the theory of symmetric functions. This project will resolve this connection using symmetric function theory, algebraic combinatorics and representation theory. This project could enhance Australia's international reputation in algebraic combinatorics, combinatorial representation theory and algebraic geometry.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE130100762
Funder
Australian Research Council
Funding Amount
$309,609.00
Summary
The interplay between structures and algorithms in combinatorial optimisation. Networks are ubiquitous in science, technology, and virtually all aspects of life. The project aims to make progress on central questions in the mathematical theory of networks. These include designing efficient algorithms for approximating the Hadwiger number, which is a key measure of the complexity of a network.
Multivariate polynomials: combinatorics and applications. Many combinatorial and computational problems in pure and applied mathematics as well as mathematical physics can be solved using polynomials in many variables. This proposal will expand our understanding of the poorly understood class of non-symmetric polynomials by studying their novel combinatorial structure. The outcomes will address the current difficulty of implementing non-symmetric polynomials in symbolic algebra packages by devel ....Multivariate polynomials: combinatorics and applications. Many combinatorial and computational problems in pure and applied mathematics as well as mathematical physics can be solved using polynomials in many variables. This proposal will expand our understanding of the poorly understood class of non-symmetric polynomials by studying their novel combinatorial structure. The outcomes will address the current difficulty of implementing non-symmetric polynomials in symbolic algebra packages by developing completely new computational algorithms. Secondly, this new understanding will be used to solve several challenging mathematical enumeration problems.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
Discovery Early Career Researcher Award - Grant ID: DE170101128
Funder
Australian Research Council
Funding Amount
$360,000.00
Summary
Homological methods in combinatorics, algebra and geometry. This project aims to solve problems in graph theory, lattice theory and geometry using algebraic techniques. The techniques and language provided by this algebraic approach will be used to gain fresh insight into classical problems, prove stronger theorems and uncover connections between different areas. This project intends to integrate Australia’s strength in homological algebra and category theory with applications in various differe ....Homological methods in combinatorics, algebra and geometry. This project aims to solve problems in graph theory, lattice theory and geometry using algebraic techniques. The techniques and language provided by this algebraic approach will be used to gain fresh insight into classical problems, prove stronger theorems and uncover connections between different areas. This project intends to integrate Australia’s strength in homological algebra and category theory with applications in various different fields of mathematics. This is expected to provide tools for further investigation of applications in other fields, including computer science and combinatorial optimisation.Read moreRead less
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.
Discovery Early Career Researcher Award - Grant ID: DE160100250
Funder
Australian Research Council
Funding Amount
$299,436.00
Summary
Advanced methods in combinatorial geometry. This project aims to harness new techniques to solve some challenging open problems related to visibility among sets of points. Combinatorial geometry is the mathematical study of the structure of arrangements of points, lines and other geometric objects in space. Many modern technologies require computation with such geometric data, from computer graphics to robotics and computer vision. Advances in the computational techniques that these technologies ....Advanced methods in combinatorial geometry. This project aims to harness new techniques to solve some challenging open problems related to visibility among sets of points. Combinatorial geometry is the mathematical study of the structure of arrangements of points, lines and other geometric objects in space. Many modern technologies require computation with such geometric data, from computer graphics to robotics and computer vision. Advances in the computational techniques that these technologies use are underpinned by mathematical theory. The last five years has seen major breakthroughs in combinatorial geometry, along with the development of ground-breaking new techniques. Solutions to current problems using these techniques are likely to lead to further theoretical advances and insights.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE210101323
Funder
Australian Research Council
Funding Amount
$345,448.00
Summary
Random tensors and random matrices: interactions and applications. This project aims at improving knowledge on probabilistic objects having applications in, for instance, mathematical-physics, statistical physics, quantum gravity and data science. In doing so, we expect to produce new mathematical results by building upon both classical approaches and innovative ones. In particular, on one hand, the extension of classical graphical methods will be developed and, on another hand, generalized prob ....Random tensors and random matrices: interactions and applications. This project aims at improving knowledge on probabilistic objects having applications in, for instance, mathematical-physics, statistical physics, quantum gravity and data science. In doing so, we expect to produce new mathematical results by building upon both classical approaches and innovative ones. In particular, on one hand, the extension of classical graphical methods will be developed and, on another hand, generalized probability theories will be used to provide new insights. The expected outcomes include a better understanding of the generic properties of quantum states. This should significantly benefit to mathematicians and physicists whose models use those objects and may impact the broader community of engineers and technicians.Read moreRead less
New directions in Hecke algebras. To goal of this project is to make fundamental advances in representation theory, a powerful branch of mathematics focused on taking abstract mathematical structures and ``representing'' them in a concrete and useful way. In particular we aim to prove a series of long standing and influential conjectures by George Lusztig concerning the representation theory of Hecke algebras, objects which are ubiquitous in modern algebra. Our work will lead to new discoveries, ....New directions in Hecke algebras. To goal of this project is to make fundamental advances in representation theory, a powerful branch of mathematics focused on taking abstract mathematical structures and ``representing'' them in a concrete and useful way. In particular we aim to prove a series of long standing and influential conjectures by George Lusztig concerning the representation theory of Hecke algebras, objects which are ubiquitous in modern algebra. Our work will lead to new discoveries, a fundamentally deeper understanding of Kazhdan-Lusztig theory, and will drive future research. Benefits include enhanced international collaboration and increasing capacity in pure mathematics, especially in the cutting-edge area of representation theory.Read moreRead less