Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society
ISSN 1088-6850(online) ISSN 0002-9947(print)


Graphic flows and multiple disjointness

Authors: Joseph Auslander and Nelson Markley
Journal: Trans. Amer. Math. Soc. 292 (1985), 483-499
MSC: Primary 54H20; Secondary 28D05
MathSciNet review: 808733
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 54H20, 28D05

Retrieve articles in all journals with MSC: 54H20, 28D05

Additional Information

PII: S 0002-9947(1985)0808733-6
Article copyright: © Copyright 1985 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia