On the Adjacency spectra of alternating-oriented n-gonal staircase digraphs
Abstract
For integers n 3 and r 1, let n,r be the alternating-oriented digraph obtained by gluing r directed n-cycles along a single edge in a staircase pattern, and let An,r be its adjacency matrix. A canonical n-layer partition puts An,r into an n-cyclic block form and isolates a cyclic product core Kn,r, so the nonzero spectrum of An,r is obtained from that of Kn,r by taking nth roots. We show that Kn,r is totally nonnegative and irreducible, and hence its nonzero eigenvalues are real, positive, and simple. It follows that all nonzero eigenvalues of An,r are simple and occur in (2π i/n)-orbits, forming unions of regular n-gons in the complex plane. A one-step Schur complement yields a three-term recursion in r for the characteristic polynomials n,r ∈ Z[x]. This determines both the multiplicity of the eigenvalue 0 and the number of nonzero eigenvalues, and leads to a generating function with cubic denominator. Applying a Tran-type confinement theorem gives the uniform bound (An,r) (27/4)1/n and the sharp limit r ∞ (An,r) = (27/4)1/n for each fixed n. Finally, specializing at x=1 relates n,r(1) to Padovan spiral numbers and yields a complete classification of rational nonzero eigenvalues.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.