Topological Structure of Non-wandering Set of a Graph Map

Let G be a graph （i.e., a finite one-dimensional polyhedron） and f ： G → G be a continuous map. In this paper, we show that every isolated recurrent point of f is an isolated non-wandering point; every accumulation point of the set of non-wandering points of f with infinite orbit is a two-order accumulation point of the set of recurrent points of f; the derived set of an ω-limit set of f is equal to the derived set of an the set of recurrent points of f; and the two-order derived set of non-wandering set of f is equal to the two-order derived set of the set of recurrent points of f.     

On Trees with Double Domination Number Equal to the 2-Outer-Independent Domination Number Plus One

A vertex of a graph is said to dominate itself and all of its neighbors.A double dominating set of a graph G is a set D of vertices of G,such that every vertex of G is dominated by at least two vertices of D.The double domination number of a graph G is the minimum cardinality of a double dominating set of G.For a graph G =(V,E),a subset D V(G) is a 2-dominating set if every vertex of V(G) \ D has at least two neighbors in D,while it is a 2-outer-independent dominating set of G if additionally the set V(G)\D is independent.The 2-outer-independent domination number of G is the minimum cardinality of a 2-outer-independent dominating set of G.This paper characterizes all trees with the double domination number equal to the 2-outer-independent domination number plus one.     

集合$\tau$-标准部分的闭性

In this paper,the closeness of the τ-standard part of a set is discussed.Some related propositions of the τ-neighborhood system of a set are given.And then some related conclusions of the τ-monad of a set and the τ-standard part of a set are presented.And based on it,the necessary and sufficient conditions of the enlarged model and the saturated model are showed.Finally,some sufficient conditions that the τ-standard part of a set is closed are proved in the enlarged model and the saturated model.     

The Closeness of the τ-Standard Part of a Set

In this paper,the closeness of the τ-standard part of a set is discussed.Some related propositions of the τ-neighborhood system of a set are given.And then some related conclusions of the τ-monad of a set and the τ-standard part of a set are presented.And based on it,the necessary and sufficient conditions of the enlarged model and the saturated model are showed.Finally,some sufficient conditions that the τ-standard part of a set is closed are proved in the enlarged model and the saturated model.     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.     

On the Ratio Between 2-Domination and Total Outer-Independent Domination Numbers of Trees

A 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D.A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D,and the set V(G)\D is independent.The 2-domination(total outer-independent domination,respectively)number of a graph G is the minimum cardinality of a 2-dominating(total outer-independent dominating,respectively)set of G.We investigate the ratio between2-domination and total outer-independent domination numbers of trees.     

A Biordered Set Representation of Regular Semigroups

In this paper, for an arbitrary regular biordered set E, by using biorder-isomorphisms between the w-ideals of E, we construct a fundamental regular semigroup WE called NH-semigroup of E, whose idempotent biordered set is isomorphic to E. We prove further that WE can be used to give a new representation of general regular semigroups in the sense that, for any regular semigroup S with the idempotent biordered set isomorphic to E, there exists a homomorphism from S to WE whose kernel is the greatest idempotent-separating congruence on S and the image is a full symmetric subsemigroup of WE. Moreover, when E is a biordered set of a semilattice Eo, WE is isomorphic to the Munn-semigroup TEo; and when E is the biordered set of a band B, WE is isomorphic to the Hall-semigroup WB.     

Constructive characterizations of (γp,γ)- and (γp,γpr)-trees

Let G = (V,E) be a graph without isolated vertices.A set S V is a domination set of G if every vertex in V - S is adjacent to a vertex in S,that is N[S] = V.The domination number of G,denoted by γ(G),is the minimum cardinality of a domination set of G.A set S C V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S] has a perfect matching.The paired-domination number,denoted by γpr(G),is defined to be the minimum cardinality of a paired-domination set S in G.A subset S V is a power domination set of G if all vertices of V can be observed recursively by the following rules: (i) all vertices in N[S] are observed initially,and (ii) if an observed vertex u has all neighbors observed except one neighbor v,then v is observed (by u).The power domination number,denoted by γp(G),is the minimum cardinality of a power domination set of G.In this paper,the constructive characterizations for trees with γp = γ and γpr = γp are provided respectively.     

Constructive characterizations of （γp, γ）- and （γp, γpr）-trees

Let G =(V,E) be a graph without isolated vertices.A set S  V is a domination set of G if every vertex in V -S is adjacent to a vertex in S,that is N[S] = V .The domination number of G,denoted by γ(G),is the minimum cardinality of a domination set of G.A set S  V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S]has a perfect matching.The paired-domination number,denoted by γpr(G),is defined to be the minimum cardinality of a paired-domination set S in G.A subset S  V is a power domination set of G if all vertices of V can be observed recursively by the following rules:(i) all vertices in N[S] are observed initially,and(ii) if an observed vertex u has all neighbors observed except one neighbor v,then v is observed(by u).The power domination number,denoted by γp(G),is the minimum cardinality of a power domination set of G.In this paper,the constructive characterizations for trees with γp = γ and γpr = γp are provided respectively.     

Tchebyshev Approximation by S01（△） over Some Special Triangulations

The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.     

Tchebyshev Approximation by S~0_1(△) over Some Special Triangulations

The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.     

一些特殊三角剖分上分片线性样条的最佳逼近问题

The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.     

Constructive characterizations of （γp, γ）- and （γp, γpr）-trees

Let G = （V, E） be a graph without isolated vertices. A set S lohtain in V is a domination set of G if every vertex in V - S is adjacent to a vertex in S, that is N[S] = V. The domination number of G, denoted by γ（G）, is the minimum cardinality of a domination set of G. A set S lohtain in V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S] has a perfect matching. The paired-domination number, denoted by γpr（G）, is defined to be the minimum cardinality of a paired-domination set S in G. A subset S lohtain in V is a power domination set of G if all vertices of V can be observed recursively by the following rules： （i） all vertices in N[S] are observed initially, and （ii） if an observed vertex u has all neighbors observed except one neighbor v, then v is observed （by u）. The power domination number, denoted by γp（G）, is the minimum cardinality of a power domination set of G. In this paper, the constructive characterizations for trees with γp=γ and γpr = γp are provided respectively.     

A NEW FRAMEWORK OF PRIMAL-DUAL INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR PROGRAMMING*

On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear programming, we propose a new framework of primal-dual infeasible interiorpoint method for linear programming problems. Without the strict convexity of the logarithmic barrier function, we get the following results: (a) if the homotopy parameterμcan not reach to zero,then the feasible set of these programming problems is empty; (b) if the strictly feasible set is nonempty and the solution set is bounded, then for any initial point x, we can obtain a solution of the problems by this method; (c) if the strictly feasible set is nonempty and the solution set is unbounded, then for any initial point x, we can obtain a (?)-solution; and(d) if the strictly feasible set is nonempty and the solution set is empty, then we can get the curve x(μ), which towards to the generalized solutions.     

AN ERGODIC THEOREM FOR GENERALIZED SIMPLE EXCLUSION PROCESSES WITH REVERSIBLE POSITIVE TRANSITION

Simple exclusion procosses are important infinite particle systems. This model was proposed by Spitzer (1)and studied extensively by Spitzer and Liggett (2). On the basis of the model, Yan Shi-jian and Chen Mu-fa proposed generalized exclusion processes and obtained the construction of the processes. Zheng Wen-qu obtained a necessary and sufficient condition of the reversibility and proved that the set of the reversible probability measures of such a process is equal to the set of it's Gibbs states (3). This paper is devoted to the ergodic theory of a generalized simple exclusion proess with the state space {0, 1, …, m} (m≥1, S is a countable set) and a reversible positive recurrent transition probability matrix P=(p(x, y))_(x,y)∈s Refering (4), the set of it's invariant probability measures is described and the ergodic properties of the process is obtained. We also prove that the set of it's reversible probability measures coinsides with the set of it's invariant probability measures. So the main re     

Influence Diagnostics in Partially Varying-Coefficient Models

When a real-world data set is fitted to a specific type of models,it is often encountered that oneor a set of observations have undue influence on the model fitting,which may lead to misleading conclusions.Therefore,it is necessary for data analysts to identify these influential observations and assess their impacton various aspects of model fitting.In this paper,one type of modified Cook's distances is defined to gaugethe influence of one or a set observations on the estimate of the constant coefficient part in partially varying-coefficient models,and the Cook's distances are expressed as functions of the corresponding residuals andleverages.Meanwhile,a bootstrap procedure is suggested to derive the reference values for the proposed Cook'sdistances.Some simulations are conducted,and a real-world data set is further analyzed to examine theperformance of the proposed method.The experimental results are satisfactory.     

0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM

A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Links of the same feature have the same cost. It is proved that the problem of finding ?routing tree of the minimum cost for a given set of tasks of two features is NP-complete.     

On the properties of some sets of von Neumann algebras under perturbation

Let L be a type II1 factor with separable predual and τ be a normal faithful tracial state of L. We first show that the set of subfactors of L with property Γ, the set of type II1 subfactors of L with similarity property and the set of all Mc Duff subfactors of L are open and closed in the Hausdorff metric d2 induced by the trace norm; then we show that the set of all hyperfinite von Neumann subalgebras of L is closed in d2. We also consider the connection of perturbation of operator algebras under d2 with the fundamental group and the generator problem of type II1 factors. When M is a finite von Neumann algebra with a normal faithful trace,the set of all von Neumann subalgebras B of M such that B  M is rigid is closed in the Hausdorff metric d2.