Almost flow equivalence and the loop structure of directed graphs
Paulo Ventura Araújo · Warwick Research Archive Portal (University of Warwick) · 1992
We investigate the problem of almost flow equivalence for sub-shifts of finite type (SFT). The problem is to decide when two suspension flows of irreducible SFT are almost everywhere one to one factors of the same suspension (low, a problem that was solved by Mike Boyle. We obtain generalizations of Boyle’s result by considering the similar problems for Markov shifts and for SFT with finite group actions. We also undertake an analysis of the loop structure of directed graphs, and we reduce some problems concerning loops to the study of the loop diagram, which is a convenient form of representing the simple cycles of a given directed graph.