ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph on nn vertices. Its scaled Laplacian is ρ(G):=L(G)/tr⁡L(G)\rho(G):=L(G)/\operatorname{tr}L(G), where L(G)=D(G)−A(G)L(G)=D(G)-A(G), with D(G)D(G) the diagonal degree matrix and A(G)A(G) the adjacency matrix. The von Neumann entropy of GG is the Shannon entropy of the eigenvalues of ρ(G)\rho(G), namely

S(G)=−∑i=1nλilog⁡2λi.S(G)=-\sum_{i=1}^n\lambda_i\log_2\lambda_i.

Here {λi}i=1n=spec⁡(ρ(G))\{\lambda_i\}_{i=1}^n=\operatorname{spec}(\rho(G)). The star conjecture. For all connected graphs on nn vertices, the minimum von Neumann entropy is attained by the star K1,n−1K_{1,n-1}.

This was posed because the minimum over connected graphs was open, although the extrema over all graphs were known. It was confirmed computationally through 88 vertices, and for trees through 1515 vertices; the paper proves it for almost all graphs as n→∞n\to\infty, while the general connected-graph case remains open.

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.