A combinatorial proof of the extension property for partial isometries
We present a short and self-contained proof of the extension property for partial isometries of the class of all finite metric spaces.
We present a short and self-contained proof of the extension property for partial isometries of the class of all finite metric spaces.
Let be a field, and the set of monomials of . It is well known that the set of monomial ideals of is in a bijective correspondence with the set of all subsemiflows of the -semiflow . We generalize this to the case of term ideals of , where is a commutative Noetherian ring. A term ideal of is an ideal of generated by a family of terms , where and are integers .
Giordano et al. (2010) showed that every minimal free -action of a Cantor space X is orbit equivalent to some ℤ-action. Trying to avoid the K-theory used there and modifying Forrest’s (2000) construction of a Bratteli diagram, we show how to define a (one-dimensional) continuous and injective map F on X∖one point such that for a residual subset of X the orbits of F are the same as the orbits of a given minimal free -action.
The centralizer of a semisimple isometric extension of a minimal flow is described.
In the paper a new proof of Lemma 11 in the above-mentioned paper is given. Its original proof was based on Theorem 3 which has been shown to be incorrect.
The main goal of this paper is the investigation of a relevant property which appears in the various definition of deterministic topological chaos for discrete time dynamical system: transitivity. Starting from the standard Devaney's notion of topological chaos based on regularity, transitivity, and sensitivity to the initial conditions, the critique formulated by Knudsen is taken into account in order to exclude periodic chaos from this definition. Transitivity (or some stronger versions of it)...
Moore [Fund. Math. 220 (2013)] characterizes the amenability of the automorphism groups of countable ultrahomogeneous structures by a Ramsey-type property. We extend this result to the automorphism groups of metric Fraïssé structures, which encompass all Polish groups. As an application, we prove that amenability is a condition.
We prove that every linear-activity automaton group is amenable. The proof is based on showing that a random walk on a specially constructed degree 1 automaton group – the mother group – has asymptotic entropy 0. Our result answers an open question by Nekrashevych in the Kourovka notebook, and gives a partial answer to a question of Sidki.
Nilsequences arose in the study of the multiple ergodic averages associated to Furstenberg’s proof of Szemerédi’s Theorem and have since played a role in problems in additive combinatorics. Nilsequences are a generalization of almost periodic sequences and we study which portions of the classical theory for almost periodic sequences can be generalized for two step nilsequences. We state and prove basic properties for two step nilsequences and give a classification scheme for them.
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 ∈ ℕ, is transitive, (ii) for each m ∈ ℕ, there exists x ∈ X such that the diagonal m-tuple (x,x,...,x) has a dense orbit in under the action of . 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)....
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...
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.
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....
A quasi-factor of a minimal flow is a minimal subset of the induced flow on the space of closed subsets. We study a particular kind of quasi-factor (a 'joining' quasi-factor) using the Galois theory of minimal flows. We also investigate the relation between factors and quasi-factors.
A distality property for pseudogroups and foliations is defined. Distal foliated bundles satisfying some growth conditions are shown to have zero geometric entropy in the sense of É. Ghys, R. Langevin and P. Walczak [Acta Math. 160 (1988)].
We consider the notions of equicontinuity point, sensitivity point and so on from a topological point of view. Many of these notions can be sensibly defined either in terms of (finite) open covers or uniformities. We show that for the notions of equicontinuity point and sensitivity point, Hausdorff or uniform versions coincide in compact Hausdorff spaces and are equivalent to the standard definitions stated in terms of a metric in compact metric spaces. We prove that a uniformly chain transitive...