Spectral support-forest-profile conjecture for trees
Statement
Let and be trees on vertices. The support-forest profile is the collection of universal support-forest-counting quantities obtained from the moments for . The Laplacian spectrum is the spectrum in the representation, and the -spectrum is the spectrum in the representation.
Spectral support-forest-profile conjecture. If and have the same Laplacian spectrum and the same support-forest profile, then and are isomorphic. Equivalently, no two non-isomorphic trees have identical - and -spectra.
For trees, the -spectrum determines the support-forest profile, whose first nontrivial information beyond Laplacian data is a cubic combination of embedded forest counts. The conjecture asks whether the resulting hierarchy, together with Laplacian data, suffices for tree reconstruction.
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.