English

Properties of Sub-Add Move Graphs

Combinatorics 2024-11-05 v1

Abstract

We introduce the notion of a move graph, that is, a directed graph whose vertex set is a Z\mathbb Z-module Znm\mathbb Z_n^m, and whose arc set is uniquely determined by the action M ⁣: ⁣ZnmZnmM\!:\!\mathbb Z_n^m\to \mathbb Z_n^m where MM is an m×mm\times 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\mathbb Z_n. Our principal focus is on a special family of such graphs, which we refer to as ``sub-add move graphs.''

Keywords

Cite

@article{arxiv.2411.01047,
  title  = {Properties of Sub-Add Move Graphs},
  author = {Patrick Cesarz and Eugene Fiorini and Charles Gong and Kyle Kelley and Philip Thomas and Andrew Woldar},
  journal= {arXiv preprint arXiv:2411.01047},
  year   = {2024}
}
R2 v1 2026-06-28T19:45:07.105Z