Shortcut graphs and groups

Jeudi 19 décembre 2019 14:00-15:00 - Nima Hoda - ENS Paris

Résumé : Shortcut graphs are graphs in which long enough cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly broad family of graphs and groups of interest in geometric group theory and metric graph theory including : systolic and quadric groups (in particular finitely presented C(6) and C(4)-T(4) small cancellation groups), cocompactly cubulated groups, hyperbolic groups, Coxeter groups and the Baumslag-Solitar group BS(1,2). Most of these examples satisfy a strong form of the shortcut property. I will discuss some of these examples as well as some general constructions and properties of shortcut graphs and groups.

Lieu : IMO, salle 2L8

Notes de dernières minutes : L’exposé sera précédé d’un café culturel assuré à 13h par Camille Horbez.

Shortcut graphs and groups  Version PDF