Complete maximal identity conjecture for Cartesian products of paths
Let denote the path graph with vertices, and let denote the Cartesian product of graphs. For with , consider . A graph has the complete maximal identity property if its maximal stable configuration is equivalent to the identity for every choice of sink.
Path-product conjecture. The only graphs with the complete maximal identity property are when , together with , which is .
The conjecture was supported by a SageMath verification for . The proposition establishing the listed cases is proved in the paper, but the exclusion of all other path products remains open.
References
- Yibo Gao and Rupert Li, “Compatible Recurrent Identities of the Sandpile Group and Maximal Stable Configurations”, arXiv:2008.10079 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.