双可分解图同态与双闭码的扩张
Bi-resolving graph homomorphisms and extensions of bi-closing codes
摘要:
给定两个图G和H,存在从G到H的双分解(或双覆盖)图同态当且仅当它们的邻接矩阵满足一定的矩阵关系。研究了双分解同态的双覆盖扩张,给出了双分解同态具有不可约整环的双覆盖扩张的几个充分条件。利用这些结果,我们证明了对于所有大的n,子移位之间的双闭码可以推广为有限型不可约移位之间的n-1码。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。