The Type III stochastic-matrix graph conjecture

From papers

Let AA be a stochastic matrix of order nn whose characteristic polynomial is Type III:

fα(t)=ty(tq(1α))dαd,f_{\alpha}(t)=t^y(t^q-(1-\alpha))^d-\alpha^d,

where n=qd+yn=qd+y, 1yq11\leq y\leq q-1, and d2d\geq 2. Type III stochastic-matrix graph conjecture. Then AA is permutationally similar to a matrix whose directed graph Γ\Gamma satisfies the hypothesis of Proposition 3.

This conjecture proposes that every stochastic matrix with a Type III characteristic polynomial has, after a simultaneous permutation of rows and columns, the graph structure described by the cited proposition. The supplied text gives no resolution or further context, so its status is open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Stephen Kirkland and Helena Šmigoc, “Stochastic Matrices Realising the Boundary of the Karpelevič Region”, arXiv:2110.01040 (2021).

Solutions 0

No solutions have been posted yet.