Search arXivSearch

arXiv · 2603.03913

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

Abstract

For integers $n \ge 3$ and $r \ge 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 $A_{n,r}$ be its adjacency matrix. A canonical $n$-layer partition puts $A_{n,r}$ into an $n$-cyclic block form and isolates a cyclic product core $K_{n,r}$, so the nonzero spectrum of $A_{n,r}$ is obtained from that of $K_{n,r}$ by taking $n$th roots. We show that $K_{n,r}$ is totally nonnegative and irreducible, and hence its nonzero eigenvalues are real, positive, and simple. It follows that all nonzero eigenvalues of $A_{n,r}$ are simple and occur in $\exp(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} \in \mathbb{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 $ρ(A_{n,r}) \le (27/4)^{1/n}$ and the sharp limit $\displaystyle\lim_{r \to \infty} ρ(A_{n,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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroki Minamide. 2026-03-04. On the Adjacency spectra of alternating-oriented $n$-gonal staircase digraphs. https://arxiv.org/abs/2603.03913

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO