Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains
From MaRDI portal
Publication:4038327
DOI10.2307/2152796zbMath0766.28008MaRDI QIDQ4038327
Publication date: 16 May 1993
Full work available at URL: https://doi.org/10.2307/2152796
Markov chains; positivity; Perron-Frobenius theorem; matrices of polynomials; \(\beta\)- function of a matrix; complete invariant of finite equivalence; Handelman polynomials
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
28D20: Entropy and other invariants
15B48: Positive matrices and their generalizations; cones of matrices
15A54: Matrices over function rings in one or more variables
Related Items
Strong shift equivalence theory and the shift equivalence problem, Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts, Characterization of polynomials whose large powers have all positive coefficients, The mathematical research of William Parry FRS, The shift equivalence problem., Boundary measures of Markov chains, Characterization of polynomials whose large powers have fully positive coefficients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invariants for finitary isomorphisms with finite expected code lengths
- Positive polynomials, convex integral polytopes, and a random walk problem
- Non-negative matrices and Markov chains. 2nd ed
- Conditional pressure and coding
- Linear algebra and subshifts of finite type
- On the finitary isomorphisms of markov shifts that have finite expected coding time
- Positive polynomials and product type actions of compact groups
- Finitary measures for subshifts of finite type and sofic systems
- Optical phase conjugation: principles, techniques, and applications
- A Finitary Classification of Topological Markov Chains and Sofic Systems
- Topological entropy and equivalence of dynamical systems
- Surjective Extensions of Sliding-Block Codes
- The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains
