加载中…
We introduce the notion of a move graph, that is, a directed graph whose vertex set is a -module , and whose arc set is uniquely determined by the action where is an matrix with integer entries. We study the manner in which properties of move graphs differ when one varies the choice of cyclic group . Our principal focus is on a special family of such graphs, which we refer to as ``sub-add move graphs.‘’

生成讲解博客的中文版本

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