2009/04/30 by Uijin Jung, In-Je Lee · 1 citation
Computer Science · Engineering · Mathematics · #Adjacency matrix #Algebra homomorphism #Cellular Automata and Applications #Closing (real estate) #Coding theory and cryptography #Combinatorics #Computer science #Discrete mathematics #Extension (predicate logic) #Graph #Graph homomorphism #Homomorphism #Line graph #Mathematics #Voltage graph #graph theory and CDMA systems #math.CO #math.DS #msc:05C50 #msc:05C70 #msc:37B10 #msc:37B40
paper · pdf · doi:10.1007/s10440-013-9815-6
published in Acta Applicandae Mathematicae 126(1), 245-252 (Springer Science+Business Media) · 9 pages, 1 figure; v2) compactified. Final version to appear in Acta Appl. Math., special issue dedicated to K. H. Kim
arxiv created 2010/01/15 · openalex publication_date 2013/03/14 · arxiv updated 2013/11/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.