Discrete Mathematics: methods, challenges and appl.. (DMMCA)
Discrete Mathematics: methods, challenges and applications
Start date: Dec 1, 2008,
End date: Nov 30, 2013
Discrete Mathematics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. Some of the main reasons for this growth are the broad applications of tools and techniques from extremal and probabilistic combinatorics in the rapid development of theoretical Computer Science, in the spectacular recent results in Additive Number Theory and in the study of basic questions in Information Theory. While in the past many of the basic combinatorial results were obtained mainly by ingenuity and detailed reasoning, the modern theory has grown out of this early stage, and often relies on deep, well developed tools, like the probabilistic method, algebraic, topological and geometric techniques. The work of the principal investigator, partly jointly with several collaborators and students, and partly in individual efforts, has played a significant role in the introduction of powerful algebraic, probabilistic, spectral and geometric techniques that influenced the development of modern combinatorics. In the present project he aims to try and further develop such tools, trying to tackle some basic open problems in Combinatorics, as well as significant questions in Additive Combinatorics, Information Theory, and theoretical Computer Science. Progress on the problems mentioned in this proposal, and the study of related ones, is expected to provide new insights on these problems and to lead to the development of novel fruitful techniques that are likely to be useful in Discrete Mathematics as well as in related areas.
Get Access to the 1st Network for European Cooperation