Skip to main content

Pseudorandomness and explicit constructions in discrete mathematics

Objective

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

FP7-PEOPLE-2013-IEF
See other projects for this call

Funding Scheme

MC-IEF - Intra-European Fellowships (IEF)

Coordinator

MATEMATICKY USTAV AV CR V.V.I.
Address
Zitna
115 67 Praha 1
Czechia
Activity type
Research Organisations
EU contribution
€ 152 067,60
Administrative Contact
Pavel Pudlák (Prof.)