A permutation matrix of order n is a matrix of size n X n, composed of 0 and 1, that the sum (in the field of real numbers) of elements for each of its columns and each row is equal to 1. Let λ1, λ2, ..., λ5 be the proper numbers of the permutation of the order5. Find λ ∗ = min | λi |. With Gaussian elimination, i found that λ = 1. However there must be 5 eigenvalues and there must be complex values. Hw are they being calculated?

A permutation matrix of order n is a matrix of size n X n, composed of 0 and 1, that the sum (in the field of real numbers) of elements for each of its columns and each row is equal to 1. Let λ1, λ2, ..., λ5 be the proper numbers of the permutation of the order5. Find λ ∗ = min | λi |. With Gaussian elimination, i found that λ = 1. However there must be 5 eigenvalues and there must be complex values. Hw are they being calculated?

We would have to solve the equation $\displaystyle \lambda ^4 + \lambda ^3 + \lambda ^2 + \lambda + 1 = 0$, which is a quartic equation. It looks ugly and it is ugly. There's a way to do it but I don't recommend it, myself. I've never been able to do one yet.

So let's go to the geometry. In this case (the 5th roots of unity) the roots start at $\displaystyle \lambda _0 = 1$ and progress in a circle in the complex plane, at evenly spaced intervals over the unit circle.