3 citations · 4 across the 8 of their papers we have counts for
Showing 2003 · math.GRShow all
2 papers · 2 filters
math.GR2003
Delzant's T-invariant, Kolmogorov complexity and one-relator groups
Ilya Kapovich, Paul Schupp
We prove that ``almost generically'' for a one-relator group Delzant's -invariant (which measures the smallest size of a finite presentation for a group) is comparable in magnit…
math.GR2003
Generic properties of Whitehead's Algorithm and isomorphism rigidity of random one-relator groups
Ilya Kapovich, Paul Schupp, Vladimir Shpilrain
We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group has strongly linear time generic-case complexity. This is done by showing that…