|
|
 |
|
Mardi 8 Décembre
| Heure: |
14:00 - 17:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Colored triangulations of arbitrary dimensions are stuffed Walsh maps |
| Description: |
Luca Lionni Regular D-edge-colored graphs encode D-dimensional colored triangulations ofpseudo-manifolds. We study such families of edge-colored graphs built from afinite but arbitrary set of building blocks, which extend the notion ofp-angulations to arbitrary dimensions. I will introduce a bijection between anysuch family and some colored combinatorial maps which we call stuffed Walshmaps. Those maps generalize Walsh's representation of hypermaps as bipartitemaps, by replacing the vertices which correspond to hyperedges withnon-properly-edge-colored maps.We are interested in the number of bi-chromatic cycles of the initialedge-colored graphs because because they encode the curvature of thecorresponding triangulated pseudo-manifold. I will therefore present new toolsthat use the bijection in order to study the graphs which maximize the numberof bi-chromatic cycles at fixed number of vertices and provide examples wherethe corresponding stuffed Walsh maps can be completely characterized. |
| Heure: |
15:00 - 18:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Combinatoire analytique des graphes et hypergraphes |
| Description: |
Elie de Panafieu |
|
|
