Systolic geometry and simplicial complexity for groups

Ivan Babenko, Florent Balacheff, Guillaume Bulteau

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)
1 Downloads (Pure)


Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called simplicial complexity that allows to obtain a quite satisfactory answer to his question. Using this new complexity, we also derive new results on systolic area for groups that specify its topological behaviour.

Original languageEnglish
Pages (from-to)247-277
Number of pages31
JournalJournal fur die Reine und Angewandte Mathematik
Issue number757
Publication statusPublished - 2019


Dive into the research topics of 'Systolic geometry and simplicial complexity for groups'. Together they form a unique fingerprint.

Cite this