• Keine Ergebnisse gefunden

”Finitely presented random groups are surface-like” Goulnara Arzhantseva

N/A
N/A
Protected

Academic year: 2022

Aktie "”Finitely presented random groups are surface-like” Goulnara Arzhantseva"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

”Finitely presented random groups are surface-like”

Goulnara Arzhantseva

LetL≥1 be an integer. We show that with overwhelming probability, a random finitely presented group satisfies the following properties.

•Any subgroup of rank at most Land of infinite index is free and quasiconvex.

•No finite-index subgroup of the group is free.

The result is related to (still open) Gromov’s question: whether every one-ended word hyperbolic group contains a surface subgroup. The proof uses a representation of finitely generated subgroups by means of finite labelled graphs.

1

Referenzen

ÄHNLICHE DOKUMENTE

Because of the optimized electric field, an effective voltage distribution on the beam axis has been achieved, which performs the required energy gain per gap (see Fig.. A

Here we show by a combination of angle-resolved photoemission (ARPES), scanning tunneling microscopy (STM), and atomic force microscopy (AFM) that the protection mechanism of

One case of particular interest that satisfies the relative rigidity requirement is that of a one-ended, finitely presented group whose two-ended JSJ decomposition has free groups

Abstract: We study quasi-isometric invariants of Gromov hyperbolic spaces, fo- cussing on the ` p -cohomology and closely related invariants such as the confor- mal dimension and

Abstract: It is clear that Gromov boundary ∂(G ∗ H ) of the free product of hyper- bolic groups G and H is, up to homeomorphism, some combination of the topolog- ical spaces ∂G

The talk is based on joint works with Cornelia Drutu (on the Rapid Decay property of such groups) and with Damian Osajda (on the Haagerup property of those

We discuss various (still open) questions on approximation of infinite discrete groups.. We focus on finite-dimensional approximations such as residual finiteness

Enigma Machine versus Recurrent Neural Networks 2.. The Discrete-Logarithm Problem with