ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with kk vertices, let Gn=G×PnG_n=G\times P_n, and let MM be the integer Bk×BkB_k\times B_k matrix from the theorem such that Tn=Mnv[1]T_n=M^nv[1], where TnT_n is the number of spanning trees in GnG_n. Power-of-two factor degree conjecture. The characteristic polynomial χλ(M)\chi_\lambda(M) factors over the integers into monomials whose degree is always a power of 22. This conjecture concerns the algebraic structure of the transfer matrix governing spanning trees in graph products with paths; the source provides no evidence of resolution.

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.