Mixing homeomorphisms and indecomposability (Q1710634)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Mixing homeomorphisms and indecomposability
scientific article

    Statements

    Mixing homeomorphisms and indecomposability (English)
    0 references
    23 January 2019
    0 references
    The main results of this paper are: Theorem 2.2. Let \(X\) be an \(n\)-cyclic continuum. If there exists a mixing homeomorphism \(h:X\to X\), then \(X\) must be \(\frac{1}{n+2}\)-indecomposable. Theorem 2.9. Let \(X\) be a \(G\)-like continuum where \(G\) is a graph with \(m\geq0\) cycles. If \(h:X\to X\) is a mixing homeomorphism, then \(X\) must be indecomposable. Example (Section 3). There exists a mixing homeomorphism on a hereditarily decomposable tree-like continuum. In their Introduction the authors provide some motivation and historical background related to their research. A few definitions might help the reader gain some context relative to their results: Definition. A map \(f:X\to X\) of a continuum \(X\) is called mixing if for every pair \((U,V)\) of nonempty open subsets of \(X\), there exists a positive integer \(N\) such that \(f^n(U)\cap V\neq\emptyset\) for all \(n\geq N\). Definition. Given a positive integer \(n\), a continuum is \(\frac{1}{n}\)-indecomposable if whenever \(\mathcal{A}\) is a pairwise disjoint nonempty collection of nonempty proper (note that the word ``proper'' was inadvertently omitted in the paper) subcontinua whose cardinality is \(n\), then at least one element of \(\mathcal{A}\) has empty interior. Definition. A continuum is called \(n\)-cyclic, \(n\) a positive integer, if for all \(\epsilon>0\), there is an open cover with mesh \(<\epsilon\) and whose nerve has at most \(n\) simple closed curves.
    0 references
    continuum
    0 references
    \(n\)-cyclic continuum
    0 references
    indecomposable
    0 references
    \(\frac{1}{n}\)-indecomposable
    0 references
    mixing homeomorphism
    0 references
    \(G\)-like continuum
    0 references
    unicoherent
    0 references

    Identifiers