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
Discovery Early Career Researcher Award - Grant ID: DE190100888
Funder
Australian Research Council
Funding Amount
$333,924.00
Summary
Linear recurrence sequences over function fields and their applications. This project aims to deeply and systematically develop the theory of linear recurrence sequences (LRS) defined over function fields. Linear recurrence sequences (LRS) appear almost everywhere in mathematics and computer science. The project is expected to expand our knowledge on LRS and will span a wide range of new research directions. Through investigating and revealing the theoretical and practical aspects of LRS over fu ....Linear recurrence sequences over function fields and their applications. This project aims to deeply and systematically develop the theory of linear recurrence sequences (LRS) defined over function fields. Linear recurrence sequences (LRS) appear almost everywhere in mathematics and computer science. The project is expected to expand our knowledge on LRS and will span a wide range of new research directions. Through investigating and revealing the theoretical and practical aspects of LRS over function fields, the project will enrich the toolkits for cybersecurity by providing new approaches to cryptography. The outcomes of the project will help position Australia as a leader in this field.Read moreRead less
Extremal problems in hypergraph matchings. Matchings in hypergraphs are a way of understanding complex relationships between objects in any set. This project will develop a mathematical theory that covers both extreme and typical cases. This theory will have applications wherever hypergraphs are used as models, for example in machine learning, game theory, databases, data mining and optimisation.
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
Discovery Early Career Researcher Award - Grant ID: DE170100789
Funder
Australian Research Council
Funding Amount
$324,499.00
Summary
Advances in graph Ramsey theory. This project aims to solve significant questions at the forefront of graph Ramsey theory, which provides the theoretical background for understanding networks that are omnipresent in the modern world. Major progress is anticipated on the recently introduced concept of Ramsey equivalence, including the development of deep new tools that combine probabilistic methods, extremal graph theory and graph decomposition techniques. The project will use these new tools to ....Advances in graph Ramsey theory. This project aims to solve significant questions at the forefront of graph Ramsey theory, which provides the theoretical background for understanding networks that are omnipresent in the modern world. Major progress is anticipated on the recently introduced concept of Ramsey equivalence, including the development of deep new tools that combine probabilistic methods, extremal graph theory and graph decomposition techniques. The project will use these new tools to solve old questions on the structure of minimal Ramsey graphs, thus fostering the international competitiveness of Australian research and enhancing Australia's reputation as a knowledge nation.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
Totally disconnected groups, representations and discrete mathematics. This project involves participation in programs at the Institute of Advanced Studies in Princeton and the nearby Center for Discrete Mathematics and Theoretical Computer Science that are designed to initiate collaborations across distinct mathematical research areas. These programs will set future research directions and could lead to innovations in computer science. Discoveries I have made in one of the research areas mean ....Totally disconnected groups, representations and discrete mathematics. This project involves participation in programs at the Institute of Advanced Studies in Princeton and the nearby Center for Discrete Mathematics and Theoretical Computer Science that are designed to initiate collaborations across distinct mathematical research areas. These programs will set future research directions and could lead to innovations in computer science. Discoveries I have made in one of the research areas mean that I may be able to make substantial contributions to these programs. Early involvement in influential programs such as these means that Australia is well placed to take advantage of developments that result and also enhances the reputation of Australian mathematics.Read moreRead less
Geometric representation of small-rank totally disconnected groups. Mathematics research creates and develops new concepts for understanding the world. Group theory is a branch of mathematics based on our innate sense of of symmetry. It was invented 200 hundred years ago and has grown into a language for analysing and classifying things ranging from wallpaper patterns to crystals, the fundamental particles of physics and Rubik's cube. The chief investigators have significant breakthroughs in the ....Geometric representation of small-rank totally disconnected groups. Mathematics research creates and develops new concepts for understanding the world. Group theory is a branch of mathematics based on our innate sense of of symmetry. It was invented 200 hundred years ago and has grown into a language for analysing and classifying things ranging from wallpaper patterns to crystals, the fundamental particles of physics and Rubik's cube. The chief investigators have significant breakthroughs in the study of symmetry groups of networks, giving Australia an international lead in this research. The project will develop the insights gained to make Australia a centre of expertise on these symmetry groups, which have applications to information and communication technology, among many others.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