Results 21 to 30 of about 236,678 (289)
Covering properties of $$\omega $$-mad families [PDF]
Comment: Comments are welcome.
Aurichi, Leandro, Zdomskyy, Lyubomyr
openaire +3 more sources
Covering Properties of Simplexes
Let \(N=\{1,2,\ldots,n\}\) and \(\{e_ 1,e_ 2,\ldots,e_ n\}\) be the unit vectors of \(n\)-dimensional Euclidean space i.e., the \(i^{\text{th}}\) coordinate of \(e_ i\) is 1, the other coordinates are 0. For any \(S \subset N\) let \(\Delta^ S\) denote the convex hull of \(\{e_ j:\;j \in S\}\). These are the simplexes of the title. \textit{E. Sperner} [
Idzik, Adam, Tan, Kok-Keong
openaire +2 more sources
Covering property of Hofstadter’s butterfly [PDF]
5 pages, 4 figures, to appear in Phys.
Ketzmerick, R. +3 more
openaire +2 more sources
The authors provide a hierarchy of star-covering properties which fit between countable compactness and pseudocompactness: \(n\)-starcompact, strongly \(n\)-starcompact, and a newly defined property, \(\omega\)- starcompact. Lindelöf analogues are also discussed (\(n\)-star- Lindelöf, strongly \(n\)-star-Lindelöf, and a new \(\omega\)-star- Lindelöf ...
Roscoe, A +3 more
openaire +3 more sources
Sensitivity of Aerodynamic Characteristics of Paraglider Wing to Properties of Covering Material
The paper is theoretically oriented. The main goal is to analyze the sensitivity of aerodynamic characteristics to the properties of the material used for paraglider wing. The paraglider of considerable dimensions is designed without stiffening elements.
Maślanka Paulina, Korycki Ryszard
doaj +1 more source
SOME PROPERTIES OF INDUCED COVER FROM FAMILY OF COVERING ROUGH SETS
Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering based rough set theory is proposed as a significant generalization of classical rough sets.
Nguyễn Đức Thuần
doaj +1 more source
On Weak Vitali Covering Properties [PDF]
There are now a number of Vitali covering properties which have been defined to handle problems arising in differentiation theory. Although some of these have received a unified treatment, as for example in the setting of Orlicz spaces in [1, p. 168], the underlying simplicity can be lost and the intimate connection with the original weak Vitali ...
openaire +1 more source
Covering-Based Rough Single Valued Neutrosophic Sets [PDF]
Rough sets theory is a powerful tool to deal with uncertainty and incompleteness of knowledge in information systems. Wang et al. proposed single valued neutrosophic sets as an extension of intuitionistic fuzzy sets to deal with real-world problems.
Yingcang Ma, Wanying Zhou, Qing Wan
doaj +1 more source
Graphs with the circuit cover property [PDF]
A circuit cover of an edge-weighted graph (G, p) is a multiset of circuits in G such that every edge e is contained in exactly p ( e ) p(e) circuits in the multiset. A nonnegative integer valued weight vector p is admissible if the total weight of any edge-cut is even, and no edge has more than half the ...
Alspach, Brian +2 more
openaire +1 more source
Covering granular reduction is an important issue in multi-covering information systems. The main methods to solve this problem are set operators. How to solve this problem by quantitative analysis is an interesting topic.
Jingqian Wang +2 more
doaj +1 more source

