Doctoral thesis
OA Policy
English

Geometric and algorithmic aspects of nilpotent groups

Other titleAspects géométriques et algorithmiques des groupes nilpotents
ContributorsBodart, Corentinorcid
Number of pages182
Imprimatur date2024-11-12
Defense date2024-10-31
Abstract

In geometric group theory, nilpotent groups are among the better understood classes of groups. In this thesis, we will show that nilpotent groups behave in surprising ways.

First, we prove that the growth of the number of geodesics in some virtually nilpotent groups is intermediate, these are the the first examples of this type. Next, we study the horofunction boundary of some groups, highlighting important differences between nilpotent groups of class 2 and 3, both regarding the action of a group on its boundary, or the number of Busemann points. From this point on, we take an algorithmic direction, studying the membership problems to submonoids and rational subsets. We show that these two problems are not equivalent, and solve the second problem in the Heisenberg group. In the last two chapters, we study complete growth series and Green series.

Keywords
  • Nilpotent groups
  • Geodesic growth
  • Horofunction boundary
  • Membership problems
  • Complete growth series
  • Green series
  • Formal languages
Research groups
Citation (ISO format)
BODART, Corentin. Geometric and algorithmic aspects of nilpotent groups. Doctoral Thesis, 2024. doi: 10.13097/archive-ouverte/unige:181560
Main files (1)
Secondary files (1)
Imprimatur
accessLevelPublic
Identifiers
396views
288downloads

Technical informations

Creation19/11/2024 16:00:20
First validation20/11/2024 10:33:36
Update19/05/2025 11:49:39
Status update19/05/2025 11:49:39
Last indexation19/05/2025 11:50:27
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack