FDC
Financiado
Finite and Descriptive Combinatorics
This project will explore emerging deep connections and build new bridges between some areas that study finite combinatorial structures (such as extremal and probabilistic combinatorics, distributed algorithms, etc) and those that...
This project will explore emerging deep connections and build new bridges between some areas that study finite combinatorial structures (such as extremal and probabilistic combinatorics, distributed algorithms, etc) and those that study analytic objects (such as the limit theory of discrete structures, descriptive set theory, measured group theory, random processes on infinite graphs, statistical physics, etc), with applications going both ways.
One part of this project is to apply combinatorial methods in search of constructive answers to analytic problems whose currently known solutions rely on the Axiom of Choice. One such direction is to investigate a possible transference principle that allows to turn some existence results for finite graphs obtained via the very powerful occupancy method into measurable solutions of the corresponding problems of descriptive combinatorics. Similarly, the project will explore promising connections between descriptive set theory, efficient distributed algorithms, invariant random processes on infinite vertex-transitive graphs, etc. Some problems that the project will investigate from this point of view are the Spectral Gap Conjecture, Mycielski's divisibility problem, and the existence of measurable graph factors and colourings.
Also, various important unsolved problems of extremal combinatorics will be approached via the limits of discrete structures (which are analytic objects that encode large-scale properties). In addition to using some established techniques (such as flag algebras and the stability method), the project will look for novel ways of applying the analytic aspects of limit objects that have a great potential in this respect. New software for general-purpose flag algebra calculations will be written and made freely available.
The project will also study some general fundamental questions about graph limits (such as approximability by finite graphs, identification using partial subgraph counts, etc).
ver más
Duración del proyecto: 67 meses
Fecha Inicio: 2021-05-27
Fecha Fin: 2026-12-31
Fecha Fin: 2026-12-31
Línea de financiación: concedida
El organismo H2020 notifico la concesión del proyecto el día 2021-05-27
Línea de financiación objetivo
El proyecto se financió a través de la siguiente ayuda:
ERC-2020-ADG:
ERC ADVANCED GRANT
Cerrada
hace 4 años
Presupuesto
El presupuesto total del proyecto asciende a
2M€
Líder del proyecto
UNIVERSITY OF WARWICK
No se ha especificado una descripción o un objeto social para esta compañía.
Perfil tecnológico
TRL
4-5
Perfil tecnológico
TRL
4-5
472.33K€ |
Participante