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 -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.''
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}
}