|
|||||
|
|
|
|
|
|
|
|
|
Minimal sets of a
recurrent discrete flow
Hattab Hawete |
|
Vol. 250 (2011), No. 2, 335–337
|
Abstract |
|
S. G. Dani, giving a counterexample to a result in a paper of Knight, showed that recurrent transitive flows can admit multiple minimal sets. Here we show that such a phenomenon occurs on a wider scale. |
Keywords
minimal set, discrete flow, uniformly rigid, weakly mixing
|
Mathematical Subject Classification 2010
Primary: 54H20
|
Milestones
Received: 19 February 2010
Revised: 14 June 2010
Accepted: 9 September 2010
Published: 31 March 2011
|
Authors |
| Hattab Hawete | |
| Institut Supérieur d’Informatique et
du Multimedia Route de Tunis Km 10 B.P. 242 Sfax 3021 Tunisia |
|
|
