Bi-resolving graph homomorphisms and extensions of bi-closing codes

DOI10.1007/s10440-013-9815-6zbMath1329.37009arXiv0904.3042OpenAlexW2009703629MaRDI QIDQ368695

In-Je Lee, Uijin Jung

Publication date: 23 September 2013

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.3042

zbMATH Keywords

coveringshift of finite typebi-closingcovering extensionresolvingsubamalgamation matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Topological entropy (37B40) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms, representations and characteristic polynomials of digraphs
• Degrees of finite-to-one factor maps
• Equivalence of topological Markov shifts
• Generating all graph coverings by permutation voltage assignments
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• On the existence of open and bi-continuing codes
• Lower entropy factors of sofic systems
• Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
• Infinite-to-One Codes and Markov Measures
• An Extension Theorem for Closing Maps of Shifts of Finite Type
• Topological entropy and equivalence of dynamical systems
• Surjective Extensions of Sliding-Block Codes
• An Introduction to Symbolic Dynamics and Coding
• Fibrations of graphs

This page was built for publication: Bi-resolving graph homomorphisms and extensions of bi-closing codes