直觉模糊度量空间上的半群作用

讨论在直觉模糊度量空间上的拓扑半群作用,引入诸如拓扑传递性,点传递性及点稠传递性等概念.考虑非敏感性与传递性,等度连续等动力学性质的相互关系.     

二元关系的传递性和传递闭包探讨

探讨了二元关系传递性的判定和传递闭包的计算及其教学的有关问题 ,提出了中途点的概念 ,得到传递性在乘幂运算下的不变性 ,以及简化了计算传递闭包的算法 .     

T-functions revisited: new criteria for bijectivity/transitivity

The paper presents new criteria for bijectivity/transitivity of T-functions and a fast knapsack-like algorithm of evaluation of a T-function. Our approach is based on non-Archimedean ergodic theory: Both the criteria and algorithm use van der Put series to represent 1-Lipschitz p-adic functions and to study measure-preservation/ergodicity of these.     

Hereditarily hypercyclic operators and mixing

We show that hereditary transitivity (respectively strongly hereditary transitivity) is equivalent to weak mixing (respectively strong mixing) in a discrete dynamical system with Polish phase space. We also study the connection between local orbit structure and hypercyclicity, and obtain a “local hypercyclicity criterion.”     

On a class of totally topologically transitive skew products defined on cells in ℝ n,n ≥ 2

Mathematical Notes - We obtain sufficient conditions for total topological transitivity (transitivity of all iterations) for a class of C 3 skew products defined on cells in ? n , n ≥ 2.     

Transitive Limit Closures of Convex Dynamical Systems

Convex dynamical systems are iterated set-valued maps with convex graphs. The closed union of all finite powers of a given convex relation will be called its limit closure. We address the question of transitivity of limit closures and establish a sufficient condition for such transitivity (limit transitivity). We also present examples showing that the limit closure of a general compact convex system is not necessarily transitive. limit closure can be intransitive as well. It is also shown that the restriction of a linear single-valued map to a convex set containing an open neighborhood of the origin is always limit transitive.     

General results on the decomposition of transitive fuzzy relations

We study the transitivity of fuzzy preference relations, often considered as a fundamental property providing coherence to a decision process. We consider the transitivity of fuzzy relations w.r.t. conjunctors, a general class of binary operations on the unit interval encompassing the class of triangular norms usually considered for this purpose. Having fixed the transitivity of a large preference relation w.r.t. such a conjunctor, we investigate the transitivity of the strict preference and indifference relations of any fuzzy preference structure generated from this large preference relation by means of an (indifference) generator. This study leads to the discovery of two families of conjunctors providing a full characterization of this transitivity. Although the expressions of these conjunctors appear to be quite cumbersome, they reduce to more readily used analytical expressions when we focus our attention on the particular case when the transitivity of the large preference relation is expressed w.r.t. one of the three basic triangular norms (the minimum, the product and the Łukasiewicz triangular norm) while at the same time the generator used for decomposing this large preference relation is also one of these triangular norms. During our discourse, we pay ample attention to the Frank family of triangular norms/copulas.     

二级传递性与二级传递模糊矩阵

推广传递性概念,给出二级传递性的定义;研究二级传递模糊矩阵的性质,给出其若干等价刻画;证明二级传递模糊矩阵或者收敛或者周期为2,指数不大于n 1;讨论二级传递与强传递、k-传递和泛传递等概念之间的关系,指出二级传递是传递性概念的一种新的推广形式。     

Fuzzy processing in transitivity development

We review the literature on the development of transitive reasoning, and note three historical stages. Stage 1 was dominated by the Piagetian idea that transitive inference is logical reasoning in which relationships between adjacent terms figure as premises. Stage 2 was dominated by the information-processing view that memory for relationships between adjacent terms is determinative in transitivity performance. Stage 3 has produced data that are inconsistent with both the logic and memery positions, leading to a new theory that is designed to account for such findings, fuzzy-trace theory. The basic assumption of fuzzytrace theory is that reasoners rely on global patterns, or gist. We describe the tenets of fuzzytrace theory, and explore its implications for different theoretical conceptions of logical competence, concluding that young children possess transitivity competence. We discuss the connection between transitivity competence (cognition) and intransitive preferences (metacognition).     

On homeomorphisms with the two-sided limit shadowing property

We prove that the two-sided limit shadowing property is among the strongest known notions of pseudo-orbit tracing. It implies shadowing, average shadowing, asymptotic average shadowing and specification properties. We also introduce a weaker notion that is called two-sided limit shadowing with a gap and prove that it implies shadowing and transitivity. We show that those two properties allow to characterize topological transitivity and mixing in a class of expansive homeomorphisms and hence they characterize transitive (mixing) shifts of finite type.     

Several transitive properties and Devaney’s chaos

The relation among transitivity, indecomposability and Z-transitivity is discussed. It is shown that for a non-wandering system (each point is non-wandering), indecomposability is equivalent to transitivity, and for the dynamical systems without isolated points, Z-transitivity and transitivity are equivalent. Besides, a new transitive level as weak transitivity is introduced and some equivalent conditions of Devaney's chaos are given by weak transitivity. Moreover, it is proved that both d-shadowing property and d-shadowing property imply weak transitivity.     

Transitivities of maps of general topological spaces

In this paper we investigate orbit-transitivity, strong orbit-transitivity, ω-transitivity and open-set-transitivity of maps of general topological spaces. The relation between these transitivities is studied. We discuss various topological spaces, containing pseudo-regular spaces, partially completable spaces, and topological spaces without quasi-isolated points. Several conditions on spaces and on continuity for one transitivity to imply another transitivity are given.     

Diskcyclicity of Sets of Operators and Applications

In this paper, we introduce and study the diskcyclicity and disk transitivity of a set of operators. We establish a diskcyclicity criterion and give the relationship between this criterion and the diskcyclicity. As applications, we study the diskcyclicty of C₀-semigroups and C-regularized groups. We show that a diskcyclic C₀-semigroup exists on a complex topological vector space X if and only if dim(X)=1 or dim(X)=∞ and we prove that diskcyclicity and disk transitivity of C₀-semigroups (resp C-regularized groups) are equivalent.     

Locally uniformly rotund points in convex-transitive Banach spaces

Almost transitive superreflexive Banach spaces have been considered in [C. Finet, Uniform convexity properties of norms on superreflexive Banach spaces, Israel J. Math. 53 (1986) 81–92], where it is shown that they are uniformly convex and uniformly smooth. We characterize such spaces as those convex transitive Banach spaces satisfying conditions much weaker than that of uniform convexity (for example, that of having a weakly locally uniformly rotund point). We note that, in general, the property of convex transitivity for a Banach space is weaker than that of almost transitivity.     

超空间与原空间动力系统之间的关系

设(X,d,f)为拓扑动力系统,其中X为局部紧可分的可度量化空间,d为紧型度量,f为完备映射,用2X表示由X的所有非空闭子集构成的集族,(2X,ρ,2f)为由(X,d,f)所诱导的赋予hit-or-miss拓扑的超空间动力系统.本文引入了余紧点传递和弱拓扑传递的定义.特别的,在X满足一定的条件时,给出了点传递,弱拓扑传递和余紧点传递之间的关系,并研究了(X,d,f)的余紧传递点,回复点和几乎周期点分别与(2X,ρ,2f)的传递点,回复点和几乎周期点之间的蕴含关系.这些结论丰富了赋予hit-or-miss拓扑的超空间的研究内容.     

Pointwise universality of partial sums of Fourier series by generalized Walsh system

We consider the problems of pointwise universality and topological transitivity of partial sums of Fourier series by the generalizedWalsh system.     

Representing the strengths and directions of pairwise comparisons

We consider the problem of finding weights that well represent a set of pairwise multiplicative comparisons of a set of objects (as in the AHP and other methods). Our main contribution is a method for deriving such weights that takes into consideration not only the strengths of the pairwise comparisons, but also their directions. For example, if the comparison directions satisfy transitivity, then the weights produced by our method also satisfy transitivity (this is not always true for other methods). We also present a set of reasonable axioms for which our method is the (essentially) unique solution. Our method and axioms are closely related to those of Cook and Kress [Eur. J. Oper. Res. 37 (1988) 335]. Our method, like theirs, reduces to solving a linear program (hence it is different from the approach used in the AHP). For the special case that the comparison directions satisfy transitivity, our method is quite simple and reduces to performing a forward pass as in the critical path method.     

模糊k-强传递阵

推广强传递阵 ,给出 k-强传递阵的概念 ,讨论它的等价刻画、与截阵性质一致问题 ,证明文献中几种传递性概念与强传递的等价性 ,丰富了模糊矩阵传递性的研究内容。     

Behavior in Repeated Prisoner's Dilemma Games with Shifted Outcomes Analyzed with a Statistical Learning Model

A fuzzy set theoretical framework is proposed for the analysis of sociometric structure characterized by vagueness of liking between individuals and a person's relative degree of belonging to a social group. Max‐min transitivity of a fuzzy relation is employed as a basic concept to examine the degree of liking and clustering in group structures. A distance model based on min‐max transitivity is also formulated as a special case of transitivity analysis. Other notions of transitivity such as the max‐product and the max‐* are also discussed. An empirical analysis is performed to examine the applicability of the proposed transitivity concepts. It appears that the current methodological construct provides a more appropriate perspective in the analysis of the group structure properties.     

A generalized quadrangle of order (s, t) with center of transitivity is an elation quadrangle if s ≤ t

We show that a generalized quadrangle of order (s, t) with a center of transitivity is an elation generalized quadrangle if s ≤ t. In order to obtain this result, we generalize Frohardt’s result on Kantor’s conjecture from elation quadrangles to the more general case of quadrangles with a center of transitivity.