Independence of multispins in rooted forests of Cartesian products of complete graphs

Let G=(U,A)G=(U,A) be a weighted digraph, let KpK_p be the complete graph with vertex set [p][p], and let H=G×KpH=G\times K_p be their Cartesian product. A rooted forest of HH has a GG-projection if it records the number of aa-arcs for every aAa\in A and the number of vertical arcs at every uUu\in U. For a rooted forest FF and uUu\in U, let σu\sigma_u denote the multiset of spins of the vertical arcs of FF at uu. Given a rooted forest F0F_0 of HH, choose FF uniformly among rooted forests of HH having the same GG-projection as F0F_0. Independence of multispins. The multispins (σu)uU(\sigma_u)_{u\in U} of FF at the different vertices of GG are independent.

Sources & referencesView supporting material

Primary source

Olivier Bernardi, “On the spanning trees of the hypercube and other products of graphs”, arXiv:1207.0896 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.