Conjecture on spectra and positive semistability of forest chromatic operators
Statement
Let be a forest on vertices, let be an ordering of its edges, and let 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 does not depend on the edge ordering . (b) The number of forests on vertices whose chromatic operator is positive semistable is , where is the th Fibonacci number, with . The paper reports that part (b) has been checked up to 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.