Graphic Flows and Multiple Disjointness
Joseph Auslander, Nelson G. Markley · Transactions of the American Mathematical Society · 1985
A graphic flow is a totally minimal flow for which the only minimal subsets of the product flow are the graphs of the powers of the generating homeomorphism. The POD flows of Furstenberg, Keynes, and Shapiro [5] are examples of graphic flows. Graphic flows are in some ways analogous to ergodic systems with minimal self-joinings [11]. Various disjointness results concerning graphic flows and their powers are obtained, and their regular factors are determined.