The covariance-matrix conjecture for planar leaf-rooted trees
The covariance-matrix conjecture for planar leaf-rooted trees
Let and be planar leaf-rooted trees with no vertices of degree . For each tree, let and be the covariance matrices associated to the winding statistic of the two-particle exclusion process. The covariance-matrix conjecture. If
then and are isomorphic as planar leaf-rooted trees. This conjecture proposes that the winding covariance matrix recovers the underlying planar leaf-rooted tree; the paper provides evidence by distinguishing covariance matrices for two trees with the same degree sequence, but does not establish the general claim.
Sources & referencesView supporting material
Primary source
David A. Levin, Eric Ramos and Benjamin Young, “A model for random braiding in graph configuration spaces”, arXiv:2004.00674 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.