Counting Arithmetical Structures on Paths and Cycles

Benjamin Braun, Hugo Corrales, Scott Corry +6

Let $G$ be a finite, simple, connected graph. An arithmetical structure on $G$ is a pair of positive integer vectors $\mathbf{d},\mathbf{r}$ such that $(\mathrm{diag}(\mathbf{d})-A…