A categorical setting for the 4-Colour Theorem
✍ Scribed by Duško Pavlović
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 855 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In computer vision, colour naming has been posed as a fuzzy‐set problem where each colour category is modeled by a function that assigns a membership value to any given sample. However, the success in the automation of this process relies on having an appropriate psychophysical data set
In this paper, a new minimization theorem is obtained for a set-valued mapping and an equivalent relation between a variant of Ekeland variational principle [T.X.D. Ha, Some variants of Ekeland variational principle for a set-valued map, J. Optim. Theory Appl.
A set S in 1 :" is said to he X,-convex if and only if S does not contain a visually independent subset having cardinality h', . It is natural tts ask when an h',-convex set may be expressed as a countable unI.,n of convex sets. Here i! is proved that if S is a closed h',-convex set in the plane and