ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a forest on nn vertices, let π\pi be an ordering of its edges, and let αF,π∈C[Sn]\alpha_{F,\pi}\in\mathbb{C}[S_n] be its chromatic operator. A chromatic operator is positive semistable when all its eigenvalues have nonnegative real part. Forest chromatic-operator conjecture. (a) The characteristic polynomial of αF,π\alpha_{F,\pi} does not depend on the edge ordering π\pi. (b) The number of forests on nn vertices whose chromatic operator is positive semistable is fn−1f_{n-1}, where fnf_n is the nnth Fibonacci number, with f1=f2=1f_1=f_2=1. The paper reports that part (b) has been checked up to 1010 vertices, while the general assertions remain conjectural.

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.