How well-conditioned can the eigenvalue problem be?

The condition number for eigenvalue computations is a well–studied quantity. But how small can we expect it to be? Namely, which is a perfectly conditioned matrix w.r.t. eigenvalue computations? In this note we answer this question with exact first order asymptotic.