Small Cancellation Stability and Isomorphism Rigidity for Generic Finitely Presented Groups

Ilya Kapovich

Abstract

Let $F_m=F(a_1,\dots,a_m)$ with $m\ge 2$, and fix $q\ge 1$. For every fixed $0<λ<1$, we prove that a $q$-tuple $\mathbf W_n$ of independent uniformly random cyclically reduced words of length $n$ is \emph{$λ$-stable} with probability converging to $1$ exponentially fast. Namely, for every $Φ\in Aut(F_m)$, the tuple $Φ(\mathbf W_n)$, after cyclic reduction and symmetrization, satisfies the $C'(λ)$ small cancellation condition. Combining generic $λ$-stability with Greendlinger normal-closure rigidity and with previous results of Kapovich-Schupp-Shpilrain on generic Nielsen uniqueness and generic Whitehead rigidity we establish, for any fixed $m\ge 2, q\ge 1$, isomorphism rigidity for generic $m$-generator $q$-relator groups. Thus we show that two such generic groups $\langle a_1,\dots, a_m| r_1,\dots, r_q\rangle$ and $\langle a_1,\dots, a_m| s_1,\dots, s_q\rangle$ are isomorphic if and only if, after possibly permuting and inverting the generators $a_1,\dots, a_m$, the relator tuples $(r_1,\dots, r_q)$ and $(s_1,\dots, s_q)$ are the same, up to reordering, cyclic permutations and inverting the relators. Among the applications, we obtain a quadratic-time algorithm that generically solves the isomorphism problem for $m$-generator $q$-relator groups, and show that the number of isomorphism types represented by $m$-generator $q$-relator presentations with cyclically reduced relators of length $n$ is asymptotic to \[ \frac{(2m-1)^{qn}}{2^{m+q}m!\,q!\,n^q}. \] The proof of generic $λ$-stability relies on the use of geodesic currents and on our deterministic sufficient criterion for a $q$-tuple $\mathbb W$ in $F_m$ to be $λ$-stable in terms of the components of $\mathbb W$ being sufficiently projectively close to filling currents.

Disclosure

“gives |Cn | ∼ (2m − 1)n , proving the formula. □ 12. Disclosure of AI use Preparation of this paper substantially relied on chats with ChatGPT, but the author verified all the proofs given, reviewed and edited the content as needed and takes full responsibility for the content of the paper. References [AO96] G. N. Arzhants”

PDF page 41
Classification
Drafting limited passages
Multiplier
5
Verified

Structural counts

Pages 42 pdf
Theorems 9 source
Lemmas 22 source
Propositions 9 source
Corollaries 6 source
Definitions 7 source
Displayed equations 305 source
Bibliography entries 41 source
Appendix pages 0 estimated

Count notes

  • Source counts use the expanded primary TeX file stability-new.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.