A note on the exponent set of primitive minimally strong digraphs (Q1188430): Difference between revisions

Let \(e(n)\) denote the least integer \((\geq 5)\) that is not the exponent of any \(n\times n\) primitive, nearly reducible matrix. Author proves \(e(n)>n^ 2/3\) (under certain additional hypotheses about the distance between \(n\) and the nearest prime number).