Systolic geometry and simplicial complexity for groups (Q2009899)

An invariant of groups called c-complexity was introduced by \textit{S. V. Matveev} and \textit{E. L. Pervova} [Dokl. Math. 63, No. 3, 151--152 (2001; Zbl 1048.57013); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 378, No. 2, 151--152 (2001)] to study fundamental groups of 3-manifolds; see also [\textit{E. Pervova} and \textit{C. Petronio}, Math. Nachr. 281, No. 8, 1182--1195 (2008; Zbl 1193.20037)]. The authors of the present article introduce a new invariant of groups called simplicial complexity, defined combinatorially. Simplicial complexity and c-complexity agree up to some universal constants. However, simplicial complexity is more convenient in studying systolic problems. Simplicial complexity is related to an invariant called systolic area, introduced by \textit{M. Gromov} in [Sémin. Congr. 1, 291--362 (1996; Zbl 0877.53002)]. But while systolic area of surfaces is strictly sublinear in the genus by [\textit{P. Buser} and \textit{P. Sarnak}, Invent. Math. 117, No. 1, 27--56 (1994; Zbl 0814.14033)], simplicial complexity is linear in the genus. The authors establish inequalities relating systolic area and simplicial complexity for groups of zero free index (meaning that the Grushko decomposition splits off no Z factors). Using such inequalities, the authors obtain a new upper bound for the number of nonisomorphic groups with bounded systolic area, improving bounds obtained in [\textit{Y. B. Rudyak} and \textit{S. Sabourau}, Ann. Inst. Fourier 58, No. 3, 777--800 (2008; Zbl 1142.53035)]. They also obtain an exponential lower bound for the number of abelian groups. They also obtain upper and lower estimates for the systolic volume of lens spaces.