Let $\Gamma $ be a finitely generated group of matrices over $\mathbb {C}$. We construct an isometric action of $\Gamma $ on a complete $\mathrm {CAT}(0)$ space such that the restriction of this action to any subgroup of $\Gamma $ containing no nontrivial unipotent elements is well behaved. As an application, we show that if M is a graph manifold that does not admit a nonpositively curved Riemannian metric, then any finite-dimensional $\mathbb {C}$-linear representation of $\pi _1(M)$ maps a nontrivial element of $\pi _1(M)$ to a unipotent matrix. In particular, the fundamental groups of such 3-manifolds do not admit any faithful finite-dimensional unitary representations.

Let $H\le F$ be two finitely generated free groups. Given $g\in F$, we study the ideal $\mathfrak I_g$ of equations for g with coefficients in H, i.e. the elements $w(x)\in H*\langle x\rangle$ such that $w(g)=1$ in F. The ideal $\mathfrak I_g$ is a normal subgroup of $H*\langle x\rangle$, and it’s possible to algorithmically compute a finite normal generating set for $\mathfrak I_g$; we give a description of one such algorithm, based on Stallings folding operations. We provide an algorithm to find an equation in w(x)\in$\mathfrak I_g$ with minimum degree, i.e.  such that its cyclic reduction contains the minimum possible number of occurrences of x and x−1; this answers a question of A. Rosenmann and E. Ventura. More generally, we show how to algorithmically compute the set Dg of all integers d such that $\mathfrak I_g$ contains equations of degree d; we show that Dg coincides, up to a finite set, with either $\mathbb N$ or $2\mathbb N$. Finally, we provide examples to illustrate the techniques introduced in this paper. We discuss the case where ${\text{rank}}(H)=1$. We prove that both kinds of sets Dg can actually occur. We show that the equations of minimum possible degree aren’t in general enough to generate the whole ideal $\mathfrak I_g$ as a normal subgroup.

Let $W_{\Gamma} $ be the right-angled Coxeter group with defining graph $\Gamma $. We show that the asymptotic dimension of $W_{\Gamma} $ is smaller than or equal to $\mathrm{dim}_{CC}(\Gamma )$, the clique-connected dimension of the graph. We generalize this result to graph products of finite groups.

We consider the sequence of powers of a positive definite function on a discrete group. Taking inspiration from random walks on compact quantum groups, we give several examples of situations where a cut-off phenomenon occurs for this sequence, including free groups and infinite Coxeter groups. We also give examples of absence of cut-off using free groups again.