ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph, let nGn_G be its number of vertices, and let SV(G,β)S^V(G,\beta) denote its walk entropy at temperature β>0\beta>0. Temperature-count conjecture. If GG is not walk-regular, then there are at most nG−1n_G-1 values β>0\beta>0 such that

SV(G,β)=log⁡nG.S^V(G,\beta)=\log n_G.

The paper proves only that this set of temperatures is finite. The conjecture proposes the sharper bound nG−1n_G-1 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.