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.     

Fundamental Gaps in Numerical Semigroups with Respect to Their Multiplicity

For a numerical semigroup, we introduce the concept of a fundamental gap with respect to the multiplicity of the semigroup. The semigroup is fully determined by its multiplicity and these gaps.We study the case when a set of non-negative integers is the set of fundamental gaps with respect to the multiplicity of a numerical semigroup, Numerical semigroups with maximum and minimum number of this kind of gaps are described.     

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     

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.     

Fundamental Gaps in Numerical Semigroups with Respect to Their Multiplicity

For a numerical semigroup, we introduce the concept of a fundamental gap with respect tothe multiplicity of the semigroup.The semigroup is fully determined by its multiplicity and these gaps.We study the case when a set of non-negative integers is the set of fundamental gaps with respect to themultiplicity of a numerical semigroup.Numerical semigroups with maximum and mininmm number ofthis kind of gaps are described.     

Positively expansive differentiable maps

We study the space of positively expansive differentiable maps of a compact connected C ∞ Riemannian manifold without boundary. It is proved that （i） the C1-interior of the set of positively expansive differentiable maps coincides with the set of expanding maps, and （ii） Cl-generically, a differentiable map is positively expansive if and only if it is expanding.     

GENERALIZED FUZZY FILTERS OF BL-ALGEBRAS

The concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set is considered.In fact,this is a generalization of quasi-coincidence of a fuzzy point With a fuzzy set.By using this new idea,the notion of interval valued(∈,∈∨q)-fuzzy filters in BL-algebras which is a generalization of fuzzy filters of BL-algebras,is defined,and related properties are investigated.In particular,the concept of a fuzzy subgroup with thresholds is extended to the concept of an interval valued fuzzy filter with thresholds in BL-algebras.     

A FRACTIONAL NONLINEAR EVOLUTIONARY DELAY SYSTEM DRIVEN BY A HEMI-VARIATIONAL INEQUALITY IN BANACH SPACES

This article deals with a new fractional nonlinear delay evolution system driven by a hemi-variational inequality in a Banach space.Utilizing the KKM theorem,a result concerned with the upper semicontinuity and measurability of the solution set of a hemivariational inequality is established.By using a fixed point theorem for a condensing setvalued map,the nonemptiness and compactness of the set of mild solutions are also obtained for such a system under mild conditions.Finally,an example is presented to illustrate our main results.     

Wavefronts of a Nonlocal State-dependent Time Delay Model

This paper is concerned with the travelling wavefronts of a nonlocal dispersal cooperation model with harvesting and state-dependent delay,which is assumed to be an increasing function of the population density with lower and upper bound.Especially,state-dependent delay is introduced into a nonlocal reaction-diffusion model.The conditions of Schauder's fixed point theorem are proved by constructing a reasonable set of functionsΓ(see Section 2)and a pair of upper-lower solutions,so the existence of traveling wavefronts is established.The present study is continuation of a previous work that highlights the Laplacian diffusion.     

A property of Pisot numbers and Fourier transforms of self-similar measures

For any Pisot number β it is known that the set F (β)={t:lim n→∞‖tβ n‖= 0} is countable,where a is the distance between a real number a and the set of integers.In this paper it is proved that every member in this set is of the form cβ n,where ‖n‖ is a nonnegative integer and c is determined by a linear system of equations.Furthermore,for some self-similar measures μ associated with β,the limit at infinity of the Fourier transforms lim n→∞μ(tβ n)≠0 if and only if t is in a certain subset of F (β).This generalizes a similar result of Huang and Strichartz.     

Being a Proper Trapezoid Ordered Set Is a Comparability Invariant

It is proved that if we replace an autonomous subset of a finite proper trapezoid ordered set with a proper trapezoid ordered set, then we obtain a proper trapezoid ordered set provided the autonomous subset is not an antichain, and analogously in the k-dimensional case. As corollaries we obtain that being a proper trapezoid ordered set is a comparability invariant, more generally, proper interval dimension is a comparability invariant.     

Computing a Minimum Weight Triangulation of a Sparse Point Set*

Investigating the minimum weight triangulation of a point set with constraint is an important approach for seeking the ultimate solution of the minimum weight triangulation problem. In this paper, we consider the minimum weight triangulation of a sparse point set, and present an O(n ⁴) algorithm to compute a triangulation of such a set. The property of sparse point set can be converted into a new sufficient condition for finding subgraphs of the minimum weight triangulation. A special point set is exhibited to show that our new subgraph of minimum weight triangulation cannot be found by any currently known methods.     

The union of a Riesz set and a Lust-Piquard set is a Riesz set

We prove that the union of a Riesz set and a Lust-Piquard set is a Riesz set. This gives as corollaries known results of Y. Katznelson, R.E. Dressler-L. Pigno, and D. Li. Moreover, we give an example of a Rosenthal set which is dense in Z for the Bohr topology.     

The semireactive bargaining set of a cooperative game

The semireactive bargaining set, a solution for cooperative games, is introduced. This solution is in general a subsolution of the bargaining set and a supersolution of the reactive bargaining set. However, on various classes of transferable utility games the semireactive and the reactive bargaining set coincide. The semireactive prebargaining set on TU games can be axiomatized by one-person rationality, the reduced game property, a weak version of the converse reduced game property with respect to subgrand coalitions, and subgrand stability. Furthermore, it is shown that there is a suitable weakening of subgrand stability, which allows to characterize the prebargaining set. Replacing the reduced game by the imputation saving reduced game and employing individual rationality as an additional axiom yields characterizations of both, the bargaining set and the semireactive bargaining set. Received September 2000/Revised version June 2001     

Intersecting a simple mixed integer set with a vertex packing set

We consider a mixed integer set that results from the intersection of a simple mixed integer set with a vertex packing set from a conflict graph. This set arises as a relaxation of the feasible set of mixed integer problems such as inventory routing problems. We derive families of strong valid inequalities that consider the structures of the simple mixed integer set and the vertex packing set simultaneously.     

On the stability of inner and outer approximations of a convex compact set by a ball

The finite-dimensional problems of outer and inner estimation of a convex compact set by a ball of some norm (circumscribed and inscribed ball problems) are considered. The stability of the solution with respect to the error in the specification of the estimated compact set is generally characterized. A new solution criterion for the outer estimation problem is obtained that relates the latter to the inner estimation problem for the lower Lebesgue set of the distance function to the most distant point of the estimated compact set. A quantitative estimate for the stability of the center of an inscribed ball is given under the additional assumption that the compact set is strongly convex. Assuming that the used norm is strongly quasi-convex, a quantitative stability estimate is obtained for the center of a circumscribed ball.     

Inverses and pseudo-inverses of a strong endomorphism of a graph

In this paper, we explicitly describe all the inverses and pseudo-inverses of a strong endomorphism of a graph. The number of them is determined. In addition, we give a characterization of a strong endomorphism whose pseudo-inverse set coincides with its inverse set. The graph, each strong endomorphism of which has this property, is also investigated.     

On a Fix-and-Relax Framework for a Class of Project Scheduling Problems

We consider the following problem: Given a set of projects to be executed along a multi-year time horizon, find a sequencing and scheduling feasible solution that optimizes a merit function. A feasible solution should satisfy availability of storable and non-storable resources with budget carrier and non-carrier periods, and precedence, exclusivity and implication relationships among the projects. This is an NP-hard problem. We present several Fix-and-Relax strategies which partition the set of binary variable into clusters in order to selectively explore the branch-and-bound tree. Computational performance is favorably compared with a state-of-the-art optimization engine over a set of real-life cases.     

Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph

In this paper a mixed integer set resulting from the intersection of a single constrained mixed 0–1 set with the vertex packing set is investigated. This set arises as a subproblem of more general mixed integer problems such as inventory routing and facility location problems. Families of strong valid inequalities that take into account the structure of the simple mixed integer set and that of the vertex packing set simultaneously are introduced. In particular, the well-known mixed integer rounding inequality is generalized to the case where incompatibilities between binary variables are present. Exact and heuristic algorithms are designed to solve the separation problems associated to the proposed valid inequalities. Preliminary computational experiments show that these inequalities can be useful to reduce the integrality gaps and to solve integer programming problems.