mtmt
Magyar Tudományos Művek Tára
XML
JSON
Átlépés a keresőbe
In English
Idézők
/
Idézések
Rank, combinatorial cost, and homology torsion growth in higher rank lattices
Abert, M [Abért, Miklós (Csoportelmélet), szerző] Algebra (HRN RAMKI); Csoportok és gráfok - Lendület (HRN RAMKI)
;
Gelander, T
;
Nikolov, N
Angol nyelvű Szakcikk (Folyóiratcikk) Tudományos
Megjelent:
DUKE MATHEMATICAL JOURNAL 0012-7094 1547-7398
166
(15)
pp. 2925-2964
2017
SJR Scopus - Mathematics (miscellaneous): D1
Azonosítók
MTMT: 3333008
DOI:
10.1215/00127094-2017-0020
REAL:
74284
WoS:
000413403400003
Scopus:
85031006341
Mathematical Reviews:
MR3712168
arXiv:
1509.01711
Google scholar:
15453858907109079350
Google scholar hash:
Njk-R8wid9YJ
Szakterületek:
Algebra
Elméleti és alkalmazott matematika
Matematika
Természettudományok
Tudomány
We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove the vanishing of the above invariants for Farber sequences of subgroups of right-angled groups. A group is right angled if it can be generated by a sequence of elements of infinite order such that any two consecutive elements commute. Most nonuniform lattices in higher rank simple Lie groups are right angled. We provide the first examples of uniform (cocompact) right-angled arithmetic groups in SL(n,ℝ), n ≥ 3, and SO(p, q) for some values of p, q. This is a class of lattices for which the congruence subgroup property is not known in general. By using rigidity theory and the notion of invariant random subgroups it follows that both the rank gradient and the homology torsion growth vanish for an arbitrary sequence of subgroups in any right-angled lattice in a higher rank simple Lie group. © 2017.
Idézők (25)
Idézett közlemények (7)
Hivatkozás stílusok:
IEEE
ACM
APA
Chicago
Harvard
CSL
Másolás
Nyomtatás
2026-04-13 14:33
×
Lista exportálása irodalomjegyzékként
Hivatkozás stílusok:
IEEE
ACM
APA
Chicago
Harvard
Nyomtatás
Másolás