Applications of Rough Soft to Extensions Semihypergroups Induced by Operators and Corresponding Decision Making Methods

In this article, we apply rough soft set to a special algebraic hyperstructure, which obtained of disjoint Γ-semihypergroups, and give the concept of rough soft semihypergroup. We propose the notion of lower and upper approximations with respect to a special semihypergroup and obtain some properties of them. Moreover, we consider a connection between lower(upper) approximation of a special semihypergroup and lower(upper) approximation of associated Γ-hypergroupoid. In the last section of this research, we discuss the decision making algorithm of rough soft semihypergroups and we obtain a relation between the decision making algorithm of rough soft semihypergroups and their associated rough soft Γ-hypergroupoid for a special semihypergroup.

Γ∗-Relation on Fuzzy Hyperrings and Fundamental Ring

Fundamental relation performs an important role on fuzzy algebraic hyperstructure and is considered as the smallest equivalence relation such that the quotient is a universal algebra. In this paper, we introduce a new fuzzy strongly regular equivalence on fuzzy hyperrings such that the set of the quotient is a ring that is non-commutative. Also, we introduce the concept of a complete part of a fuzzy hyperring and study its principal traits. At last, we convey the relevance between the fundamental relation and complete parts of a fuzzy hyperring.

On Refined Neutrosophic Algebraic Hyperstructures I

Given any algebraic hyperstructure (X, ∗, ◦), the objective of this paper is to generate a refined neutrosophic algebraic hyperstructure (X(I1, I2), ∗', ◦') from X, I1 and I2 and study refined neutrosophic Krasner hyper-rings in particular.

Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures

The aim of this paper is to study, from an algebraic point of view, the properties of interdependencies between sets of elements (i.e., pieces of secrets, atmospheric variables, etc.) that appear in various natural models, by using the algebraic hyperstructure theory. Starting from specific examples, we first define the relation of dependence and study its properties, and then, we construct various hyperoperations based on this relation. We prove that two of the associated hypergroupoids are H v -groups, while the other two are, in some particular cases, only partial hypergroupoids. Besides, the extensivity and idempotence property are studied and related to the cyclicity. The second goal of our paper is to provide a new interpretation of the dependence relation by using elements of the theory of algebraic hyperstructures.

Elements of Hyperstructure Theory in UWSN Design and Data Aggregation

In our paper we discuss how elements of algebraic hyperstructure theory can be used in the context of underwater wireless sensor networks (UWSN). We present a mathematical model which makes use of the fact that when deploying nodes or operating the network we, from the mathematical point of view, regard an operation (or a hyperoperation) and a binary relation. In this part of the paper we relate our context to already existing topics of the algebraic hyperstructure theory such as quasi-order hypergroups, E L -hyperstructures, or ordered hyperstructures. Furthermore, we make use of the theory of quasi-automata (or rather, semiautomata) to relate the process of UWSN data aggregation to the existing algebraic theory of quasi-automata and their hyperstructure generalization. We show that the process of data aggregation can be seen as an automaton, or rather its hyperstructure generalization, with states representing stages of the data aggregation process of cluster protocols and describing available/used memory capacity of the network.

Cyclicity in EL–Hypergroups

In the algebra of single-valued structures, cyclicity is one of the fundamental properties of groups. Therefore, it is natural to study it also in the algebra of multivalued structures (algebraic hyperstructure theory). However, when one considers the nature of generalizing this property, at least two (or rather three) approaches seem natural. Historically, all of these had been introduced and studied by 1990. However, since most of the results had originally been published in journals without proper international impact and later—without the possibility to include proper background and context-synthetized in books, the current way of treating the concept of cyclicity in the algebraic hyperstructure theory is often rather confusing. Therefore, we start our paper with a rather long introduction giving an overview and motivation of existing approaches to the cyclicity in algebraic hyperstructures. In the second part of our paper, we relate these to E L -hyperstructures, a broad class of algebraic hyperstructures constructed from (pre)ordered (semi)groups, which were defined and started to be studied much later than sources discussed in the introduction were published.

On Hyperideals in Left Almost Semihypergroups

This paper deals with a class of algebraic hyperstructures called left almost semihypergroups (LA-semihypergroups), which are a generalization of LA-semigroups and semihypergroups. We introduce the notion of LA-semihypergroup, the related notions of hyperideal, bi-hyperideal, and some properties of them are investigated. It is a useful nonassociative algebraic hyperstructure, midway between a hypergroupoid and a commutative hypersemigroup, with wide applications in the theory of flocks, and so forth. We define the topological space and study the topological structure of LA-semihypergroups using hyperideal theory. The topological spaces formation guarantee for the preservation of finite intersection and arbitrary union between the set of hyperideals and the open subsets of resultant topologies.