Prime-diagonal rank conjecture for graphical Hermite simplices
Prime-diagonal rank conjecture for graphical Hermite simplices
Let be the topological ordering of a graph on , and let be the matrix over given by
Let be the rank of over , and let be the elementary divisors of . Prime-diagonal rank conjecture. The elementary divisors satisfy and .
This conjecture makes precise the experimental observation that, for a prime diagonal, the rank of the adjacency matrix over determines how powers of are distributed among the nonunit elementary divisors, extending the preceding result from bipartite graphs to all graphs. Its status is not established in the supplied text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Benjamin Braun and Antwon Park, “Smith Normal Forms of Graphical Hermite Simplices”, arXiv:2511.03822 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.