3
$\begingroup$

Let $A$ be a primitive $N\times N$-matrix with positive entries, that is there is $n>0$ such that $(A^n)_{i,j}>0$ for all $i,j$. For brevity, assume the entries consist only of $0$ and $1$.

The Perron-Frobenius theorem gives, among other things, a distinguished eigenvalue $\lambda_1>1$ that is simple and for all the other eigenvalues $\lambda_j$ it holds that $|\lambda_j|<\lambda_1$.

I would like to ask if there is a characterization of matrices $A$ (or associated strongly connected graphs) for which it holds that $|\lambda_j|\leq 1$, for every $j\neq 1$? Thanks!

$\endgroup$
4
  • $\begingroup$ @FedorPetrov, just edited it. Thanks $\endgroup$ Commented Jan 25, 2024 at 22:49
  • 1
    $\begingroup$ A related question I asked many years ago, which was answered, giving an algorithm for testing if an eigenvalue lies on the unit circle or not. With this, and a numerical method that can arbitrarily approximate eigenvalues, you can algorithmically determine if a matrix satisfies your condition (math.stackexchange.com/questions/1436637/…) $\endgroup$ Commented Jan 26, 2024 at 21:23
  • 1
    $\begingroup$ It should also be mentioned that the matrices of your type have characteristic polynomials that are either Pisot or Salem. $\endgroup$ Commented Jan 26, 2024 at 21:25
  • $\begingroup$ @DanRust, very helpful comments! thanks! $\endgroup$ Commented Jan 27, 2024 at 10:48

0

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.