Related papers: On the geometry of free nilpotent groups

The variety of nilpotent groups is Noetherian. That is why two nilpotent class s groups are geometrically equivalent if and only if they have same quasi-identities ([Pl3]). Therefore, we can describe classes of geometrical equivalence of…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

In this paper we consider the problem of classification of the nilpotent class 2 finitely generated torsion free groups up to the geometric equivalence. By a very easy technique it is proved that this problem is equivalent to the problem of…

Four geometric conditions on a geodesic metric space, which are stronger variants of classical conditions characterizing hyperbolicity, are proved to be equivalent. In the particular case of the Cayley graph of a finitely generated group,…

We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant…

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.

This paper aims to investigate the self-similarity property in finitely-generated torsion-free nilpotent groups. We establish connections between geometric equivalence and self-similarity in these groups. Moreover, we show that any…

The free nilpotent group $G_{m,n}$ of class $m$ and rank $n$ is the free object on $n$ generators in the category of nilpotent groups of class at most $m$. We show that $G_{m,n}$ can be recovered from its reduced group $C^*$-algebra, in the…

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

We solve the word problem of the identity $x(yz) = (xy)(yz)$ by investigating a certain group describing the geometry of that identity. We also construct a concrete realization of the free system of rank~1 relative to the above identity

The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…

We study group-graded Lie algebras L with finite support X. We show that L is nilpotent of |X|-bounded class if X is arithmetically-free. Conversely: we show that Y supports the grading of a non-nilpotent Lie algebra if Y is not…

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

If G is a finitely generated powerful pro-p group satisfying a certain law v=1, and if G can be generated by a normal subset T of finite width which satisfies a positive law, we prove that G is nilpotent. Furthermore, the nilpotency class…

Full residual finiteness growth of a finitely generated group $G$ measures how efficiently word metric $n$-balls of $G$ inject into finite quotients of $G$. We initiate a study of this growth over the class of nilpotent groups. When the…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…