Publications (8)0 Total impact
-
Article: On the conjugacy growth functions of groups
[show abstract] [hide abstract]
ABSTRACT: To every finitely generated group one can assign the conjugacy growth function that counts the number of conjugacy classes intersecting a ball of radius $n$. Results of Ivanov and Osin show that the conjugacy growth function may be constant even if the (ordinary) growth function is exponential. The aim of this paper is to provide conjectures, examples and statements that show that in "normal" cases, groups with exponential growth functions also have exponential conjugacy growth functions. Comment: 10 pages03/2010; -
Article: Metrics on diagram groups and uniform embeddings in a Hilbert space
[show abstract] [hide abstract]
ABSTRACT: We give first examples of finitely generated groups having an intermediate, with values in (0,1), Hilbert space compression (which is a numerical parameter measuring the distortion required to embed a metric space into Hilbert space). These groups include certain diagram groups. In particular, we show that the Hilbert space compression of Richard Thompson's group $F$ is equal to 1/2, the Hilbert space compression of the restricted wreath product $Z\wr Z$ is between 1/2 and 3/4, and the Hilbert space compression of $Z\wr (Z\wr Z)$ is between 0 and 1/2. In general, we find a relationship between the growth of $H$ and the Hilbert space compression of $Z\wr H$.12/2004; -
Article: Growth rates of amenable groups
[show abstract] [hide abstract]
ABSTRACT: Let $F_m$ be a free group with $m$ generators and let $R$ be its normal subgroup such that $F_m/R$ projects onto $\zz$. We give a lower bound for the growth rate of the group $F_m/R'$ (where $R'$ is the derived subgroup of $R$) in terms of the length $\rho=\rho(R)$ of the shortest nontrivial relation in $R$. It follows that the growth rate of $F_m/R'$ approaches $2m-1$ as $\rho$ approaches infinity. This implies that the growth rate of an $m$-generated amenable group can be arbitrarily close to the maximum value $2m-1$. This answers an open question by P. de la Harpe. In fact we prove that such groups can be found already in the class of abelian-by-nilpotent groups as well as in the class of finite extensions of metabelian groups.07/2004; -
Article: Diagram groups are totally orderable
[show abstract] [hide abstract]
ABSTRACT: In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a partially commutative group and R. Thompson's group $F$. As a result, we prove that all diagram groups are totally orderable.06/2003; -
Article: On subgroups of R.Thompson's group F and other diagram groups
[show abstract] [hide abstract]
ABSTRACT: In this paper, we continue our study of the class of diagram groups. Simply speaking, a diagram is a labelled plane graph bounded by a pair of paths (the top path and the bottom path). To multiply two diagrams, one simply identifies the top path of one diagram with the bottom path of the other diagram, and removes pairs of "reducible" cells. Each diagram group is determined by an alphabet $X$, containing all possible labels of edges, a set of relations ${\cal R}=\{u_i=v_i\mid i=1,2,... \}$, containing all possible labels of cells, and a word $w$ over $X$ -- the label of the top and bottom paths of diagrams. Diagrams can be considered as 2-dimensional words, and diagram groups can be considered as 2-dimensional analogue of free groups. In our previous paper, we showed that the class of diagram groups contains many interesting groups including the famous R. Thompson group $F$ (it corresponds to the simplest set of relations $\{x=x^2 \}$), closed under direct and free products and some other constructions. In this paper we study mainly subgroups of diagram groups. We show that not every subgroup of a diagram group is itself a diagram group (this answers a question from the previous paper). We prove that every nilpotent subgroup of a diagram group is abelian, every abelian subgroup is free, but even the Thompson group contains solvable subgroups of any degree. We also study distortion of subgroups in diagram groups, including the Thompson group. It turnes out that centralizers of elements and abelian subgroups are always undistorted, but the Thompson group contains distorted soluble subgroups.06/2000; -
Article: Rigidity property of diagram groups
[show abstract] [hide abstract]
ABSTRACT: We show a rigid connection between two classical objects: the R.Thompson group F and the Dunce hat. A diagram group of a directed 2-complex contains a copy of F if and only if the complex contains a copy of the Dunce hat.06/2000; -
Article: Diagram Groups
[show abstract] [hide abstract]
ABSTRACT: this paper, we study 2-dimensional analogies of this idea: semigroup diagrams, monoid pictures, annular diagrams, cylindric pictures and braided pictures. While the groups of linear diagrams are all free, we get a large class of groups which are representable by 2-dimensional semigroup diagrams. Semigroup diagrams, are well-known geometrical objects used in the study of Thue systems (=semigroup presentations). They were first formally introduced by Kashintsev [16], see also Remmers [29], Stallings [34] or Higgins [13]. The role of semigroup diagrams in the study of semigroups is similar to the role of van Kampen diagrams in the study of groups (see [22] or [26])08/1997; -
Article: Diagram groups / Victor Guba, Mark Sapir
[show abstract] [hide abstract]
ABSTRACT: Incluye bibliografíaSERBIULA (sistema Librum 2.0).
