The purpose of this note is to use covering space theory to construct new examples of buildings. On the level of Coxeter systems, this contsruction was described previously in Davis [4]. It goes as follows. Start with a Coxeter system (W ′, S). Change some m(s, t)’s in its Coxeter matrix from integers ≥ 2 to the symbol ∞ . This defines a new Coxeter system (W, S). Suppose C′ is a building of ty...

This article contains a new argument which proves vanishing of the first cohomology for negative vector bundles over a complex projective variety if the rank of the bundle is smaller than the dimension of the base. Similar argument is applied to the construction of holomorphic functions on the universal covering of the complex projective variety .

This paper describes certain properties of the fundamental group of the shrinking wedge of circles. Covering space theory is an inadequate tool since the shrinking wedge of circles is not semi-locally simply connected. We conclude with the fact that the shrinking wedge of circles is not homotopy equivalent to the wedge product of a countable number of circles.

In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...