Q:

Given $A \in \mathbb{R}^{n \times n}$ real, symmetric, positive semidefinite matrix, find all eigenvalue and eigenvector pairs

Let $A \in \mathbb{R}^{n \times n}$ be a real, symmetric, positive semidefinite matrix with $n$ eigenvalues between $[0,1]$
Suppose we have the following information: 

$\lambda_{min}(A) = 0, \lambda_{max}(A) = 1$
$\det(A) = 0$ 
$A\mathbf{1} = 0$ (the one vector of $\mathbb{R}^n$ is an eigenvector
associated with the eigenvalue 0)

Since $A$ is symmetric, we know that all eigenvalues are going to be real. 
Is it possible to find all the other eigenvalues and eigenvectors?
This sounds like an impossible question because the information presented is minimal, but if there is some result that the distribution of the eigenvalues and eigenvectors are..."uniformly spaced" for this kind of matrix, then perhaps we can find all the other eigenvalue-eigenvector pairs.
Anyone has any ideas how to approach this question?

A:

There is no way to know what the other eigenvectors or eigenvalues are. Consider a matrix defined as $$A=\lambda_1v_1v_1^T + ... + \lambda_nv_nv_n^T$$
Where $\{v_1,...,v_n\}$ is an orthonormal basis for $\mathbb{R}^n$. Then clearly every $\lambda_i$ is an eigenvalue with eigenvector $v_i$. You can fix $\lambda_1=0$, $v_1=(1,...,1)$ and $\lambda_2=1$, but any choices over the other eigenvalues and eigenvectors on the definition of $A$ will give you a matrix that will hold all the constraints.

