Soutenances d'habilitation
Lundi 27 novembre 2017, 14 heures, Salle des Thèses, Halle aux Farines
Stefano Zacchiroli (IRIF) Large-scale Modeling, Analysis, and Preservation of Free and Open Source Software
Soutenances d'habilitation
Lundi 20 novembre 2017, 10 heures, Salle 227C, Halle aux Farines
Paul-André Melliès (IRIF) Une étude micrologique de la négation
La logique est aussi conçue pour fonder la sémantique des jeux en théorie des types, et pour l'articuler de manière précise et harmonieuse avec la logique linéaire et la théorie des continuations dans les langages de programmation.
Soutenances d'habilitation
Mardi 11 juillet 2017, 14 heures 30, Salle 0010, Bâtiment Sophie Germain
Reza Naserasr (IRIF) Projective Cubes, a coloring point of view
The generalization of this view is the Cayley graph $\mathbb Z_2^k, {e_1,e_2, \cdots, e_k, J}$ which is isomorphic to the projective cube of dimension $k$ also known as the folded cube.
Thus we consider the problem of mapping planar graphs into projective cubes, and show that this question is related to several other notions of coloring such as the edge-chromatic number of planar multi-graphs, circular chromatic number and the fractional chromatic number.
Finally, after providing a test to decide if a graph $B$ of odd-girth $2k+1$ admits a homomorphism from any graph of tree-width at most $t$ and odd-girth at least $2k+1$, we show that every 3-tree of odd-girth at least $2k+1$ admits a homomorphism to the projective cube of dimension $2k$.