Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T19:04:34.098Z Has data issue: false hasContentIssue false

Minimal flows of finite almost periodic rank

Published online by Cambridge University Press:  19 September 2008

Joseph Auslander
Affiliation:
Department of Mathematics, University of Maryland, College Park, Maryland 20742, USA
Nelson Markley
Affiliation:
Department of Mathematics, University of Maryland, College Park, Maryland 20742, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The totally minimal flow (X, T) is said to have finite almost periodic rank if there is a positive integer n such that whenever (x1, x2,…, xn+1) is an almost periodic point of the product flow (Xn+1, T×…×T) then, for some i≠j, xi, and xj are in the same orbit. The rank of (X, T) is the smallest such integer. If (Y, S) is a graphic flow, (Y, Sn) has rank |n| and it is shown that every finite rank flow has, modulo a proximal extension, a graphic power factor. Various classes of finite rank flows are defined, and characterized in terms of their Ellis groups. There are four disjoint types which have basic structural differences.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1988