Strong shift equivalence and positive doubly stochastic matrices
From MaRDI portal
Publication:477741
DOI10.1016/J.LAA.2014.10.043zbMATH Open1305.15077OpenAlexW2058455631MaRDI QIDQ477741FDOQ477741
Authors: Sompong Chuysurichay
Publication date: 9 December 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: We give sufficient conditions for a positive stochastic matrix to be similar and strong shift equivalent over to a positive doubly stochastic matrix through matrices of the same size. We also prove that every positive stochastic matrix is strong shift equivalent over to a positive doubly stochastic matrix. Consequently, the set of nonzero spectra of primitive stochastic matrices over with positive trace and the set of nonzero spectra of positive doubly stochastic matrices over are identical. We exhibit a class of matrices, pairwise strong shift equivalent over through matrices, for which there is no uniform upper bound on the minimum lag of a strong shift equivalence through matrices of bounded size. In contrast, we show for any primitive matrix of positive trace that the set of positive matrices similar to it contains only finitely many SSE- classes.
Full work available at URL: https://arxiv.org/abs/1407.2485
Recommendations
- Path components of matrices and strong shift equivalence over \(Q^ +\)
- Strong shift equivalence of Boolean and positive rational matrices
- Doubly stochastic matrices with prescribed positive spectrum
- Strong shift equivalence of 2 × 2 matrices of non-negative integers
- Strong shift equivalence of 2 by 2 non‐negative integral matrices
Positive matrices and their generalizations; cones of matrices (15B48) Canonical forms, reductions, classification (15A21) Stochastic matrices (15B51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A constructive version of the Boyle-Handelman theorem on the spectra of nonnegative matrices
- An Introduction to Symbolic Dynamics and Coding
- Classification of subshifts of finite type
- Equivariant flow equivalence for shifts of finite type, by matrix equivalence over group rings
- On the Stochastic and Topological Structure of Markov Chains
- Path components of matrices and strong shift equivalence over \(Q^ +\)
- Path methods for strong shift equivalence of positive matrices
- Row Stochastic Matrices Similar to Doubly Stochastic Matrices
- The Williams conjecture is false for irreducible subshifts
- The spectra of nonnegative matrices via symbolic dynamics
- The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains
- Williams's Conjecture is False for Reducible Subshifts
Cited In (6)
- Strong shift equivalence of Boolean and positive rational matrices
- Strong shift equivalence and the generalized spectral conjecture for nonnegative matrices
- Path methods for strong shift equivalence of positive matrices
- Strong shift equivalence of 2 × 2 matrices of non-negative integers
- Strong shift equivalence and shear adjacency of nonnegative square integer matrices
- The mapping class group of a shift of finite type
This page was built for publication: Strong shift equivalence and positive doubly stochastic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477741)