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.
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
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.
Group algorithms: Complexity, Theory and Practice. The symmetry of a mathematical or physical system is often best described by an abstract structure called a group, and groups are commonly represented as groups of permutations or matrices. In this project we shall design and analyse a general algorithmic framework for computing with finite groups. In the context of permutation groups and matrix groups we will produce prototype implementations. The proposed framework has the potential to revolut ....Group algorithms: Complexity, Theory and Practice. The symmetry of a mathematical or physical system is often best described by an abstract structure called a group, and groups are commonly represented as groups of permutations or matrices. In this project we shall design and analyse a general algorithmic framework for computing with finite groups. In the context of permutation groups and matrix groups we will produce prototype implementations. The proposed framework has the potential to revolutionise algorithmic group theory as it draws together theoretical and computational models of groups.Read moreRead less
Finite linearly representable geometries and symmetry. Finite geometry has profound mathematical connections to the theory of symmetry. Advances in finite geometry and in symmetry have historically led to advances in diverse areas such as algebra, computing, and theoretical physics. The project aims to characterise basic geometric objects called "projective planes'' and "generalised polygons'' using their symmetry properties. To achieve these aims, conceptual links between certain elements in cl ....Finite linearly representable geometries and symmetry. Finite geometry has profound mathematical connections to the theory of symmetry. Advances in finite geometry and in symmetry have historically led to advances in diverse areas such as algebra, computing, and theoretical physics. The project aims to characterise basic geometric objects called "projective planes'' and "generalised polygons'' using their symmetry properties. To achieve these aims, conceptual links between certain elements in classical symmetry groups and geometric planes and polygons must be developed. The density of these certain elements has important applications to probabilistic geometric algorithms.Read moreRead less
Computing with large groups: probability distributions and fast randomised algorithms. Fast algorithms produced by the project will impact on the practical management of symmetry in large scale searches, which have important industrial applications. Hence the project addresses the Priority Goals Breakthrough Science and Smart Information Use. The project will enhance Australia's leading position in Computational Algebra. Implementations of our algorithms will be incorporated in the Computer Alge ....Computing with large groups: probability distributions and fast randomised algorithms. Fast algorithms produced by the project will impact on the practical management of symmetry in large scale searches, which have important industrial applications. Hence the project addresses the Priority Goals Breakthrough Science and Smart Information Use. The project will enhance Australia's leading position in Computational Algebra. Implementations of our algorithms will be incorporated in the Computer Algebra system Magma, based at the University of Sydney, distributed world-wide, and used intensively in research and teaching. The project will attract international and Australian graduate students and postdoctoral researchers, and strengthen research activities in Australia by enhancing already strong international collaborations. Read moreRead less
Forecasting and management using imperfect models, with a focus on weather and climate. Research into complex systems is predicted to be the focus of twenty-first century science, since most of the problems of simple systems are solved. Examples include the weather and climate, economies, argriculture, ecologies, the mind and brain, genetics, biochemistry. Confidence in the reliability and usefulness of models will have significant bearing on how these models are used by decision making and how ....Forecasting and management using imperfect models, with a focus on weather and climate. Research into complex systems is predicted to be the focus of twenty-first century science, since most of the problems of simple systems are solved. Examples include the weather and climate, economies, argriculture, ecologies, the mind and brain, genetics, biochemistry. Confidence in the reliability and usefulness of models will have significant bearing on how these models are used by decision making and how the community perceives the value of this science. Specific immediate benefits of the project include better policy and management responses to climate change and servere weather events.Read moreRead less
Groups: statistics, structure, and algorithms. Science today relies on digital technologies using quantised and digital information. Because of the discrete nature of digital information, much of the mathematics underpinning these advances comes from the core disciplines of algebra and combinatorics within which this proposal falls. All aspects of the proposal focus on strengthening theoretical understanding of algebraic and combinatorial structures, and increasing computational power for workin ....Groups: statistics, structure, and algorithms. Science today relies on digital technologies using quantised and digital information. Because of the discrete nature of digital information, much of the mathematics underpinning these advances comes from the core disciplines of algebra and combinatorics within which this proposal falls. All aspects of the proposal focus on strengthening theoretical understanding of algebraic and combinatorial structures, and increasing computational power for working with them. The fundamental research outcomes, in terms of theorems, algorithms, and the training of young research mathematicians, will thus both enhance the high international standing of Australian mathematics, and strengthen Australia's capabilities in these important areas.Read moreRead less
Permutation groups: factorisations, structure and applications. Group theory is the mathematical study of symmetry. This project aims to improve our understanding of the structure of groups by studying their factorisations and the structure of certain subgroups and elements. The obtained knowledge will be applied to study embeddings of graphs on surfaces and regular subgroups of important families of groups. The main impact would be in areas of pure mathematics such as group theory and graph the ....Permutation groups: factorisations, structure and applications. Group theory is the mathematical study of symmetry. This project aims to improve our understanding of the structure of groups by studying their factorisations and the structure of certain subgroups and elements. The obtained knowledge will be applied to study embeddings of graphs on surfaces and regular subgroups of important families of groups. The main impact would be in areas of pure mathematics such as group theory and graph theory by strengthening our knowledge of the finite simple groups.Read moreRead less
Symmetry and computation. The overall objective of the project is to explore connections between symmetry and computation, especially the theory and algorithms that facilitate the use of groups in computational science. The main outcome will be theoretically fast algorithms and implementations to drive applications in the sciences and for secure communication.
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.