Differential calculi in group algebras and group ends (Q6084942): Difference between revisions

\noindent Let \(G=\langle X \rangle\) be a finitely generated group and let \(\lambda : G \times G \rightarrow G\) be an action of \(G\) on itself (we will use this notion \(g(m)=\lambda(g, m)\)). The graph \(sk(G; \lambda)\) is defined as follows: \begin{itemize} \item the elements of \(G\) are the vertices; \item given a generator \(x \in X\), the graph contains an edge with label \(x\) from a vertex \(a\) to a vertex \(b\) if \(x(a)=b\). \end{itemize} Given an element \(u \in G\), by \(sk_u\) we denote the connected component of \(sk(G; \lambda)\) containing \(u\). The \textit{number of ends} of a graph \(\gamma\) is the maximum number (over all finite subgraphs \(Q\)) of infinite connected components in all graphs of the form \(\gamma \setminus Q\). The author proves that the number of ends of the components \(sk_u\) of the graphs \(sk(G; \lambda)\) does not depend on the presentation of \(G\) and provides a formula to calculate it using the dimensions of suitable character spaces.