渐近一致复杂性与顺从性
Asymptotic uniform complexity and amenability
摘要:
我们为一般动力系统引入了一个新的量,我们称之为渐近一致复杂度。证明了一个将动力系统的渐近一致复杂性与其平均拓扑匹配数联系起来的不等式。此外,我们证明了所建立的不等式产生一个精确的方程的完美Hausdorff动力系统。利用这些结果,我们得出的结论是,一个动力系统是顺从的,如果它的渐近一致复杂性等于1,而相反的是正确的完美的Hausdorff动力系统,如非离散Hausdorff拓扑群作用于自己。此外,我们还利用一个相似不变量建立了完备Hausdorff一致空间上拓扑自由动力系统的顺从性的一个刻画.进一步,我们给出了准紧伪度量空间的Lipschitz-自同构群在熵维数下的顺从性的一个充分判据。最后,我们证明了消失的拓扑熵意味着渐近一致复杂性等于1。
英文摘要:
We introduce a novel quantity for general dynamical systems, which we call the asymptotic uniform complexity. We prove an inequality relating the asymptotic uniform complexity of a dynamical system to its mean topological matching number. Furthermore, we show that the established inequality yields an exact equation for perfect Hausdorff dynamical systems. Utilizing these results, we conclude that a dynamical system is amenable if its asymptotic uniform complexity equals one, and that the converse is true for perfect Hausdorff dynamical systems, such as non-discrete Hausdorff topological groups acting on themselves. Moreover, we establish a characterization of amenability for topologically free dynamical systems on perfect Hausdorff uniform spaces by means of a similar invariant. Furthermore, we provide a sufficient criterion for amenability concerning groups of Lipschitz-automorphisms of precompact pseudo-metric spaces in terms of entropic dimension. Finally, we show that vanishing topological entropy implies the asymptotic uniform complexity to equal one.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。