output
19922026
most citedExperimental and Theoretical Challenges in the Search for the Quark Gluon Plasma: The STAR Collaboration's Critical Assessment of the Evidence from RHIC Collisions

3.4k citations

Showing 2003 · math.GRShow all

7 papers · 2 filters

math.GR2003

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…

math.GR2003

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.…

math.GR2003

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…

math.GR2003★ 1 cited

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…

math.GR2003

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…

math.GR2003

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…

math.GR2003

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…