Perron-Frobenius "inverse eigenvalue problem" The Perron-Frobenius theorem says that the largest eigenvalue of a positive real matrix (all entries positive) is real.  Moreover, that eigenvalue has a positive eigenvector, and it is the only eigenvalue having a positive eigenvector.
Now suppose we want to construct a positive rational matrix with a particular Perron-Frobenius eigenvalue.  Specifically, consider a positive real algebraic number $\lambda$ which is greater in absolute value than all of its Galois conjugates.  Does there exist a positive rational matrix $A$ with $\lambda$ as its Perron-Frobenius eigenvalue?
 A: Perhaps you're thinking of the strong form given in the Roy Adler conference
Symbolic Dynamics and Its Applications (Contemporary Mathematics) [1992].
One of the papers there by me was answering a question of Doug Lind, to show that if $\lambda $ exceeds the absolute value of its algebraic conjugates, then it appears as the Perron eigenvalue of a primitive integer matrix. In general, you can arrange it so that the nonzero spectrum consists of $\lambda$ and its conjugates (multiplicity one each of course) together with a usually large number of $1$s. The presence of many more eigenvalues (hence there is no control on the size of the realizing matrix) is necessary, since we must also have $\text{tr} A^n \geq 0$ for all $n$ (and other conditions) if $A$ is a primitive integer matrix.
A: The answer to a sharper question involving integers, rather than rationals, is affirmative.

Let $\lambda$ be a positive real algebraic integer that is greater in absolute value than all its Galois conjugates ("Perron number" or "PF number"). Then $\lambda$ is the Perron–Frobenius eigenvalue of a positive integer matrix.  

(The converse statement is an integer version of the Perron–Frobenius theorem, and is easy to prove.)
In a slightly weaker form (aperiodic non-negative matrix), this is theorem of Douglas Lind, from 
The entropies of topological Markov shifts and a related class of algebraic integers.
Ergodic Theory Dynam. Systems 4 (1984), no. 2, 283--300 (MR)
I don't have a good reference for the strong form, but it was discussed at Thurston seminar in 2008-2009. One interesting thing to note is that, while the proof can be made constructive, it is non-uniform: the size of the matrix can be arbitrarily large compared to the degree of $\lambda$.
A: For the problem of constructing a strictly positive real matrix $A$ of size $N \times N~$ with Perron-Frobenius eigenvalue $\lambda$, I offer the following solution without proof:
Choose any strictly positive real column vector $\pi$ of length $N~$ s.t. $||\pi||_1 = \lambda$.
Then $A = \left|\begin{array}{ccc} \pi & \pi & ... & \pi \end{array}\right|$,
i.e. the $N \times N$ matrix with every column equal to $\pi$.
$\lambda$ is the Perron-Frobenius eigenvalue of the matrix $A$ and the corresponding eigenvector is $\pi$.
(note: this implies a family of solutions for any $\lambda$, however I make no claim that these are the only solutions)
