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
Special Research Initiatives - Grant ID: SR0354466
Funder
Australian Research Council
Funding Amount
$20,000.00
Summary
Mathematics in Contemporary Science. The Mathematics in Contemporary Science Research Network brings contemporary methods of non-linear analysis and differential equations, geometric reasoning and relevant algebraic and topological ideas to enrich six application areas in modern science: Complex Systems, Computer Vision, Optimal Transportation, Nanotechnology, Physics and Shortest Networks. MiCS will develop both the mathematics and the application areas in parallel. It will focus on postgradu ....Mathematics in Contemporary Science. The Mathematics in Contemporary Science Research Network brings contemporary methods of non-linear analysis and differential equations, geometric reasoning and relevant algebraic and topological ideas to enrich six application areas in modern science: Complex Systems, Computer Vision, Optimal Transportation, Nanotechnology, Physics and Shortest Networks. MiCS will develop both the mathematics and the application areas in parallel. It will focus on postgraduate training through workshops, summer schools and web based resources and build long-term international collaborations with EU networks and NSERC, NSF and EPSRC institutes as well as bringing together academic and industry leaders.Read moreRead less
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
Invariants, geometric and discrete structures on manifolds. This project aims to develop practical methods for finding geometric and discrete structures on manifolds in both low and high dimensions and advancing our understanding of the information that physics is providing about these spaces. Recently there have been spectacular advances in understanding 3-D spaces and the interaction between ideas in mathematical physics (quantum invariants, string theory) and such spaces. In this project, the ....Invariants, geometric and discrete structures on manifolds. This project aims to develop practical methods for finding geometric and discrete structures on manifolds in both low and high dimensions and advancing our understanding of the information that physics is providing about these spaces. Recently there have been spectacular advances in understanding 3-D spaces and the interaction between ideas in mathematical physics (quantum invariants, string theory) and such spaces. In this project, the first aim is to construct structures with good geometric properties on 3- and 4-manifolds, using triangulations. The second aim is to study combinatorial decompositions of n-manifolds, using our new technique of multisections and also searching for polyhedral metrics of non-positive curvature. The third aim is to connect quantum invariants and geometric structures, again using triangulations.Read moreRead less
Higher dimensional methods for algebras and dynamical systems. Australian researchers have pioneered recent research in combinatorial C*-algebras. We are now uniquely placed to capitalise on this situation to make significant connections with research in dynamical systems. This project will thus position Australian mathematics at the nexus of two important research areas.
Triangulations in dimensions 3 and 4: discrete and geometric structures. Recently there have been spectacular advances in understanding 3-dimensional spaces and the interaction between ideas in mathematical physics (quantum invariants) and such spaces. This project aims at practical methods for finding geometric structures and advancing our understanding of the information that physics is providing about these spaces.
Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints. Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distribution of goods etc. - and the theoretical analysis of such networks has become a subject of fundamental importance. Networks can be modelled by graphs. This project will provide new theoretical results which will improve our knowledge of network topologi ....Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints. Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distribution of goods etc. - and the theoretical analysis of such networks has become a subject of fundamental importance. Networks can be modelled by graphs. This project will provide new theoretical results which will improve our knowledge of network topologies. The new knowledge will then be utilised in the construction of large graphs with respect to given maximum degree and distance constraints.Read moreRead less