Randomness and pseudorandomness in discrete mathematics
Discrete mathematics has seen enormous advances in the last few years, with solutions being found to a number of famous and long-standing questions, such as the Erdos distinct distance problem and the existence conjecture for comb...
ver más
¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video
Proyectos interesantes
PAECIDM
Pseudorandomness and explicit constructions in discrete math...
152K€
Cerrado
COUNTGRAPH
Enumeration of discrete structures algebraic analytic pro...
100K€
Cerrado
RANDSTRUCT
Randomness and structure in combinatorics
1M€
Cerrado
ExtComb
Extremal Combinatorics existence counting and typical stru...
2M€
Cerrado
LocalGlobal
Local vs Global Properties of Large Discrete Structures
2M€
Cerrado
GRANT
Groups Representations and Analysis in Number Theory
1M€
Cerrado
Información proyecto RanDM
Duración del proyecto: 62 meses
Fecha Inicio: 2016-04-05
Fecha Fin: 2021-06-30
Fecha límite de participación
Sin fecha límite de participación.
Descripción del proyecto
Discrete mathematics has seen enormous advances in the last few years, with solutions being found to a number of famous and long-standing questions, such as the Erdos distinct distance problem and the existence conjecture for combinatorial designs. Much of this progress owes to an increased understanding of random and pseudorandom objects. An entire framework, known as the probabilistic method, has grown around the application of randomness to combinatorial problems, while pseudorandomness is playing an increasingly important role.
In this proposal, we will consider a range of problems, some stemming from the direct study of random and pseudorandom objects and others arising in areas where randomness and pseudorandomness have proved to be of particular importance. We will be particularly concerned with extensions of the regularity method to sparse graphs and improving bounds for a number of classical problems in graph Ramsey theory. These problems are of a fundamental nature and any progress is likely to lead to new techniques with broader scope for application.