On non-normal arc-transitive 4-valent dihedrants

Let X be a connected non-normal 4-valent arc-transitive Cayley graph on a dihedral group Dn such that X is bipartite, with the two bipartition sets being the two orbits of the cyclic subgroup within Dn. It is shown that X is isomorphic either to the lexicographic product Cn[2K1] with n 〉 4 even, or to one of the five sporadic graphs on 10, 14, 26, 28 and 30 vertices, respectively.     

算子空间上的左乘映射

Let X be a separable infinite dimensional Banach space and B(X) denote its operator algebra,the algebra of all bounded linear operators T : X → X.Define a left multiplication mapping LT : B(X) → B(X) by LT (V ) = T V,V ∈ B(X).We investigate the connections between hypercyclic and chaotic behaviors of the left multiplication mapping LT on B(X) and that of operator T on X.We obtain that LT is SOT-hypercyclic if and only if T satisfies the Hypercyclicity Criterion.If we define chaos on B(X) as SOT-hypercyclicity plus SOT-dense subset of periodic points,we also get that LT is chaotic if and only if T is chaotic in the sense of Devaney.     

Product Cocycles and the Approximate Transitivity

Some criteria of the approximate transitivity in the terms of Mackey actions and product cocycles are proved. The Mackey action constructed by an amenable type II or III transformation group G and a 1-cocycle × , where is the Radon–Nikodym cocycle while is an arbitrary 1-cocycle with values in a locally compact separable group A, is approximately transitive (AT) if and only if the pair (G,(, )) is weakly equivalent to a product odometer supplied with a product cocycle. Besides, in the case when the given AT action from the very beginning was a range of a type II action and a nontransient cocycle, then this cocycle turns out to be cohomologous to a -product cocycle. An example is constructed that shows that it is necessary to consider the double Mackey actions since they can not be reduced to the single ones.     

Projectivity, transitivity and AF-telescopes

Continuing our study of projective -algebras, we establish a projective transitivity theorem generalizing the classical Glimm-Kadison result. This leads to a short proof of Glimm's theorem that every -algebra not of type I contains a -subalgebra which has the Fermion algebra as a quotient. Moreover, we are able to identify this subalgebra as a generalized mapping telescope over the Fermion algebra. We next prove what we call the multiplier realization theorem. This is a technical result, relating projective subalgebras of a multiplier algebra to subalgebras of , whenever is a -subalgebra of the corona algebra . We developed this to obtain a closure theorem for projective -algebras, but it has other consequences, one of which is that if is an extension of an MF (matricial field) algebra (in the sense of Blackadar and Kirchberg) by a projective -algebra, then is MF. The last part of the paper contains a proof of the projectivity of the mapping telescope over any AF (inductive limit of finite-dimensional) -algebra. Translated to generators, this says that in some cases it is possible to lift an infinite sequence of elements, satisfying infinitely many relations, from a quotient of any -algebra.

     

Analytic combinatory calculi and the elimination of transitivity

We introduce, in a general setting, an analytic version of standard equational calculi of combinatory logic. Analyticity lies on the one side in the fact that these calculi are characterized by the presence of combinatory introduction rules in place of combinatory axioms, and on the other side in that the transitivity rule proves to be eliminable. Apart from consistency, which follows immediately, we discuss other almost direct consequences of analyticity and the main transitivity elimination theorem; in particular the Church–Rosser and the leftmostreduction theorems for the associated notions of reduction. The last two sections deal with analytic combinatory calculi with the extensionality rule added. Here, as far as the elimination of transitivity is concerned, we have only partial results, which unfortunately do not cover, at present, full CL + Ext. Yet, they are sufficient to prove the decidability of weaker combinatory calculi with extensionality, including e.g. BCK + Ext.Mathematics Subject Classification (2000):03B40, 03F03, 03F07     

群与图及相关课题的研究

本综述了把群与图综合起来进行研究的一些工作,简述了与之相关的一些课题,并提出了有待解决的一些问题。     

Ordering fuzzy sets over the real line: An approach based on decision making under uncertainty

The ordering of fuzzy sets over the real line is approached from the point of view of ordering intervals rather than ordering numbers. First, the maximax and maximin criteria which are commonly used for ordering intervals are expressed in terms of characteristic functions. These criteria and the Hurwicz criterion for decision making under complete ignorance are then reformulated in a manner that allows for their generalization to the fuzzy case. Transitivity is established for these ordering rules. A criterion based on the principle of diminishing marginal utility is also presented.     

非一致扩张映射上的d 跟踪性质

本文主要证明了具有$d(\underline {d}$或$\bar{d}$-跟踪性质的非一致扩张系统是拓扑传递的.     

A note on transitivity,sensitivity and chaos for graph maps

Two elementary proofs showing that (i) transitivity and sensitivity imply dense periodicity for maps on topological graphs and (ii) total transitivity and dense periodicity imply mixing for maps on spaces with an open subset homeomorphic with the open interval (0,1) are presented. As corollaries, one gets new and simple proofs that Auslander–Yorke chaos implies Devaney chaos, and weak mixing implies mixing for graph maps.