The project aims to investigate the pseudorandomness phenomenon in discrete mathematics. In particular, the aim of the fellow is to learn-through-research two topics at the frontier of mathematics and computer science: expander graphs (their explicit constructions, and applications in computational complexity), and explicit construction of Ramsey graphs.
The field combines algebraic, combinatorial, probabilistic methods, and concepts from theoretical computer science.
Field of science
- /natural sciences/mathematics
- /natural sciences/mathematics/pure mathematics/discrete mathematics
Call for proposal
See other projects for this call