加载中…
This paper considers the topological degree of -shifts of finite type for the case where is a nonabelian monoid. Whenever the Cayley graph of has a finite representation and the relationships among the generators of are determined by a matrix , the coefficients of the characteristic polynomial of are revealed as the number of children of the graph. After introducing an algorithm for the computation of the degree, the degree spectrum, which is finite, relates to a collection of matrices in which the sum of each row of every matrix is bounded by the number of children of the graph. Furthermore, the algorithm extends to of finite free-followers.

生成讲解博客的中文版本

生成AI智能校验的中文版本