Searcharxiv⌕ Search

arXiv subjects

Ilya Kapovich

Publications and source records attributed to Ilya Kapovich.

At least 73 records · Page 4Linked to original sources

Densities in free groups and $\mathbb{Z}^k$, Visible Points and Test Elements

In this article we relate two different densities. Let $F_k$ be the free group of finite rank $k \ge 2$ and let $α$ be the abelianization map from $F_k$ onto $ \mathbb{Z}^k$. We prove that if $S \subseteq \mathbb{Z}^k$ is invariant under the natural action of $SL(k, \mathbb{Z})$ then the asymptotic density of $S$ in $\mathbb Z^k$ and the annular density of its full preimage $α^{-1}(S)$ in $F_k$ are equal. This implies, in particular, that for every integer $t\ge 1$, the annular density of the set of elements in $F_k$ that map to $t$-th powers of primitive elements in $\mathbb{Z}^k$ is equal to to $\frac{1}{t^kζ(k)}$, where $ζ$ is the Riemann zeta-function. An element $g$ of a group $G$ is called a \emph{test element} if every endomorphism of $G$ which fixes $g$ is an automorphism of $G$. As an application of the result above we prove that the annular density of the set of all test elements in the free group $F(a,b)$ of rank two is $1-\frac{6}{π^2}$. Equivalently, this shows that the union of all proper retracts in $F(a,b)$ has annular density $\frac{6}{π^2}$. Thus being a test element in $F(a,b)$ is an ``intermediate property'' in the sense that the probability of being a test element is strictly between 0 and 1.

math.GR↗

Currents on free groups

We study the properties of geodesic currents on free groups, particularly the "intersection form" that is similar to Bonahon's notion of the intersection number between geodesic currents on hyperbolic surfaces.

math.GR↗

The Subadditive Ergodic Theorem and generic stretching factors for free group automorphisms

Given a free group $F_k$ of rank $k\ge 2$ with a fixed set of free generators we associate to any homomorphism $ϕ$ from $F_k$ to a group $G$ with a left-invariant semi-norm a generic stretching factor, $λ(ϕ)$, which is a non-commutative generalization of the translation number. We concentrate on the situation when $ϕ:F_k\to Aut(X)$ corresponds to a free action of $F_k$ on a simplicial tree $X$, in particular, when $ϕ$ corresponds to the action of $F_k$ on its Cayley graph via an automorphism of $F_k$. In this case we are able to obtain some detailed ``arithmetic'' information about the possible values of $λ=λ(ϕ)$. We show that $λ\ge 1$ and is a rational number with $2kλ\in \mathbb Z[ \frac{1}{2k-1} ]$ for every $ϕ\in Aut(F_k)$. We also prove that the set of all $λ(ϕ)$, where $ϕ$ varies over $Aut(F_k)$, has a gap between 1 and $1+\frac{2k-3}{2k^2-k}$, and the value 1 is attained only for ``trivial'' reasons. Furthermore, there is an algorithm which, when given $ϕ$, calculates $λ(ϕ)$.

math.GR↗

Kleinian groups and the rank problem

We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given cardinality.

math.GT↗

Delzant's T-invariant, Kolmogorov complexity and one-relator groups

We prove that ``almost generically'' for a one-relator group Delzant's $T$-invariant (which measures the smallest size of a finite presentation for a group) is comparable in magnitude with the length of the defining relator. The proof relies on our previous results regarding isomorphism rigidity of generic one-relator groups and on the methods of the theory of Kolmogorov-Chaitin complexity. We also give a precise asymptotic estimate (when $k$ is fixed and $n$ goes to infinity) for the number $I_{k,n}$ of isomorphism classes of $k$-generator one-relator groups with a cyclically reduced defining relator of length $n$: \[ I_{k,n}\sim \frac{(2k-1)^n}{nk!2^{k+1}}. \] Here $f(n)\sim g(n)$ means that $\lim_{n\to\infty} f(n)/g(n)=1$.

math.GR↗

Translation equivalence in free groups

Motivated by the work of Leininger on hyperbolic equivalence of homotopy classes of closed curves on surfaces, we investigate a similar phenomenon for free groups. Namely, we study the situation when two elements $g,h$ in a free group $F$ have the property that for every free isometric action of $F$ on an $\mathbb{R}$-tree $X$ the translation lengths of $g$ and $h$ on $X$ are equal. We give a combinatorial characterization of this phenomenon, called translation equivalence, in terms of Whitehead graphs and exhibit two difference sources of it. The first source of translation equivalence comes from representation theory and $SL_2$ trace identities. The second source comes from geometric properties of groups acting on real trees and a certain power redistribution trick. We also analyze to what extent these are applicable to the tree actions of surface groups that occur in the Thurston compactification of the Teichmuller space.

math.GR↗

Acylindrical accessibility for groups acting on $\mathbf R$-trees

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an $\mathbf R$-tree $X$ then for any $ε>0$ there is a finite subtree $Y_ε\subseteq X$ of measure at most $2M(k-1)+ε$ such that $GY_ε=X$. This generalizes theorems of Z.Sela and T.Delzant about actions on simplicial trees.

math.GR↗

Generic properties of Whitehead's Algorithm and isomorphism rigidity of random one-relator groups

We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of the algorithm terminates in linear time on an exponentially generic set of input pairs. We then apply these results to one-relator groups. We obtain a Mostow-type isomorphism rigidity result for random one-relator groups: If two such groups are isomorphic then their Cayley graphs on the \emph{given generating sets} are isometric. Although no nontrivial examples were previously known, we prove that one-relator groups are generically \emph{complete} groups, that is, they have trivial center and trivial outer automorphism group. We also prove that the stabilizers of generic elements of $F_k$ in $Aut(F_k)$ are cyclic groups generated by inner automorphisms and that $Aut(F_k)$-orbits are uniformly small in the sense of their growth entropy. We further prove that the number $I_k(n)$ of \emph{isomorphism types} of $k$-generator one-relator groups with defining relators of length $n$ satisfies \[ \frac{c_1}{n} (2k-1)^n \le I_k(n)\le \frac{c_2}{n} (2k-1)^n, \] where $c_1=c_1(k)>0, c_2=c_2(k)>0$ are some constants independent of $n$. Thus $I_k(n)$ grows in essentially the same manner as the number of cyclic words of length $n$.

math.GR↗

The frequency space of a free group

We analyze the structure of the \emph{frequency space} $Q(F)$ of a nonabelian free group $F=F(a_1,...,a_k)$ consisting of all shift-invariant Borel probability measures on $\partial F$ and construct a natural action of $Out(F)$ on $Q(F)$. In particular we prove that for any outer automorphism $ϕ$ of $F$ the \emph{conjugacy distortion spectrum} of $ϕ$, consisting of all numbers $||ϕ(w)||/||w||$, where $w$ is a nontrivial conjugacy class, is the intersection of $\mathbb Q$ and a closed subinterval of $\mathbb R$ with rational endpoints. We also provide an algorithm for detecting strict hyperbolicity of an automorphism of $F$.

math.GR↗

Relative hyperbolicity and Artin groups

Let $G= $ be an Artin group and let $m_{ij}=m_{ji}$ be the length of each of the sides of the defining relation involving $a_i$ and $a_j$. We show if all $m_{ij}\ge 7$ then $G$ is relatively hyperbolic in the sense of Farb with respect to the collection of its two-generator subgroups $ $ for which $m_{ij}<\infty$.

math.GR↗

Foldings, graphs of groups and the membership problem

We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequences. We then show how they are useful in analyzing the solvability of the uniform subgroup membership problem for fundamental groups of graphs of groups. Applications include coherent right-angled Artin groups and coherent solvable groups.

math.GR↗

Freely indecomposable groups acting on hyperbolic spaces

We obtain a number of finiteness results for groups acting on Gromov-hyperbolic spaces. In particular we show that a torsion-free locally quasiconvex hyperbolic group has only finitely many conjugacy classes of $n$-generated one-ended subgroups. We also show that the rank problem is solvable for the class of torsion-free locally quasiconvex hyperbolic groups (even though it is unsolvable for the class of all torsion-free hyperbolic groups). We apply our results to 3-manifold groups. Namely, suppose $G$ is the fundamental group of a closed hyperbolic 3-manifold fibering over a circle and suppose that all finitely generated subgroups of $G$ are topologically tame. We prove that for any $k\ge 2$ the group $G$ has only finitely many conjugacy classes of non-elementary freely indecomposable $k$-generated subgroups of infinite index in $G$.

math.GR↗

Genericity, the Arzhantseva-Ol'shanskii method and the Isomorphism Problem for One-Relator Groups

We apply the method of Arzhantseva-Ol'shanskii to prove that for an exponentially generic (in the sense of Ol'shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a corollary of our more general result that for any fixed integers $m>1, n>0$ there is an exponentially generic class of $m$-generator $n$-relator groups where every group has only one Nielsen equivalence class of $m$-tuples generating non-free subgroups. This means that a group $G$ in this class has has only one non-free $m$-generated subgroup, namely $G$ itself. Hence for any homomorphism for an $m$-generated group to $G$ the image of this homomorphism is either free or is equal to $G$. Applied to injective homomorphisms from $G$ to itself this implies that $G$ is co-Hopfian. Moreover, every automorphism of $G$ is "freely induced", that is, it lifts to an automorphism of the free group $F_m$. All of these results are obtained by folding methods without using the theory of JSJ-decomposition or the R-tree techniques deployed by Zlil Sela in his famous solution of the isomorphism problem for torsion-free word-hyperbolic groups.

math.GR↗

A remark on mapping tori of free group endomorphisms

We observe that the results of Feighn-Handel and Geoghegan-Mihalik-Sapir-Wise about coherence and Hopficity of mapping tori of injective endomorphisms of free groups extend to non-injective endomorphisms.

math.GR↗

Average-case complexity and decision problems in group theory

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated group $G$ has the word problem solvable in subexponential time and has a subgroup of finite index which possesses a non-elementary word-hyperbolic quotient group, then the average-case complexity of the word problem for $G$ is linear time, uniformly with respect to the collection of all length-invariant measures on $G$. For example, the result applies to all braid groups $B_n$.

math.GR↗

Generic-case complexity, decision problems in group theory and random walks

We give a precise definition of ``generic-case complexity'' and show that for a very large class of finitely generated groups the classical decision problems of group theory - the word, conjugacy and membership problems - all have linear-time generic-case complexity. We prove such theorems by using the theory of random walks on regular graphs.

math.GR↗

Nielsen methods and groups acting on hyperbolic spaces

We show that for any positive integer $n$ there exists a constant $C(n)>0$ such that any $n$-generated group $G$, which acts by isometries on a $δ$-hyperbolic space (with $δ>0$), is either free or has a nontrivial element with translation length at most $δC(n)$.

math.GR↗