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
The Zarankiewicz problem through linear hypergraphs and designs. The Zarankiewicz problem is a famous open problem with deep connections to many different areas of mathematics. Despite continued attention from some of the world's most celebrated mathematicians, it has remained unsolved for over 70 years. This project aims to make major progress on the Zarankiewicz problem by utilising a novel approach based in the field of combinatorial design theory. This approach will leverage recent major bre ....The Zarankiewicz problem through linear hypergraphs and designs. The Zarankiewicz problem is a famous open problem with deep connections to many different areas of mathematics. Despite continued attention from some of the world's most celebrated mathematicians, it has remained unsolved for over 70 years. This project aims to make major progress on the Zarankiewicz problem by utilising a novel approach based in the field of combinatorial design theory. This approach will leverage recent major breakthroughs in design theory concerning edge decompositions of dense hypergraphs.Read moreRead less
New directions in extremal and structural graph theory. This project aims to attack unsolved problems at the intersection of extremal and structural graph theory, two of the most significant branches of graph theory. Graph theory, which is the mathematics of networks, models many real-world problems and is a key component of modern mathematics. This project expects to develop a theory that synthesises the latest developments in the two fields. It is expected that the tools developed will be wide ....New directions in extremal and structural graph theory. This project aims to attack unsolved problems at the intersection of extremal and structural graph theory, two of the most significant branches of graph theory. Graph theory, which is the mathematics of networks, models many real-world problems and is a key component of modern mathematics. This project expects to develop a theory that synthesises the latest developments in the two fields. It is expected that the tools developed will be widely applicable, for example, in algorithms for network optimisation. The project will build collaborations between Australian researchers and world-leading international mathematicians, and will provide advanced training for talented young researchers.Read moreRead less
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
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
A unified approach to the design of minimum length networks. This project aims to develop a new approach to designing minimum length interconnection networks by analysing their geometric structure. These networks form the basis of communication, power and transport systems. Optimising the design of such networks is a mathematically challenging problem of high computational complexity. This project will use an innovative method based on a relationship between the geometry of networks and a type o ....A unified approach to the design of minimum length networks. This project aims to develop a new approach to designing minimum length interconnection networks by analysing their geometric structure. These networks form the basis of communication, power and transport systems. Optimising the design of such networks is a mathematically challenging problem of high computational complexity. This project will use an innovative method based on a relationship between the geometry of networks and a type of partitioning of the plane called an oriented Voronoi diagram. The outcome will be efficient new algorithms for designing physical networks, which, in practice, will ultimately lead to a reduction in network infrastructure costs for industries in Australia.
Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE200101045
Funder
Australian Research Council
Funding Amount
$330,756.00
Summary
Enhanced methods for approximating the structure of large networks. This project aims to explain fundamental structural features of real-world networks such as the internet and online social networks, by advancing complex-analytical techniques. Current knowledge of properties such as reliability, robustness and optimal allocation of resources rely on assumptions that are invalid in real applications. The project expects to improve understanding of inhomogeneous network models by introducing an i ....Enhanced methods for approximating the structure of large networks. This project aims to explain fundamental structural features of real-world networks such as the internet and online social networks, by advancing complex-analytical techniques. Current knowledge of properties such as reliability, robustness and optimal allocation of resources rely on assumptions that are invalid in real applications. The project expects to improve understanding of inhomogeneous network models by introducing an innovative idea of high-order approximations to complex random settings. Expected outcomes include new tools for approximate counting of discrete objects satisfying given constraints. Applications of these tools could have far-reaching benefits to researchers who study quantitative characteristics of discrete systems.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
Discovery Early Career Researcher Award - Grant ID: DE150101415
Funder
Australian Research Council
Funding Amount
$360,000.00
Summary
Higher Representation Theory. Representation theory is a field of mathematics with applications across the breadth of mathematical study in fields as diverse as number theory and physics. The study of higher (or categorical) representation theory is a modern set of tools that provides new insights into representation theoretic phenomena. This project aims to study categorified quantum groups and, in particular, the categorifications provided by diagrammatic algebras. The project aims to further ....Higher Representation Theory. Representation theory is a field of mathematics with applications across the breadth of mathematical study in fields as diverse as number theory and physics. The study of higher (or categorical) representation theory is a modern set of tools that provides new insights into representation theoretic phenomena. This project aims to study categorified quantum groups and, in particular, the categorifications provided by diagrammatic algebras. The project aims to further develop the theory of Khovanov-Lauda-Rouquier (KLR) algebras, providing important foundational results for future research to build upon.Read moreRead less
Mathematics for breaking limits of speed and density in magnetic memories. The aim of this project is to develop a mathematical theory and numerical models of stochastic partial differential equations for magnetic nano-structures. Such materials will yield next-generation magnetic memories with up to three orders of magnitude faster switching speeds and dramatically increased data storage density. New mathematical theories will help understand their sensitivity to small random fluctuations that ....Mathematics for breaking limits of speed and density in magnetic memories. The aim of this project is to develop a mathematical theory and numerical models of stochastic partial differential equations for magnetic nano-structures. Such materials will yield next-generation magnetic memories with up to three orders of magnitude faster switching speeds and dramatically increased data storage density. New mathematical theories will help understand their sensitivity to small random fluctuations that can destroy stored information. This project aims to revolutionise mathematical modelling of magnetic memories and put Australia at the forefront of international research. Technological advances to create much smaller and faster memory devices are expected to enable groundbreaking ways of managing and mining big data.Read moreRead less