In this note we prove that it is impossible to extend the natural equivalence between the category of MV-algebras and the category of Abelian `-groups with strong unit described by C. C. Chang, 1958, and Cignoli & Mundici, 1997, to a natural equivalence between the category of m-zeroids and some category containing the category of Abelian `-groups with strong unit.

Background & Aim:Extracts of Roselle calyx,   possess compounds which could be considered as a great source of natural antioxidants.   In this project, antioxidant activities, phenolic compounds content and their   correlation analysis on calices of Roselle (Hibiscus sabdariffa) was investigated.  Experimental: Total polyphenolic compound, flavonoids and anthoc...

Generalised halfspace depth function is proposed. Basic properties of this depth function including the strong consistency are studied. We show, on several examples that our depth function may be considered to be more appropriate for nonsymetric distributions or for mixtures of distributions.

For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...

The paper deals with the best unbiased estimators of the blocked compound symmetric covariance structure for m−variate observations over u sites under the assumption of multivariate normality. The free-coordinate approach is used to prove that the quadratic estimation of covariance parameters is equivalent to linear estimation with a properly defined inner product in the space of symmetric matr...

A k-hypertournament is a complete k-hypergraph with each k-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k-hypertournament, the score si (losing score ri) of a vertex vi is the number of arcs containing vi in which vi is not the last element (in which vi is the last element). The total score of vi is defined as ti = si − ri. In this ...