Systolic geometry and simplicial complexity for groups

From MaRDI portal
Publication:2009899




Abstract: 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 {it 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.



Cites work









This page was built for publication: Systolic geometry and simplicial complexity for groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009899)