Embedding of free nilpotent (metabelian) groups in partially commutative nilpotent (metabelian) groups (Q6154087)

Let \(\Gamma=(X,E)\) be an undirected graph without multiple edges and loops with vertex set \(X=\{x_{1}, \ldots, x_{n}\}\) and edge set \(E \subseteq X \times X\). The partially commutative group \(F(\Gamma)\) is defined by the following presentation by the presentation \(F(\Gamma)=\langle X \mid xy = yx \mbox{ iff } (x,y) \in E \rangle\). (These groups are perhaps better known under the name of graph groups or rectangular Artin groups.) In the paper under review the author presents an algorithm that determines the maximum rank of a free nilpotent metabelian or respectively nilpotent group isomorphically embeddable into a given partially commutative nilpotent group of the same nilpotency class.