Opendata, web and dolomites

CoSP SIGNED

Combinatorial Structures and Processes

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "CoSP" data sheet

The following table provides information about the project.

Coordinator
UNIVERZITA KARLOVA 

Organization address
address: OVOCNY TRH 560/5
city: PRAHA 1
postcode: 116 36
website: www.cuni.cz

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Czech Republic [CZ]
 Total cost 869˙400 €
 EC max contribution 749˙800 € (86%)
 Programme 1. H2020-EU.1.3.3. (Stimulating innovation by means of cross-fertilisation of knowledge)
 Code Call H2020-MSCA-RISE-2018
 Funding Scheme MSCA-RISE
 Starting year 2019
 Duration (year-month-day) from 2019-01-01   to  2022-12-31

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    UNIVERZITA KARLOVA CZ (PRAHA 1) coordinator 529˙000.00
2    CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE CNRS FR (PARIS) participant 110˙400.00
3    TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY IL (HAIFA) participant 110˙400.00
4    Los Alamos National Security LLC US (Los Alamos NM) partner 0.00
5    RUTGERS, THE STATE UNIVERSITY OF NEW JERSEY US (NEW BRUNSWICK) partner 0.00
6    Simon Fraser University CA (BURNABY) partner 0.00
7    TRUSTEES OF PRINCETON UNIVERSITY US (PRINCETON, NJ) partner 0.00

Map

 Project objective

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.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "COSP" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "COSP" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.3.3.)

CONMECH (2019)

Nonsmooth Contact Dynamics

Read More  

ENDORSE (2018)

Safe, Efficient and Integrated Indoor Robotic Fleet for Logistic Applications in Healthcare and Commercial Spaces

Read More  

SENATOR (2020)

Staff Exchange for Novel applications in 19f magnetic resonance imaging

Read More