This paper deals with hypergroupoids obtained from n-ary relations. We give conditions for an n-ary relation such that the hypergroupoid associated with it is a hypergroup. First we analyze this construction using a ternary relation and then we generalize it for an n-ary relation.

A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduction obtained by the non-optimal, state-of-the-art Source-DPOR (SDPOR) algorithm is comparable to optimal DPOR. We show the first program with O(n) Mazurkiewicz traces where SDPOR explores O(2 n) redundant schedules a...

measure always exists on a commutative hypergroup K, and there always exists a 'Plancherel measure' on the dual space K of equivalence classes of irreducible representations of K, with respect to which Plancherel's formula holds for Fourier transforms. In contrast with the case of a locally compact abelian group, however, the Plancherel measure is not necessarily a Haar measure on K, and K need...

This paper continues the study of the connection between hyper- groups and fuzzy sets, investigating the length of the sequence of join spaces associated with a hypergroup. The classes of complete hypergroups and of 1-hypergroups are considered and analyzed in this context. Finally, we give a method to construct a nite hypergroup with the strong fuzzy grade equal to a given natural number