EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 5 of 5

Diagonal points having dense orbit

T. K. Subrahmonian Moothathu (2010)

Colloquium Mathematicae

Let f: X→ X be a topologically transitive continuous map of a compact metric space X. We investigate whether f can have the following stronger properties: (i) for each m ∈ ℕ, $f \times f ² \times \dots \times f^{m} : X^{m} \to X^{m}$ is transitive, (ii) for each m ∈ ℕ, there exists x ∈ X such that the diagonal m-tuple (x,x,...,x) has a dense orbit in $X^{m}$ under the action of $f \times f ² \times \dots \times f^{m}$ . We show that (i), (ii) and weak mixing are equivalent for minimal homeomorphisms, that all mixing interval maps satisfy (ii), and that there are mixing subshifts not satisfying (ii)....

Distal actions and ergodic actions on compact groups.

Raja, C.Robinson Edward (2009)

The New York Journal of Mathematics [electronic only]

Distributional chaos for flows

Yunhua Zhou (2013)

Czechoslovak Mathematical Journal

Schweizer and Smítal introduced the distributional chaos for continuous maps of the interval in B. Schweizer, J. Smítal, Measures of chaos and a spectral decomposition of dynamical systems on the interval. Trans. Amer. Math. Soc. 344 (1994), 737–854. In this paper, we discuss the distributional chaos DC1–DC3 for flows on compact metric spaces. We prove that both the distributional chaos DC1 and DC2 of a flow are equivalent to the time-1 maps and so some properties of DC1 and DC2 for discrete systems...

Dynamical characterization of C-sets and its application

Jian Li (2012)

Fundamenta Mathematicae

We set up a general correspondence between algebraic properties of βℕ and sets defined by dynamical properties. In particular, we obtain a dynamical characterization of C-sets, i.e., sets satisfying the strong Central Sets Theorem. As an application, we show that Rado systems are solvable in C-sets.

Dynamical properties of the automorphism groups of the random poset and random distributive lattice

Alexander S. Kechris, Miodrag Sokić (2012)

Fundamenta Mathematicae

A method is developed for proving non-amenability of certain automorphism groups of countable structures and is used to show that the automorphism groups of the random poset and random distributive lattice are not amenable. The universal minimal flow of the automorphism group of the random distributive lattice is computed as a canonical space of linear orderings but it is also shown that the class of finite distributive lattices does not admit hereditary order expansions with the Amalgamation Property....

Currently displaying 1 – 5 of 5

Page 1