共轭可交换性及其在集合形式单调类定理中的应用

引入了集列的极限运算与二元集运算之间的共轭可交换性的概念,讨论了常见的和重要的集列的极限运算与集代数运算之间所具有的共轭可交换性质,在一般的情形下证明了共轭可交换性是集类的极限运算生成类对集代数运算具有封闭性的一个充分条件,使得集合形式的单调类定理的理论得到了统一的解释,并且证明更简单,思路更清晰,最后还给出了一个新的集合形式的单调类定理.     

Vague集上模糊熵的几点注记

V ague集上的不确定性度量有两种途径,一种是度量V ague集是模糊集的程度,一种是度量V ague集具有的模糊性的程度。后者将模糊集的模糊熵作为特例。本文基于“投票模型”分析了V ague集的熵应具有的特征,对国内作者提出的V ague集上的模糊熵进行了评述。     

6元素集合上T0拓扑总数的计算

文中证明了有限预序集与有限偏序集的一些性质,并基于有限集上的拓扑和其上预序的一一对应关系,利用这些性质通过对极小元和极大元个数进行分类讨论,以一种有别于计算机算法而又容易理解的计算方法得出6元素集合上的T₀拓扑总数为130023.     

Vague集的截集及其分解定理

从Fuzzy集的基本理论出发,提出了Fuzzy集的扩展形式—vague集的截集定义和分解定理,进一步表明了Fuzzy集和vague集的相同的本质,丰富了vague集的理论体系,以期拓宽vague集的应用领域.     

On essential sets and essential components of efficient solutions for vector optimization problems

In this paper, we first introduce the notions of an essential set and an essential component of the set of efficient solutions for continuous vector optimizations on a nonempty compact subset of a metric space. Then we show that for each of these vector optimizations, each set of all efficient solutions corresponding to the same optimal values is essential. Basing on this result, we give full characterizations of an essential point, an essential set and an essential component, respectively. As an application, we prove that for continuous quasiconvex vector optimization problems on a nonempty compact subset of a metric vector space, each component of the set of efficient solutions is essential even though the efficient solution set is not connected.     

一种反向集值鞅型序列的收敛性

本文研究了在非空有界闭凸集的上鞅收敛性和有界闭凸集的适应可积集值序列的收敛性.引入了反向集值mil的基础上,得到了收敛性定理及定理证明.     

Reconstructing orthogonal polyhedra from putative vertex sets

In this paper we study the problem of reconstructing orthogonal polyhedra from a putative vertex set, i.e., we are given a set of points and want to find an orthogonal polyhedron for which this is the set of vertices. This is well-studied in 2D; we mostly focus on 3D, and on the case where the given set of points may be rotated beforehand. We obtain fast algorithms for reconstruction in the case where the answer must be orthogonally convex.     

Structure of stability and asymptotic stability sets of families of linear differential systems with parameter multiplying the derivative: II

We consider families of linear differential systems depending on a real parameter that occurs only as a factor multiplying the matrix of the system. The asymptotic stability set of such a family is defined as the set of all parameter values for which the corresponding systems in the family are asymptotically stable. We prove that a set on the real axis is the asymptotic stability set of such a family if and only if it is an F _σδ -set lying entirely on an open ray with origin at zero. In addition, for any set of this kind, the coefficient matrix of a family whose asymptotic stability set coincides with this set can be chosen to be infinitely differentiable and uniformly bounded on the time half-line.     

Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization

In this paper, we show how a nonlinear scalarization functional can be used in order to characterize several well-known set order relations and which thus plays a key role in set optimization. By means of this functional, we derive characterizations for minimal elements of set-valued optimization problems using a set approach. Our methods do not rely on any convexity assumptions on the considered sets. Furthermore, we develop a derivative-free descent method for set optimization problems without convexity assumptions to verify the usefulness of our results.     

关于球面上的Lagrange插值

1引 言 单位球面上的插值问题一直是三元插值问题中比较受关注的部分.近年来,球面上的 Lagrange插值问题已经得到了很好地解决.例如[1]中给出了构造单位球面上的Lagrange 插值适定结点组的一种方法：添加圆周法.[2]和[3]中研究了单位球面上的多项式插值问题,给出了构造单位球面上的插值适定结点组的另外两种方法.     

随机次自相似集的表示

本文引进了随机次自相似集与随机推移集的概念,讨论了随机次自相似集的结构,并证明了任一随机集是随机次自相似集的充分必要条件是：该随机集可以表为某一个随机推移集的某个像集。     

Lambda-rings of automorphisms

Under composition, the set of automorphisms of a single algebra forms a group. The topic of this paper is the full set of all automorphisms of all algebra structures in a given abstract class on a fixed finite set. A lambda-ring, known as the automorphism type ring, is associated with this full set of automorphisms, and its structure is described. For certain classes (such as the variety of lattices), the full set of automorphisms is represented up to conjugation in the symmetric group by the automorphisms of a single, so-called representative algebra. In this case, the automorphism type ring is a subring of the ring of class functions on the automorphism group of the representative algebra.     

On Weierstrass semigroups and sets: a review with new results

In this work we present a survey of the main results in the theory of Weierstrass semigroups at several points, with special attention to the determination of bounds for the cardinality of its set of gaps. We also review results on applications to the theory of error correcting codes. We then recall a generalization of the concept of Weierstrass semigroup, which is the Weierstrass set associated to a linear system and several points. We finish by presenting new results on this Weierstrass set, including some on the cardinality of its set of gaps.      

L-预拓扑空间中模糊网的O-收敛及其应用

利用L-点的邻域研究了L-预拓扑空间中模糊网的O-收敛性,在此基础上刻画了L-预拓扑空间中的闭集、开集以及模糊紧集,并给出T2L-预拓扑空间的两个判据。     

A transfer algorithm for hierarchical clustering

Transfer algorithms are usually used to optimize an objective function that is defined on the set of partitions of a finite set X. In this paper we define an equivalence relation ? on the set of fuzzy equivalence relations on X and establish a bijection from the set of hierarchies on X to the set of equivalence classes with respect to ?. Thus, hierarchies can be identified with fuzzy equivalence relations and the transfer algorithm can be modified in order to optimize an objective function that is defined on the set of hierarchies on X.     

Computability of Self-Similar Sets

We investigate computability of a self-similar set on a Euclidean space. A nonempty compact subset of a Euclidean space is called a self-similar set if it equals to the union of the images of itself by some set of contractions. The main result in this paper is that if all of the contractions are computable, then the self-similar set is a recursive compact set. A further result on the case that the self-similar set forms a curve is also discussed.     

On procedures for constructing solutions in differential games on a finite interval of time

Many problems of conflict-control theory can be reduced to approach-avoidance games with a certain terminal set. One of the main approaches to solution of such problems is the approach suggested by N. N. Krasovskii, which is based on positional constructions. The basis of these constructions consists of the extremal aiming principle at stable bridges. In this connection, the problem of constructing the maximal stable bridge, the set of all positions from which the problem of approaching the terminal set (which is the main task of one of the problem) is solvable, is important. The paper considers the approach-avoidance game on a finite interval of time in which the first player must ensure the attainment by the state vector of the control system of the terminal set on this interval, and the second player must ensure the avoidance of the terminal set. The main subject of the study is the maximal stable bridge, which is the set of positional consumption in this game. The problem of exactly constructing the set of positional consumption is solvable only in simple cases, and it is more realistic to consider and solve the problem of approximate construction of this set. The paper proposes approaches to approximate construction of the set of positional consumption based on sampling the time interval of the game and the technique of backward constructions, which has been developed at the scientific school of N. N. Krasovskii since the 1980s. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 23, Optimal Control, 2005.     

An Equivalent Theorem on Connectedness of the Weakly Cone-Efficient Sets

利用连通集上有关上半连续点集映射的连通性质，本文证明了拓扑向量空间中向量最优化问题的弱锥－有效解集与相应目标空间中的弱锥－有效点集连通性之间的一个等价定理．     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

The existence of a near-unanimity function is decidable

We prove that the following problem is decidable: given a finite set of relations on a finite set, decide whether this set admits a near-unanimity function. The proof is based on the upper bound on the minimal arity of a near-unanimity function admitted by a set of relations. Also, we give examples that show that the upper bound cannot be significantly improved.