ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a family Gn,LG_{n,L} of non-planar connected graphs as above. Let QℓQ_\ell be the smallest Q>0Q>0 for which the transfer matrix T~L,ℓ,(ℓ)\widetilde{\sf T}_{L,\ell,(\ell)} for the fully symmetric representation (ℓ)(\ell) of ℓ\ell marked blocks has at least two dominant eigenvalues, or set Qℓ=∞Q_\ell=\infty if none exists. For Q∈(0,Qℓ)Q\in(0,Q_\ell), let λℓ\lambda_\ell be the unique dominant eigenvalue. Eigenvalue-crossing conjecture. One has Q0<Q1<Q2<⋯Q_0<Q_1<Q_2<\cdots; each λℓ\lambda_\ell is real; the equation ∣λℓ∣=∣λℓ′∣|\lambda_\ell|=|\lambda_{\ell'}| has at most one solution for 0<Q<min⁡(Qℓ,Qℓ′)0<Q<\min(Q_\ell,Q_{\ell'}); and, if a solution exists, it is Q=ℓ+ℓ′−1Q=\ell+\ell'-1. The source reports validation for generalized Petersen graphs with L=k+1L=k+1 and k≤7k\leq7.

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.