Omega-limit sets and invariant chaos in dimension one

Omega-limit sets play an important role in one-dimensional dynamics. During last fifty year at least three definitions of basic set has appeared. Authors often use results with different definition. Here we fill in the gap of missing proof of equivalency of these definitions. Using results on basic sets we generalize results in paper [P. Oprocha, Invariant scrambled sets and distributional chaos, Dyn. Syst. 24 (2009), no. 1, 31–43.] to the case continuous maps of finite graphs. The Li-Yorke chaos is weaker than positive topological entropy. The equivalency arises when we add condition of invariance to Li-Yorke scrambled set. In this note we show that for a continuous graph map properties positive topological entropy; horseshoe; invariant Li-Yorke scrambled set; uniform invariant distributional chaotic scrambled set and distributionaly chaotic pair are mutually equivalent.     

Li and Yorke chaos with respect to the cardinality of the scrambled sets

In the present paper we study Li and Yorke chaos on several spaces in connection with the cardinality of its scrambled sets. We prove that there is a map on a Cantor set and a map on a two-dimensional arcwise connected continuum (with empty interior) such that each scrambled set contains exactly two points.     

几乎周期性与SS混沌集

引进正则移位不变集的概念,证明了有正则移位不变集的紧致系统在几乎周期点集中存在SS混沌集,特别地,具有正拓扑熵的区间映射在几乎周期点集中存在SS混沌集.     

A note on the map with the whole space being a scrambled set

In this paper we prove that there is no compact system with the whole space being a Schweizer–Smital scrambled set and the Huang–Ye homeomorphism [W. Huang, X.D. Ye, Homeomorphisms with the whole compacta being scrambled sets, Ergod. Theory & Dynam. Systems 21 (2001) 77–91] has no Schweizer–Smital pair. Moreover, we present a simple noncompact system whose Schweizer–Smital scrambled set can be the whole space.     

基于区间数度量的区间值模糊集合的贴近度和模糊度的关系

给出了基于区间数度量的区间值模糊集合的贴近度和模糊度的概念,详细研究了区间值模糊集合的贴近度和模糊度之间的关系,并基于公理化定义,证明了它们二者之间的相互转化关系,最后,给出了若干公式来计算区间值模糊集合的贴近度和模糊度。     

Topological entropy for discontinuous semiflows

We study two variations of Bowen's definitions of topological entropy based on separated and spanning sets which can be applied to the study of discontinuous semiflows on compact metric spaces. We prove that these definitions reduce to Bowen's ones in the case of continuous semiflows. As a second result, we prove that our entropies give a lower bound for the τ-entropy defined by Alves, Carvalho and Vásquez (2015). Finally, we prove that for impulsive semiflows satisfying certain regularity condition, there exists a continuous semiflow defined on another compact metric space which is related to the first one by a semiconjugation, and whose topological entropy equals our extended notion of topological entropy by using separated sets for the original semiflow.     

集值条件期望的一个Fatou型引理

本文讨论了Ｂａｎａｃｈ空间只订合序列弱收敛的一些性质，给出了集值条件期望的表示定量，证明了集值条件期望在弱收敛意义下的Ｆａｔｏｕ型引理和控制收敛定理，并由此得到了一个可积选择空间的收敛定理。     

Omega limit sets and distributional chaos on graphs

We give a full topological characterization of omega limit sets of continuous maps on graphs and we show that basic sets have similar properties as in the case of the compact interval. We also prove that the presence of distributional chaos, the existence of basic sets, and positive topological entropy (among other properties) are mutually equivalent for continuous graph maps.     

基于区间数度量的区间值模糊集合的归一化距离、相似度、模糊度和包含度的关系研究

区间值模糊集合的距离、相似度、模糊度和包含度及其关系研究是区间值模糊集合的一个研究热点.考虑到区间值模糊集合所表示信息的丰富性,本文使用区间数而非实数来刻画区间值模糊集合的距离,首先给出基于区间数度量的区间值模糊集合的归一化距离的公理化定义,然后通过五个定理详细研究了基于公理化定义的区间值模糊集合的归一化距离、相似度、模糊度和包含度之间的相互转换关系,最后,给出了若干公式来计算基于区间数度量的区间值模糊集合的相似度、模糊度和包含度.这些结论,一方面丰富了区间值模糊集合的信息测度(距离、相似度、模糊度和包含度)的内容,另一方面也为区间值模糊集合的近似推理、决策分析、模式识别等领域的应用提供了新方法和新理论.     

Chaotic sets of continuous and discontinuous maps

This paper discusses Li-Yorke chaotic sets of continuous and discontinuous maps with particular emphasis to shift and subshift maps. Scrambled sets and maximal scrambled sets are introduced to characterize Li-Yorke chaotic sets. The orbit invariant for a scrambled set is discussed. Some properties about maximality, equivalence and uniqueness of maximal scrambled sets are also discussed. It is shown that for shift maps the set of all scrambled pairs has full measure and chaotic sets of some discontinuous maps, such as the Gauss map, interval exchange transformations, and a class of planar piecewise isometries, are studied. Finally, some open problems on scrambled sets are listed and remarked.     

β-变换下攀援集和distal集的测度性质

设β1为实数,T_β为[0,1]的β变换.攀援集的任何两个点随着时间的转移会越来越接近但同时又总能在任意长时间后保持一定的距离.证明了在Lebesgue测度意义下关于T_β的攀援集是一个零测集.Distal点对的两个点表示随着时间的转移始终保持着一定的距离.如果固定其中一个点x_0,所有满足x∈[0,1)且lim inf n→∞|T_β~n(x)-T_β~n(x_0)|0的点称为关于x_0的distal集,如果把这个集合记为R_β(x_0),根据Borel-Cantelli引理得到R_β(x_0)的Lebesgue测度为零.     

The Spectrum of Completely Positive Entropy Actions of Countable Amenable Groups

We prove that an ergodic free action of a countable discrete amenable group with completely positive entropy has a countable Lebesgue spectrum. Our approach is based on the Rudolph-Weiss result on the equality of conditional entropies for actions of countable amenable groups with the same orbits. Relative completely positive entropy actions are also considered. An application to the entropic properties of Gaussian actions of countable discrete abelian groups is given.     

粗糙模糊集的模糊性度量

研究粗糙模糊集的模糊性度量,提出了一种新的熵与条件熵的概念,并验证了这种熵与Shannon熵类似的性质。利用这种熵定义了粗糙模糊集的一种不确定性度量,证明了粗糙模糊集的模糊性度量FR（A）等于0的充分必要条件是A是经典集合且是可定义的。     

On the description of self-similarity for attractors by means of conditional entropy

There exist several sets having similar structure on arbitrarily small scales. Mandelbrot called such sets fractals, and defined a dimension that assigns non-integer numbers to fractals. On the other hand, a dynamical system yielding a fractal set referred to as a strange attractor is a chaotic map. In this paper, a characterization of self-similarity for attractors is attempted by means of conditional entropy.     

The disintegration of the Lebesgue measure on the faces of a convex function

We consider the disintegration of the Lebesgue measure on the graph of a convex function f:Rn→R w.r.t. the partition into its faces, which are convex sets and therefore have a well defined linear dimension, and we prove that each conditional measure is equivalent to the k-dimensional Hausdorff measure on the k-dimensional face on which it is concentrated. The remarkable fact is that a priori the directions of the faces are just Borel and no Lipschitz regularity is known. Notwithstanding that, we also prove that a Green-Gauss formula for these directions holds on special sets.     

Canonical representation of conditionally specified multivariate discrete distributions

Most work on conditionally specified distributions has focused on approaches that operate on the probability space, and the constraints on the probability space often make the study of their properties challenging. We propose decomposing both the joint and conditional discrete distributions into characterizing sets of canonical interactions, and we prove that certain interactions of a joint distribution are shared with its conditional distributions. This invariance opens the door for checking the compatibility between conditional distributions involving the same set of variables. We formulate necessary and sufficient conditions for the existence and uniqueness of discrete conditional models, and we show how a joint distribution can be easily computed from the pool of interactions collected from the conditional distributions. Hence, the methods can be used to calculate the exact distribution of a Gibbs sampler. Furthermore, issues such as how near compatibility can be reconciled are also discussed. Using mixed parametrization, we show that the proposed approach is based on the canonical parameters, while the conventional approaches are based on the mean parameters. Our advantage is partly due to the invariance that holds only for the canonical parameters.     

A weakly mixing dynamical system with the whole space being a transitive extremal distributionally scrambled set

It is known that the whole space can be a Li–Yorke scrambled set in a compact dynamical system, but this does not hold for distributional chaos. In this paper we construct a noncompact weekly mixing dynamical system, and prove that the whole space is a transitive extremal distributionally scrambled set in this system.     

Topological dynamics of the Weil-Petersson geodesic flow

We prove topological transitivity for the Weil-Petersson geodesic flow for real two-dimensional moduli spaces of hyperbolic structures. Our proof follows a new approach that combines the density of singular unit tangent vectors, the geometry of cusps and convexity properties of negative curvature. We also show that the Weil-Petersson geodesic flow has: horseshoes, invariant sets with positive topological entropy, and that there are infinitely many hyperbolic closed geodesics, whose number grows exponentially in length. Furthermore, we note that the volume entropy is infinite.     

Distributionally scrambled set and minimal set

We investigate the relation between distributional chaos and minimal sets, and discuss how to obtain various distributionally scrambled sets by using least and simplest minimal sets. We show: i) an uncountable extremal distributionally scrambled set can appear in a system with just one simple minimal set: a periodic orbit with period 2; ii) an uncountable dense invariant distributionally scrambled set can occur in a system with just two minimal sets: a fixed point and an infinite minimal set; iii) infinitely many minimal sets are necessary to generate a uniform invariant distributionally scrambled set, and an uncountable dense extremal invariant distributionally scrambled set can be constructed by using just countably infinitely many periodic orbits.     

Matching preclusion and conditional matching preclusion for regular interconnection networks

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and neither perfect matchings nor almost-perfect matchings. In this paper, we prove general results regarding the matching preclusion number and the conditional matching preclusion number as well as the classification of their respective optimal sets for regular graphs. We then use these general results to study the problems for Cayley graphs generated by 2-trees and the hyper Petersen networks.