[Cite as http://purl.org/au-research/grants/arc/DP140100118]
Researchers Prof Igor Shparlinski; Prof Bernard Mans;
Brief description 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.
Funding Amount 951858
Funding Scheme Discovery Projects