SearcharxivSearch

arXiv · 2606.10143

On the Spectral Region of n-Cycle Stochastic Matrices

Abstract

For every $n$, we determine the complete eigenvalue region of the $n$-cycle stochastic family. For $n\ge 2$, write $A_n(\alpha)$ for the matrix indexed by $\mathbb Z/n\mathbb Z$ with $$ (A_n(\alpha))_{j,j}=\alpha_j,\qquad (A_n(\alpha))_{j,j+1}=1-\alpha_j,\qquad 0\le \alpha_j<1, $$ and all other entries zero, and set $C_n=\{A_n(\alpha):\alpha\in[0,1)^n\}$. Writing $\Sigma_n$ for the corresponding spectral union, the trivial cases are $\Sigma_1=\{1\}$ and $\Sigma_2=[-1,1]$. For $n\ge 3$, we give an explicit description of $\Sigma_n$ in angular coordinates $m=\mathrm{Arg}(\lambda)$ and $M=\mathrm{Arg}(\lambda-1)$. Under the map $$ \Lambda(m,M)=\frac{\sin M}{\sin(M-m)}e^{im}, $$ the upper half of $\Sigma_n$ is the image of a finite union of $K=\lfloor(n-1)/2\rfloor$ vertical angular sectors. Its exposed boundary is an alternating chain of Jensen chords, arising from the Jensen-equality lines $M=\phi_k$, and algebraic one-loop arcs joining the relevant roots of unity to $0$; the lower boundary is obtained by complex conjugation. The real spectral part is $[-1,1]$ for even $n$ and $(0,1]$ for odd $n$. The proof is independent of Karpelevich's theorem and reduces the two-monomial characteristic equation to sharp argument bounds on a simplex, obtained by Jensen, majorization, and finite visibility arguments.

Explore related subjects

Keep this discovery

BibTeXRIS

Brecht Verbeken, Vincent Ginis. 2026-06-08. On the Spectral Region of n-Cycle Stochastic Matrices. https://arxiv.org/abs/2606.10143

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA