The digraph diameter can be larger than the number of distinct eigenvalues: nilpotent counterexamples

For diagonalizable digraphs the diameter is less than the number of distinct eigenvalues. In the nilpotent case this is no longer true. We study how bad things can get by constructing examples. This relates to understanding what keeps the diameter of digraphs small, and thus producing efficient measures of transmission of information.