Graphic flows and multiple disjointness-Reference-Cited by-同舟云学术

Graphic flows and multiple disjointness

Published:1985 Issue:2 Volume:292 Page:483-499
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Auslander Joseph,Markley Nelson

Abstract

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1985-292-02/S0002-9947-1985-0808733-6/S0002-9947-1985-0808733-6.pdf

Reference12 articles.

1. Regular minimal sets. I;Auslander, Joseph;Trans. Amer. Math. Soc.,1966

2. Weakly mixing transformations which are not strongly mixing;Chacon, R. V.;Proc. Amer. Math. Soc.,1969

3. Proximity relations in transformation groups;Clay, Jesse Paul;Trans. Amer. Math. Soc.,1963

4. Prime flows in topological dynamics;Furstenberg, Harry;Israel J. Math.,1973

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiply minimal points for the product of iterates;Israel Journal of Mathematics;2022-12

2. On weak mixing, minimality and weak disjointness of all iterates;Ergodic Theory and Dynamical Systems;2011-10-14

3. Minimal flows of finite almost periodic rank;Ergodic Theory and Dynamical Systems;1988-06