Proceedings of the American Mathematical Society · 1970 · 53 citations · 7 references
Natural SciencesMathematicsFluid DynamicsTopologyTransport PhenomenaDisjoint Set UnionNetwork FlowsDisjointnessMinimal FlowsMinimal SetsWeak Mixing
In [3, Problem G, p. 34] the following problem is proposed: characterize the class Dx of all flows which are disjoint from every distal flow.We show here that 3D-1-consists precisely of the weakly mixing minimal flows.In arriving at this conclusion we make use of a result (Corollary to Theorem 1) which has been arrived at independently by Keynes and Robertson [4, Theorem 3.4, p. 366].In the following all
7