Related papers: Random nilpotent groups I

The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

We introduce a model of random f.g., torsion-free, $2$-step nilpotent groups (in short, $\tau_2$-groups). To do so, we show that these are precisely the groups that admit a presentation of the form $ \label{tau2pres_0}\langle A, C \mid…

In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…

We find a family of groups generated by a pair of parabolic elements in which every relator must admit a long subword of a specific form. In particular, this collection contains groups in which the number of syllables of any relator is…

A group obtained from a nontrivial group by adding one generator and one relator which is a proper power of a word in which the exponent-sum of the additional generator is one contains the free square of the initial group and almost always…

We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We completely describe the structure of soluble groups and finite perfect groups with…

We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…

In this article, we study geometric properties of nilpotent groups. We find a geometric criterion for the word problem for the finitely generated free nilpotent groups. By geometric criterion, we mean a way to determine whether two words…

We consider models of random groups in which the typical group is of intermediate rank (in particular, it is not hyperbolic). These models are parallel to M. Gromov's well-known constructions and include for example a "density model" for…

We introduce a density model for random quotients of a free product of finitely generated groups. We prove that a random quotient in this model has the following properties with overwhelming probability: if the density is below $1/2$, the…

We study random torsion-free nilpotent groups generated by a pair of random words of length $\ell$ in the standard generating set of $U_n(\mathbb{Z})$. Specifically, we give asymptotic results about the step properties of the group when the…

Let $F$ be either a free nilpotent group of a given class and of finite rank or a free solvable group of a certain derived length and of finite rank. We show precisely which ones have the $R_{\infty}$ property. Finally, we also show that…

In this paper, we establish the theory of nilpotent hypergroups and study some properties of nilpotent hypergroups and provided some structural characterizations of nilpotent hypergroups.

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

In this article we study the homology of nilpotent groups. In particular a certain vanishing result for the homology and cohomology of nilpotent groups is proved.

The $k$-gonal models of random groups are defined as the quotients of free groups on $n$ generators by cyclically reduced words of length $k$. As $k$ tends to infinity, this model approaches the Gromov density model. In this paper we show…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.