Properties of Sub-Add Move Graphs

Abstract

We introduce the notion of a move graph, that is, a directed graph whose vertex set is a Z-module Znm, and whose arc set is uniquely determined by the action M\!:\! Znm Znm where M is an m× m matrix with integer entries. We study the manner in which properties of move graphs differ when one varies the choice of cyclic group Zn. Our principal focus is on a special family of such graphs, which we refer to as ``sub-add move graphs.''

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…