An extension of building sets and relative difference sets

Building sets are a successful tool for constructing semi‐regular divisible difference sets and, in particular, semi‐regular relative difference sets. In this paper, we present an extension theorem for building sets under simple conditions. Some of the semi‐regular relative difference sets obtained using the extension theorem are new in the sense that their ambient groups have smaller ranks than previously known. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 50–57, 2000     

有限域上多项式集的简单分解

研究如何将任意有限域上的多项式集分解为有限多个简单列.为了解决这一问题,首先研究简单列和根理想之间的关系,然后基于已有的正则分解算法和有限域上理想的根的两种计算方法设计一个有限域上多项式集的简单分解算法.计算试验表明,文章给出的算法是有效的.     

On the exact Hausdorff measure of a class of self-similar sets satisfying open set condition

In this paper,we provide a new effective method for computing the exact value of Hausdorff measures of a class of self-similar sets satisfying the open set condition(OSC).As applications,we discuss a self-similar Cantor set satisfying OSC and give a simple method for computing its exact Hausdorff measure.     

Effectively and Noneffectively Nowhere Simple Sets

R. Shore proved that every recursively enumerable (r. e.) set can be split into two (disjoint) nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice ? of all r. e. sets. Nowhere simple sets were further studied by D. Miller and J. Remmel, and we generalize some of their results. We characterize r. e. sets which can be split into two (non) effectively nowhere simple sets, and r. e. sets which can be split into two r. e. non-nowhere simple sets. We show that every r. e. set is either the disjoint union of two effectively nowhere simple sets or two noneffectively nowhere simple sets. We characterize r. e. sets whose every nontrivial splitting is into nowhere simple sets, and r. e. sets whose every nontrivial splitting is into effectively nowhere simple sets. R. Shore proved that for every effectively nowhere simple set A, the lattice L* (A) is effectively isomorphic to ?*, and that there is a nowhere simple set A such that L*(A) is not effectively isomorphic to ?*. We prove that every nonzero r. e. Turing degree contains a noneffectively nowhere simple set A with the lattice L*(A) effectively isomorphic to ?*. Mathematics Subject Classification: 03D25, 03D10.     

正实数维分形集的构造方法

给出了测量一类分形集维数的简单方法. 根据这种测量方法, 可以构造出任意实数维分形集,并且分形集可以不是自相似的.     

LS sets as cohesive subsets of graphs and hypergraphs

For social scientists, a ‘clique’ has long been seen as a subset of a population whose members are more tightly linked to other members of the subset than they are to non-members. Similar ideas have arisen in clustering theory. Most approaches to the problem of defining such subsets have concentrated either on maximizing the number of intra-subset ties or minimizing the number of inter-subset ties. LS sets in graphs or hypergraphs provide a way of addressing simultaneously both intra-subset ties and inter-subset ties. A new characterization of LS sets is given and used to derive simple proofs of several important results on LS sets.     

模糊集单调型分解定理

模糊集的分解集定理有两种形式，第一种形式与模糊集的λ—截集有关：Ａ＝其中Ａ＿λ是的λ—截集￣［１］．第二种形式与集合套有关：其中Ｈ（λ）为集合套￣［２］或者Ａ＝其中Ｈ（λ）为集合套，Ｑ为（０，１）的可列稠密子集＿［３］，．其实，这两种形式在本文提出的基本模糊集的概念下，可以统一起来成为任何模糊集可以分解为一些（可数或不可数）基本模糊集的和。不仅如此，本文还提出简单模糊集的概念，并证明了任何模糊集都可以表示成为可数个单调上升的简单模糊集的和，或等价地，可以表示成可数个单调上升的简单模糊集的极限，所用的证明方法是构造性的，所以对模糊集的结构也得出了一个清晰的认识．     

一种新的集合序列收敛性

本我们引进了无穷维Ｂａｎａｃｈ空间中的一种新的集合序列收敛性概念,讨论了它与其它收敛性概念的关系。另外,我们还研究了集合序列根限的Ｍｉｎｋｏｗｓｋｉ和。     

盒维数的一个等价定义及其应用

给出了盒维数的一个等价定义．该定义与盒维数的现有定义相比,从理论上更容易验证,在应用中更适合于数值计算．据此给出了计算盒维数的一个数值算法．     

Distributionally scrambled set and minimal set

We investigate the relation between distributional chaos and minimal sets, and discuss how to obtain various distributionally scrambled sets by using least and simplest minimal sets. We show: i) an uncountable extremal distributionally scrambled set can appear in a system with just one simple minimal set: a periodic orbit with period 2; ii) an uncountable dense invariant distributionally scrambled set can occur in a system with just two minimal sets: a fixed point and an infinite minimal set; iii) infinitely many minimal sets are necessary to generate a uniform invariant distributionally scrambled set, and an uncountable dense extremal invariant distributionally scrambled set can be constructed by using just countably infinitely many periodic orbits.     

控制系统中的分形

本文将整数维与分形的Hausdorff测度引入并应用于控制系统,同时也介绍了准自相似集这个新概念,证明了这种集合的存在性与唯一性.并将计算自相似集维数的公式推广到准自相似集,在此基础上,说明了控制系统的可达集可以具有分数维.表明在分析非线性系统可控性与可观性时,分形几何学也将是一种有意义的工具.     

故障树计算的一种新方法

本文提出的顶事件发生概率的算法不借助割集，直接采用自顶向下的技术对故障树进行分割求解。该算法的时间和内存耗用与故障树的节点数目没有必然联系，而仅仅取决于故障树中不同的重复事件的个数。     

On decompositions of continuity via idealization

We have introduced α-I-open, semi-I-open and β-I-open sets via idealization and using these sets obtained new decompositions of continuity. This revised version was published online in June 2006 with corrections to the Cover Date.     

Application of fuzzy soft set in decision making problems based on grey theory

There are many uncertain problems in practical production and life which need decisions made with soft sets and fuzzy soft sets. However, the basis of evaluation of the decision method is single and simple, the same decision problem can obtain different results from using a different evaluation basis. In this paper, in order to obtain the right result, we discuss fuzzy soft set decision problems. A new algorithm based on grey relational analysis is presented. The evaluation bases of the new algorithm are multiple. There is more information in a decision result based on multiple evaluation bases, which is more easily accepted and logical to one’s thinking. For the two cases examined, the results show that the new algorithm is efficient for solving decision problems.     

Convex-cone-based comparisons of and difference evaluations for fuzzy sets

Abstract

This paper focuses on how to compare two fuzzy sets and, from the viewpoint of set optimization, proposes eight types of fuzzy-set relations based on a convex cone as new comparison criteria of fuzzy sets. Then, difference evaluation functions for fuzzy sets are introduced. Under suitable assumptions of certain compactness and stability of fuzzy sets, we show that these functions correspond well to the fuzzy-set relations. In addition, through transforming these functions stepwise, we deal with numerical calculation methods of them in particular cases. Consequently, we can judge whether each fuzzy-set relation holds or not for given two fuzzy sets with the aid of computers.     

Linear sets on the projective line with complementary weights

Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is, with two points for which the sum of their weights equals the rank of the linear set. As a special case, we study those linear sets having exactly two points of weight greater than one, by showing new examples and studying their equivalence issue. Also, we determine some linearized polynomials defining the linear sets recently introduced by Jena and Van de Voorde [30].     

On πgs-closed sets in topological spaces

Summary A new class of sets called πgs-closed sets is introduced and its properties are studied. Moreover the notions of πgs-T_1/2 spaces and πgs-continuity are introduced.     

Computability of measurable sets via effective metrics

We consider how to represent the measurable sets in an infinite measure space. We use sequences of simple measurable sets converging under metrics to represent general measurable sets. Then we study the computability of the measure and the set operators of measurable sets with respect to such representations. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Topology vs generalized rough sets

This paper investigates the relationship between topology and generalized rough sets induced by binary relations. Some known results regarding the relation based rough sets are reviewed, and some new results are given. Particularly, the relationship between different topologies corresponding to the same rough set model is examined. These generalized rough sets are induced by inverse serial relations, reflexive relations and pre-order relations, respectively. We point that inverse serial relations are weakest relations which can induce topological spaces, and that different relation based generalized rough set models will induce different topological spaces. We proved that two known topologies corresponding to reflexive relation based rough set model given recently are different, and gave a condition under which the both are the same topology.     

Discrete unbounded sets in a finite dimensional space and beyond

Discrete infinite sets in a finite dimensional space, i.e., infinite sets without finite limit points appear in various branches of analysis (zero and pole sets of meromorphic functions, various models in the mathematical theory of quasicrystals, and so on). Here we introduce some notions and present some new theorems connected with such sets.