Systolic geometry and simplicial complexity for groups
2019 ◽
Vol 2019
(757)
◽
pp. 247-277
AbstractTwenty 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.
Keyword(s):
2004 ◽
Vol 10
(4)
◽
pp. 583-614
◽
2012 ◽
Vol 23
(11)
◽
pp. 1250116
◽
1761 ◽
Vol 52
◽
pp. 143-145
1974 ◽
Vol 17
(3)
◽
pp. 305-318
◽
Keyword(s):
2013 ◽
Vol 12
(3)
◽
pp. 651-676
◽