Weak Covering at Large Cardinals

We show that weakly compact cardinals are the smallest large cardinals k where k⁺ < k⁺ is impossible provided 0^# does not exist. We also show that if k^+Kc < k⁺ for some k being weakly compact (where K^c is the countably complete core model below one strong cardinal), then there is a transitive set M with M ? ZFC + “there is a strong cardinal”.     

Signature invariants of covering links

We apply the theory of signature invariants of links in rational homology spheres to covering links of homology boundary links. From patterns and Seifert matrices of homology boundary links, we derive an explicit formula to compute signature invariants of their covering links. Using the formula, we produce fused boundary links that are positive mutants of ribbon links but are not concordant to boundary links. We also show that for any finite collection of patterns, there are homology boundary links that are not concordant to any homology boundary links admitting a pattern in the collection.

     

On the stability of tangent bundle on double coverings

Let Y be a smooth projective surface defined over an algebraically closed field k with char k≠2, and let π : X →Y be a double covering branched along a smooth divisor. We show that y_X is stable with respect to π~*H if the tangent bundle y_Y is semi-stable with respect to some ample line bundle H on Y.     

On the general expression of Fredholm Integral Equations Method in elasticity

In this paper, the concept of covering domain is introduced to develop a general expression for the Fredholm Integral Equations Method, by which elasticity problems of arbitrarily shaped bodies loaded by external forces can be solved. Some special expressions are given for a body with non-zero remote stresses, or subjected to some concentrated forces on its boundary. The relationship between the loading forces and solutions are also discussed. Some analytical solutions can be obtained for simple cases. When numerical computations are needed for the solution, the method proves to have high precision and fast convergency.     

A new infinite family of minimally nonideal matrices

Minimally nonideal matrices are a key to understanding when the set covering problem can be solved using linear programming. The complete classification of minimally nonideal matrices is an open problem. One of the most important results on these matrices comes from a theorem of Lehman, which gives a property of the core of a minimally nonideal matrix. Cornuéjols and Novick gave a conjecture on the possible cores of minimally nonideal matrices. This paper disproves their conjecture by constructing a new infinite family of square minimally nonideal matrices. In particular, we show that there exists a minimally nonideal matrix with r ones in each row and column for any r?3.     

The minmax regret gradual covering location problem on a network with incomplete information of demand weights

The gradual covering location problem seeks to establish facilities on a network so as to maximize the total demand covered, allowing partial coverage. We focus on the gradual covering location problem when the demand weights associated with nodes of the network are random variables whose probability distributions are unknown. Using only information on the range of these random variables, this study is aimed at finding the “minmax regret” location that minimizes the worst-case coverage loss. We show that under some conditions, the problem is equivalent to known location problems (e.g. the minmax regret median problem). Polynomial time algorithms are developed for the problem on a general network with linear coverage decay functions.     

有关拓扑学与覆盖粗糙集的一些结论

引入了拓扑覆盖的概念,并结合最小描述元对有限论域上的拓扑覆盖加于研究,得出了拓扑覆盖的最简覆盖和基与最小描述元之间的关系.介绍了在基于有限论域U上的覆盖,构造U上的一个拓扑的方法.并且在最小描述元的基础上将划分下的粗糙隶属函数推广至一般覆盖下的粗糙隶属函数,而后介绍了其相关运用.     

Generalized covering designs and clique coverings

Inspired by the “generalized t‐designs” defined by Cameron [P. J. Cameron, Discrete Math 309 (2009), 4835–4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both covering designs and covering arrays. We then obtain a number of bounds on the minimum sizes of these designs, and describe some methods of constructing them, which in some cases we prove are optimal. Many of our results are obtained from an interpretation of these designs in terms of clique coverings of graphs. © 2011 Wiley Periodicals, Inc. J Combin Designs 19:378‐406, 2011     

覆盖近似空间的连续与同胚映射

利用一般映射研究了覆盖近似空间的一些性质,并证明了一些结论.接着定义了覆盖空间的粗糙连续映射及粗糙同胚映射.最后在覆盖粗糙连续映射和覆盖粗糙同胚映射的条件下,研究了两个覆盖近似空间的有关性质,进而在某种程度上为覆盖近似空间的分类提供了理论依据.