Topological complexity

被引:88
|
作者
Blanchard, F
Host, B
Maass, A
机构
[1] CNRS, IML, F-13288 Marseille 09, France
[2] Univ Marne la Vallee, Equipe Anal & Math Appl, F-77454 Marne la Vallee, France
[3] Univ Chile, Dept Ingn Matemat, Santiago, Chile
关键词
D O I
10.1017/S0143385700000341
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In a topological dynamical system (X, T) the complexity function of a cover C is the minimal cardinality of a sub-cover of V-i(n)=0 T-iC. It is Shown that equicontinuous transformations are exactly those such that any open cover has bounded complexity. Call scattering a system such that any finite cover by non-dense open sets has unbounded complexity, and call 2-scattering a system such that any such 2-set cover has unbounded complexity: then all weakly mixing systems are scattering and all 2-scattering systems are totally transitive. Conversely, any system that is not 2-scattering has covers with complexity at most n + 1. Scattering systems are characterized topologically as those such that their cartesian product with any minimal system is transitive; they are consequently disjoint from all minimal distal systems. Finally, defining (x, y), x not equal y, to be a complexity pair if any cover by two non-trivial closed sets separating x from y has unbounded complexity, we prove that 2-scattering systems are disjoint from minimal isometries; that in the invertible case the complexity relation is contained in the regionally proximal relation and, when further assuming minimality, coincides with it up to the diagonal.
引用
收藏
页码:641 / 662
页数:22
相关论文
共 50 条
  • [1] A study of the Ganea conjecture for topological complexity by using weak topological complexity
    Garcia-calcines, J. M.
    Vandembroucq, L.
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2024, 177 (02) : 241 - 261
  • [2] Invariant topological complexity
    Lubawski, Wojciech
    Marzantowicz, Waclaw
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2015, 47 : 101 - 117
  • [3] ON THE COMPLEXITY OF TOPOLOGICAL SORTING
    TODA, S
    INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 229 - 233
  • [4] Loop topological complexity
    Derfoufi, Younes
    Mamouni, My Ismail
    BULLETIN OF COMPUTATIONAL APPLIED MATHEMATICS, 2015, 3 (02): : 31 - 36
  • [5] Equivariant topological complexity
    Colman, Hellen
    Grant, Mark
    ALGEBRAIC AND GEOMETRIC TOPOLOGY, 2012, 12 (04): : 2299 - 2316
  • [6] Directed topological complexity
    Goubault E.
    Farber M.
    Sagnier A.
    Journal of Applied and Computational Topology, 2020, 4 (1) : 11 - 27
  • [7] Symmetrized topological complexity
    Grant, Mark
    JOURNAL OF TOPOLOGY AND ANALYSIS, 2019, 11 (02) : 387 - 403
  • [8] On the growth of topological complexity
    Kishimoto D.
    Yamaguchi A.
    Journal of Applied and Computational Topology, 2020, 4 (4) : 525 - 532
  • [9] DISCRETE TOPOLOGICAL COMPLEXITY
    Fernandez-Ternero, D.
    Macias-Virgos, E.
    Minuz, E.
    Vilches, J. A.
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2018, 146 (10) : 4535 - 4548
  • [10] Effectual topological complexity
    Cadavid-Aguilar, Nataliay
    Gonzalez, Jesus
    Gutierrez, Barbara
    Ipanaque-Zapata, Cesar A.
    JOURNAL OF TOPOLOGY AND ANALYSIS, 2024, 16 (01) : 53 - 70