Based on the equivalence relation on a linear space, in this paper we introduce the definition of rough convex cones and rough convex fuzzy cones and discuss some of the fundamental properties of such rough convex cones.

We consider a digital fuzzy set placed in Oxyplane, with support which is a set of digital points (centroids) in Z. We consider two kinds of convexity of a fuzzy set, namely quasi convexity and strong convexity, and we propose two algorithms for the construction of both kinds of convex hull of a digital fuzzy set.

The entropy of a subalgebra, which has been used in quantum ergodic theory to construct a noncommutative dynamical entropy, coincides for N-level systems and Abelian subalgebras with the notion of maximal mutual information of quantum communication theory. The optimal decompositions of mixed quantum states singled out by the entropy of Abelian subalgebras correspond to optimal detection schemes...

g e y w o r d s F u z z y numbers, Convexity, Continuity, Convex fuzzy mappings, Linear ordering, Fuzzy Weirstrass theorem, Fuzzy optimization. 1. I N T R O D U C T I O N Let R n denote the n-dimensional Eucl idean space. The suppor t , supp(#) , of a fuzzy set # : R ~ I = [0, 1] is defined as supp(/~) = {x • R n I #(x) > 0}. A fuzzy set # : R n --~ I is called fuzzy convex if #(Ax + (1 A)y) _>...