Bound on maximum-entropy temperatures for non-walk-regular graphs
Statement
Let be a simple graph, let be its number of vertices, and let denote its walk entropy at temperature . Temperature-count conjecture. If is not walk-regular, then there are at most values such that
The paper proves only that this set of temperatures is finite. The conjecture proposes the sharper bound in terms of the number of vertices.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.