Descripción del proyecto
Estudio de las relaciones entre estructuras combinatorias y analíticas
El objetivo del proyecto FDC, financiado con fondos europeos, es ampliar las relaciones existentes, así como construir nuevos vínculos, entre diferentes áreas de las matemáticas a través de las estructuras combinatorias y los objetos analíticos. Sus investigadores se proponen adaptar satisfactoriamente métodos combinatorios para encontrar soluciones constructivas a problemas analíticos, cuyas soluciones conocidas se basan en el axioma de elección. Se examinarán relaciones prometedoras entre la teoría descriptiva de conjuntos, los algoritmos distribuidos eficientes y los procesos aleatorios invariantes en grafos transitivos con vértices infinitos. Además, los investigadores emplearán la nueva teoría de límites de estructuras discretas para abordar problemas clave de la combinatoria externa.
Objetivo
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).
Ámbito científico
Programa(s)
Régimen de financiación
ERC-ADG - Advanced GrantInstitución de acogida
CV4 8UW COVENTRY
Reino Unido