ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T1T_1 and T2T_2 be trees on nn vertices. The (n−2,2)(n-2,2) support-forest profile is the collection of universal support-forest-counting quantities obtained from the moments Mr(2)(T)M_r^{(2)}(T) for 1≤r≤dim⁡Wn1\le r\le \dim W_n. The Laplacian spectrum is the spectrum in the (n−1,1)(n-1,1) representation, and the (n−2,2)(n-2,2)-spectrum is the spectrum in the (n−2,2)(n-2,2) representation.

Spectral support-forest-profile conjecture. If T1T_1 and T2T_2 have the same Laplacian spectrum and the same (n−2,2)(n-2,2) support-forest profile, then T1T_1 and T2T_2 are isomorphic. Equivalently, no two non-isomorphic trees have identical (n−1,1)(n-1,1)- and (n−2,2)(n-2,2)-spectra.

For trees, the (n−2,2)(n-2,2)-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 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.