THE KAROUBI-WEIBEL COMPLEXITY FOR GROUPS - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

THE KAROUBI-WEIBEL COMPLEXITY FOR GROUPS

Résumé

Let G be a finitely presented group. A new complexity called Karoubi-Weibel complexity or covering type, is defined for G. The construction is inspired by recent work of Karoubi and Weibel [16], initially applied to topological spaces. We introduce a similar notion in combinatorial form in order to apply it to finitely presentable groups. Some properties of this complexity as well as a few examples of calculation/estimation for certain classes of finitely presentable groups are considered. Finally we give a few applications of complexity to some geometric problems, namely to the systolic area and the volume entropy of groups.
Fichier principal
Vignette du fichier
The Karoubi-Weibel Complexity for Groups.pdf (529.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03407905 , version 1 (28-10-2021)

Identifiants

  • HAL Id : hal-03407905 , version 1

Citer

Ivan Babenko, Thiziri Moulla. THE KAROUBI-WEIBEL COMPLEXITY FOR GROUPS. 2021. ⟨hal-03407905⟩
74 Consultations
45 Téléchargements

Partager

Gmail Facebook X LinkedIn More