ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with at least one edge, let L(G)=D(G)−A(G)L(G)=D(G)-A(G) be its combinatorial Laplacian, and define the scaled Laplacian by ρ(G):=L(G)/tr⁡L(G)\rho(G):=L(G)/\operatorname{tr}L(G). For α>1\alpha>1, the Rényi α\alpha-entropy of GG is

Hα(G)=11−αlog⁡2(∑iλiα),H_\alpha(G)=\frac{1}{1-\alpha}\log_2\left(\sum_i\lambda_i^\alpha\right),

where the λi\lambda_i are the eigenvalues of ρ(G)\rho(G). The star conjecture. For α>1\alpha>1 and any connected graph GG on nn vertices,

Hα(K1,n−1)≤Hα(G).H_\alpha(K_{1,n-1})\leq H_\alpha(G).

This is the Rényi-entropy analogue of the conjecture that the star minimizes von Neumann entropy among connected graphs. The paper establishes the corresponding unrestricted extremal bounds but leaves the connected-graph minimum as a conjecture.

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.