Bartol, W.; Pióro, K.; Rosselló, F.: On the coverings by tolerance classes (2003)
0.00
0.0037439493 = product of:
0.0074878987 = sum of:
0.0074878987 = product of:
0.014975797 = sum of:
0.014975797 = weight(_text_:a in 4842) [ClassicSimilarity], result of:
0.014975797 = score(doc=4842,freq=20.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.28200063 = fieldWeight in 4842, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=4842)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- A tolerance is a reflexive and symmetric, but not necessarily transitive, binary relation. Contrary what happens with equivalence relations, when dealing with tolerances one must distinguish between blocks (maximal subsets where the tolerance is a total relation) and classes (the class of an element is the set of those elements tolerable with it). Both blocks and classes of a tolerance on a set define coverings of this set, but not every covering of a set is defined in this way. The characterization of those coverings that are families of blocks of some tolerance has been known for more than a decade now. In this paper we give a characterization of those coverings of a finite set that are families of classes of some tolerance.
- Type
- a
