On the Adjacency spectra of alternating-oriented $n$-gonal staircase digraphs
Hiroki Minamide

TL;DR
This paper analyzes the spectral properties of a class of directed graphs formed by gluing cycles in a staircase pattern, revealing their eigenvalues' structure, bounds, and connections to special number sequences.
Contribution
It introduces a novel class of alternating-oriented staircase digraphs, characterizes their spectra, and derives bounds and recursive formulas for their eigenvalues.
Findings
Nonzero eigenvalues are real, positive, and form regular n-gons in the complex plane.
Established a bound on the spectral radius and its limit as r approaches infinity.
Connected eigenvalue properties to Padovan spiral numbers and rational eigenvalues.
Abstract
For integers and , let be the alternating-oriented digraph obtained by gluing directed -cycles along a single edge in a staircase pattern, and let be its adjacency matrix. A canonical -layer partition puts into an -cyclic block form and isolates a cyclic product core , so the nonzero spectrum of is obtained from that of by taking th roots. We show that is totally nonnegative and irreducible, and hence its nonzero eigenvalues are real, positive, and simple. It follows that all nonzero eigenvalues of are simple and occur in -orbits, forming unions of regular -gons in the complex plane. A one-step Schur complement yields a three-term recursion in for the characteristic polynomials . This determines both the multiplicity…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Graph theory and applications · Tensor decomposition and applications
