3.4k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- City University of New YorkUS566 papers
- The Graduate Center, CUNYUS277 papers
- Yale UniversityUS182 papers
- Brookhaven National LaboratoryUS162 papers
- University of California, BerkeleyUS136 papers
- Lawrence Berkeley National LaboratoryUS130 papers
- The University of Texas at AustinUS130 papers
- University of WashingtonUS130 papers
- Indiana University BloomingtonUS119 papers
- Argonne National LaboratoryUS118 papers
- Max Planck Institute for PhysicsDE116 papers
- The Ohio State UniversityUS116 papers
7 papers · 2 filters
Metric properties of the lamplighter group as an automata group
Sean Cleary, Jennifer Taback
We examine the geometry of the Cayley graph of the lamplighter group with respect to the generating set rising from its interpretation as an automata group due to Grigorchuk and Zu…
On the palindromic and primitive widths of a free group
Valery Bardakov, Vladimir Shpilrain, Vladimir Tolstykh
Let G be a group and S a subset of G that generates G. For each x in G define the length l_S(x) of x relative to S to be the minimal k such that x is a product of k elements of S.…
Dead end words in lamplighter groups and other wreath products
Sean Cleary, Jennifer Taback
We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with…
Dynamics of free group automorphisms
Peter Brinkmann
We present a coarse convexity result for the dynamics of free group automorphisms: Given an automorphism of a finitely generated free group , we show that for all a…
A description of auto-fixed subgroups in a free group
A. Martino, E. Ventura
Let be a finitely generated free group. By using Bestvina-Handel theory, as well as some further improvements, the eigengroups of a given automorphism of (and its fixed sub…
Genetic algorithms and the Andrews-Curtis conjecture
Alexei D. Miasnikov
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary tran…
Foldings, graphs of groups and the membership problem
Ilya Kapovich, Richard Weidmann, Alexei Myasnikov
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…