Eigenvalue-crossing conjecture for non-planar transfer matrices
Statement
Consider a family of non-planar connected graphs as above. Let be the smallest for which the transfer matrix for the fully symmetric representation of marked blocks has at least two dominant eigenvalues, or set if none exists. For , let be the unique dominant eigenvalue. Eigenvalue-crossing conjecture. One has ; each is real; the equation has at most one solution for ; and, if a solution exists, it is . The source reports validation for generalized Petersen graphs with and .
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.