Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adler, R., Goodwyn, W., Weiss, B.: Equivalence of topological Markov shifts. Isr. J. Math. 27, 48–63 (1977)
Adler, R., Marcus, B.: Topological entropy and equivalence of dynamical systems. Mem. Am. Math. Soc. 219 (1979)
Ashley, J.: An extension theorem for closing maps of shifts of finite type. Trans. Am. Math. Soc. 336, 389–420 (1993)
Ashley, J., Marcus, B., Perrin, D., Tuncel, S.: Surjective extensions of sliding-block codes. SIAM J. Discrete Math. 6, 582–611 (1993)
Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math. 243, 21–66 (2002)
Boyle, M.: Lower entropy factors of sofic systems. Ergod. Theory Dyn. Syst. 3, 541–557 (1983)
Boyle, M.: Open problems in symbolic dynamics. In: Burns, K., Dolgopyat, D., Pezin, Y. (eds.) Geometric and Probabilistic Structures in Dynamics. Contemporary Mathematics Series, vol. 469, pp. 69–118. American Mathematical Society, Providence (2008)
Boyle, M., Krieger, W.: Almost Markov and shift equivalent sofic systems. In: Lecture Notes in Math., vol. 1342. Springer, Berlin (1988)
Boyle, M., Tuncel, S.: Infinite-to-one codes and Markov measures. Trans. Am. Math. Soc. 285, 657–684 (1984)
Deng, A., Sato, I., Wu, Y.: Homomorphisms, representations and characteristic polynomials of digraphs. Linear Algebra Appl. 423, 386–407 (2007)
Gross, J., Tucker, T.: Generating all graph coverings by permutation voltage assignments. Discrete Math. 18, 273–283 (1977)
Gross, J., Tucker, T.: Topological Graph Theory. Wiley-Interscience, New York (1987)
Jung, U.: On the existence of open and bi-continuing codes. Trans. Am. Math. Soc. 363, 1399–1417 (2011)
Kim, K.H., Roush, F.: On the structure of inert automorphisms of subshifts. Pure Math. Appl., Ser. B 2, 3–22 (1991)
Kim, K.H., Roush, F.: Free Z p actions on subshifts. Pure Math. Appl. 8, 293–322 (1997)
Kitchens, B.: Symbolic Dynamics: One-Sided, Two-Sided and Countable State Markov Shifts. Springer, Berlin (1998)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Nasu, M.: Constant-to-one and onto global maps of homomorphisms between strongly connected graphs. Ergod. Theory Dyn. Syst. 3, 387–413 (1983)
Trow, P.: Degrees of finite-to-one factor maps. Isr. J. Math. 71, 229–238 (1990)
van Lint, J., Wilson, R.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Ki Hang Kim.
Rights and permissions
About this article
Cite this article
Jung, U., Lee, IJ. Bi-resolving Graph Homomorphisms and Extensions of Bi-closing codes. Acta Appl Math 126, 245–252 (2013). https://doi.org/10.1007/s10440-013-9815-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10440-013-9815-6