Bi-resolving Graph Homomorphisms and Extensions of Bi-closing codes
Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving homomorphisms and give several sufficient conditions for a bi-resolving homomorphism to have a bi-covering extension with an irreducible domain. Using these results, we prove that a bi-closing code between subshifts can be extended to an n-to-1 code between irreducible shifts of finite type for all large n.
KeywordsCovering Resolving Subamalgamation matrix Covering extension Bi-closing Shift of finite type
Mathematics Subject Classification (2000)37B10 05C50 05C70 37B40
This paper was written during the authors’ graduate studies. We would like to thank our advisor Sujin Shin for her encouragement and good advice. We thank the referee for thorough suggestions which simplified and clarified many proofs, and Mike Boyle for comments which improved the exposition. The first named author was partially supported by TJ Park Postdoctoral Program. This work was also supported by the second stage of the Brain Korea 21 Project, The Development Project of Human Resources in Mathematics, KAIST in 2009.
- 2.Adler, R., Marcus, B.: Topological entropy and equivalence of dynamical systems. Mem. Am. Math. Soc. 219 (1979) Google Scholar
- 8.Boyle, M., Krieger, W.: Almost Markov and shift equivalent sofic systems. In: Lecture Notes in Math., vol. 1342. Springer, Berlin (1988) Google Scholar