A characterization of adding machine maps

Let f :X→X be a continuous map of a compact metric space to itself. We prove that f is topologically conjugate to an adding machine map if and only if X is an infinite minimal set for f and each point of X is regularly recurrent. Moreover, if X is an infinite minimal set for f and one point of X is regularly recurrent, then f is semiconjugate to an adding machine map.     

Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

基于粗糙集理论的知识约简及应用实例

在保持分类能力不变的前提下 ,通过利用粗糙集理论中的知识约简方法 ,在保护知识库分类不变的条件下 ,删除其中不相关或不重要的知识 ,从而导出问题的决策 .利用基于决策表的粗糙集模型算法 ,实例分析如何数字化表示决策表 ,并对其进行属性约简和属性值的约简 ,从而提取决策规则 .     

DISTRIBUTIONS OF LIMIT CYCLES FOR POLYNOMIAL VECTOR FIELDS (P_2, Q_3)

The distributions of limit cycles of cubic vector fields (P2, Q3) are considered in this paper, where P2 and Q3 are polynomials of x and y of order two and three, respectively. It is possibly seven different distributions of limit cycles given in [1]. We now prove that in which three kinds of distributions are impossible and other four kinds all can be realized by concrete vector fields of (P2,Q3). Some related results are also given.     

Mean value in invexity analysis

In this paper, a generalization of the mean value theorem is considered in the case of functions defined on an invex set with respect to η (which is not necessarily connected).     

On rank-perfect subclasses of near-bipartite graphs

Shepherd95 proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler2004. We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004. Received: November 2004 / Revised version: June 2005     

Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

GLOBAL ATTRACTOR OF A SPATIALLY DISCRETIZED REACTION-DIFFUSION SYSTEM WITH HAMILTONIAN STRUCTURE

１ＨａｍｉｌｔｏｎｉａｎＳｔｒｕｃｔｕｒｅｉｎＲｅａｃｔｉｏｎ－ＤｉｆｕｓｉｏｎｓｙｓｔｅｍＣｏｎｓｉｄｅｒａｓｙｓｔｅｍｏｆｒｅａｃｔｉｏｎ－ｄｉｆｕｓｉｏｎｅｑｕａｔｉｏｎｓｕｔ＝ｕｘｘ＋ｆ（ｕ，ｖ）ｖｔ＝ｖｘｘ＋ｇ（ｕ，ｖ）｛（１．１）ｗｈｅｒ...     

非线性控制系统的最小实现

对于那些由代数微分方程描述的具有输入输出关系的非线性控制系统，本文采用两种方法讨论了其最小实现问题：一种方法是直接计算系统的特征列；另一种方法则采用了本原元定理．两种方法给出的最小实现所需的状态变量最小数目是相等的．文中的大量代数与微分运算则可利用数学机械化来完成     

A Fixed Point Theorem for Multi—valued Composite Increasing Operators

Ａ　Ｆｉｘｅｄ　Ｐｏｉｎｔ　Ｔｈｅｏｒｅｍ　ｆｏｒ　Ｍｕｌｔｉ－ｖａｌｕｅｄ　Ｃｏｍｐｏｓｉｔｅ　Ｉｎｃｒｅａｓｉｎｇ　ＯｐｅｒａｔｏｒｓＬｉＦｅｎｇｙｏｕ（李凤友）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｔｉａｎｊｉｎ＇ＮｏｒｍａｌＵｎｉ...