Summary
The project brings together combinatorialists of various fields with the aim that they will enrich each other’s techniques. The tool kits they will bring include topology, probability, statistical physics and algebra. These should apply to matching problems (a central topic in combinatorics), algorithmic problems, coloring problems (which are decompositions into independent sets or matchings) and homomorphisms (a generalization of colorings).
One umbrella under which many of these can be gathered is the intersection of two matroids, a notion generalizing that of matchings in bipartite graphs. Researchers are baffled by a strange phenomenon – that moving from one matroid to the intersection of two matroids sometimes costs little. The algorithmic problems are indeed harder, but the difference between min and max in the min-max theorems suffer only a conjectured penalty of 1.
This connects with a second direction of the research, fine grained complexity, which deals with polynomially solvable problems, and aims to prove, under widely believed assumptions, lower bounds on the exponents in the polynomial bounds. A major question in the field is proving similar tight bounds for approximation problems.
A direction connecting matchings, colorings and homomorphisms was initiated recently in statistical physics. It investigates typical algorithmic complexity, of computational problems taken under some probability distribution. While the worst case complexity questions are difficult in general and not clearly practically relevant, when we restrict to a given probability distribution of instances and when we are interested in high probability results, progress has been made, that has contributed also algorithmic insights beyond the probabilistic setting. We propose to address several outstanding open questions from the field.
Finally we will work on a deep connection, studied by some of the researchers in the project, between Ramsey theory, Model theory and graph homomorphisms.
One umbrella under which many of these can be gathered is the intersection of two matroids, a notion generalizing that of matchings in bipartite graphs. Researchers are baffled by a strange phenomenon – that moving from one matroid to the intersection of two matroids sometimes costs little. The algorithmic problems are indeed harder, but the difference between min and max in the min-max theorems suffer only a conjectured penalty of 1.
This connects with a second direction of the research, fine grained complexity, which deals with polynomially solvable problems, and aims to prove, under widely believed assumptions, lower bounds on the exponents in the polynomial bounds. A major question in the field is proving similar tight bounds for approximation problems.
A direction connecting matchings, colorings and homomorphisms was initiated recently in statistical physics. It investigates typical algorithmic complexity, of computational problems taken under some probability distribution. While the worst case complexity questions are difficult in general and not clearly practically relevant, when we restrict to a given probability distribution of instances and when we are interested in high probability results, progress has been made, that has contributed also algorithmic insights beyond the probabilistic setting. We propose to address several outstanding open questions from the field.
Finally we will work on a deep connection, studied by some of the researchers in the project, between Ramsey theory, Model theory and graph homomorphisms.
Unfold all
/
Fold all
More information & hyperlinks
| Web resources: | https://cordis.europa.eu/project/id/823748 |
| Start date: | 01-01-2019 |
| End date: | 31-07-2024 |
| Total budget - Public funding: | 869 400,00 Euro - 749 800,00 Euro |
Cordis data
Original description
The project brings together combinatorialists of various fields with the aim that they will enrich each other’s techniques. The tool kits they will bring include topology, probability, statistical physics and algebra. These should apply to matching problems (a central topic in combinatorics), algorithmic problems, coloring problems (which are decompositions into independent sets or matchings) and homomorphisms (a generalization of colorings).One umbrella under which many of these can be gathered is the intersection of two matroids, a notion generalizing that of matchings in bipartite graphs. Researchers are baffled by a strange phenomenon – that moving from one matroid to the intersection of two matroids sometimes costs little. The algorithmic problems are indeed harder, but the difference between min and max in the min-max theorems suffer only a conjectured penalty of 1.
This connects with a second direction of the research, fine grained complexity, which deals with polynomially solvable problems, and aims to prove, under widely believed assumptions, lower bounds on the exponents in the polynomial bounds. A major question in the field is proving similar tight bounds for approximation problems.
A direction connecting matchings, colorings and homomorphisms was initiated recently in statistical physics. It investigates typical algorithmic complexity, of computational problems taken under some probability distribution. While the worst case complexity questions are difficult in general and not clearly practically relevant, when we restrict to a given probability distribution of instances and when we are interested in high probability results, progress has been made, that has contributed also algorithmic insights beyond the probabilistic setting. We propose to address several outstanding open questions from the field.
Finally we will work on a deep connection, studied by some of the researchers in the project, between Ramsey theory, Model theory and graph homomorphisms.
Status
SIGNEDCall topic
MSCA-RISE-2018Update Date
28-04-2024
Images
No images available.
Geographical location(s)
Search
Organisations
-
| UNIVERZITA KARLOVA (CUNI) (Coördinator)
-
| CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE (CNRS)
-
| Los Alamos National Security LLC
-
| RUTGERS, THE STATE UNIVERSITY OF NEW JERSEY
-
| Simon Fraser University
-
| TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY.
-
| THE REGENTS OF THE UNIVERSITY OF CALIFORNIA
-
| TRUSTEES OF PRINCETON UNIVERSITY