Properties of Sub-Add Move Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917827168960512 |
|---|---|
| author | Cesarz, Patrick Fiorini, Eugene Gong, Charles Kelley, Kyle Thomas, Philip Woldar, Andrew |
| author_facet | Cesarz, Patrick Fiorini, Eugene Gong, Charles Kelley, Kyle Thomas, Philip Woldar, Andrew |
| contents | We introduce the notion of a move graph, that is, a directed graph whose vertex set is a $\mathbb Z$-module $\mathbb Z_n^m$, and whose arc set is uniquely determined by the action $M\!:\!\mathbb Z_n^m\to \mathbb Z_n^m$ where $M$ is an $m\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 $\mathbb Z_n$. Our principal focus is on a special family of such graphs, which we refer to as ``sub-add move graphs.'' |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01047 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Properties of Sub-Add Move Graphs Cesarz, Patrick Fiorini, Eugene Gong, Charles Kelley, Kyle Thomas, Philip Woldar, Andrew Combinatorics 05C50 (Primary) 05C25 (Secondary) We introduce the notion of a move graph, that is, a directed graph whose vertex set is a $\mathbb Z$-module $\mathbb Z_n^m$, and whose arc set is uniquely determined by the action $M\!:\!\mathbb Z_n^m\to \mathbb Z_n^m$ where $M$ is an $m\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 $\mathbb Z_n$. Our principal focus is on a special family of such graphs, which we refer to as ``sub-add move graphs.'' |
| title | Properties of Sub-Add Move Graphs |
| topic | Combinatorics 05C50 (Primary) 05C25 (Secondary) |
| url | https://arxiv.org/abs/2411.01047 |