Abstract
Neutrosophy, the study of neutralities, is a new branch of Philosophy that has applications in many different fields of science. Inspired by the idea of Neutrosophy, Smarandache introduced NeutroAlgebraicStructures (or NeutroAlgebras) by allowing the partiality and indeterminacy to be included in the structures’ operations and/or axioms. The aim of this paper is to combine the concept of Neutrosophy with hyperstructures theory. In this regard, we introduce NeutroSemihypergroups as well as NeutroHv-Semigroups and study their properties by providing several illustrative examples.
Keywords:
NeutroHypergroupoid; NeutroSemihypergroup; NeutroHv-semigroup; NeutroHyperideal; NeutroStrongIsomorphism MSC:
03A99; 03G99; 20N20
1. Introduction
In 1995 and inspired by the existence of neutralities, Smarandache introduced Neutrosophy as a new branch of Philosophy that deals with indeterminacy. During the past, ideas were viewed as “True” or “False”; however, if we view an idea from a neutrosophic point of view, it will be “True”, “False”, or “Indeterminate”. The indeterminacy is the key that distinguishes Neutrosophy from other approaches. In the past twenty years, this field demonstrated important progress in which it grabbed the attention of many researchers and different works were done from both a theoretical point of view and from an applicative view. Unlike our real world that is full of imperfections and partialities, abstract systems are constructed on a given perfect space (set), where the operations are totally well-defined and the axioms are totally true for all spacial elements. Starting from the latter idea, Smarandache [1,2,3] introduced NeutroAlgebra, whose operations are partially well-defined, partially indeterminate, and partially outer-defined, and the axioms are partially true, partially indeterminate, and partially false. Many researchers worked on special types of NeutroAlgebras by applying them to different types of algebraic structures such as groups, rings, -Algebras, -Algebras, etc. For more details, we refer to [4,5,6,7,8,9,10].
On the other hand, hyperstructure theory is a generalization of classical algebraic structures and was introduced in 1934 at the eighth Congress of Scandinavian Mathematicians by Marty [11]. Marty generalized the notion of groups by defining hypergroups. The class of algebraic hyperstructures is larger than that of algebraic structures where the operation on two elements in the latter is again an element, whereas the hyperoperation of two elements in the first class is a non-void set. For details about hyperstructure theory and its applications, we refer to the articles [12,13,14,15] and the books [16,17,18]. A generalization of algebraic hyperstructures, known as weak hyperstructures (-structures), was introduced in 1994 by Vougiouklis [19]. The axioms in the latter are weaker than that of algebraic hyperstructures. For details about -structures, we refer to [19,20,21,22].
As a natural extension of NeutroAlgebraicStructure, NeutroHyperstructure was defined recently [23,24] where Ibrahim and Agboola [23] defined NeutroHypergroups and studied a special type. Our paper is concerned about some NeutroHyperstructures and is organized as follows: Section 2 presents some basic preliminaries related to hyperstructure theory. Section 3 defines NeutroSemihypergroups, NeutroH-Semigroups, and some related new concepts and illustrates these new concepts via examples. Moreover, we study some properties of their subsets under NeutroStrongHomomorphism.
2. Algebraic Hyperstructures
In this section, we present some definitions and examples about (weak) algebraic hyperstructures that are used throughout the paper. For more details about hyperstructure theory, we refer to [16,17,18,19,20].
Definition 1
([16]). Let H be a non-empty set and be the family of all non-empty subsets of H. Then, a mapping is called a binary hyperoperation on H. The couple is called a hypergroupoid.
If A and B are two non-empty subsets of H and , then we define:
A hypergroupoid is called a semihypergroup if the associative axiom is satisfied. i.e., for every , . In other words,
An element h in a hypergroupoid is called idempotent if .
Example 1.
Let H be any non-empty set and define “★” on H as follows. For all , . Then is a semihypergroup.
Example 2.
Let and be defined by the following table.
Then is a semihypergroup and e is an idempotent element in .
| + | e | b | c |
| e | e | {e,b} | {e,c} |
| b | e | {e,b} | {e,c} |
| c | e | {e,b} | {e,c} |
As a generalization of algebraic hyperstructures, Vougiouklis [19,20] introduced -structures. Weak axioms in -structures replace some axioms of classical algebraic hyperstructures.
Definition 2
([19,20]). A hypergroupoid is called an -semigroup if the weak associative axiom is satisfied. i.e., for all .
Example 3.
Let and “+” be the hyperoperation on defined by the following table.
Then is an -semigroup.
| + | 0 | 1 | 2 | 3 |
| 0 | 0 | 1 | {0,2} | 3 |
| 1 | 1 | 2 | 3 | 0 |
| 2 | 2 | 3 | 0 | 1 |
| 3 | 3 | 0 | 1 | 2 |
Remark 1.
Every semigroup is a semihypergroup and every semihypergroup is an -semigroup.
Definition 3
([17]). Let be a semihypergroup (-semigroup) and . Then M is a
- 1.
- subsemihypergroup (-subsemigroup) of H if is a semihypergroup (-semigroup).
- 2.
- left hyperideal of H if M is a subsemihypergroup (-subsemigroup) of H and for all .
- 3.
- right hyperideal of H if M is a subsemihypergroup (-subsemigroup) of H and for all .
- 4.
- hyperideal of H if M is both: a left hyperideal of H and a right hyperideal of H.
Remark 2.
Let be a semihypergroup (-semigroup) and . To prove that M is subsemihypergroup (-subsemigroup) of H, it suffices to show that for all .
3. NeutroHyperstructures
In this section, we define NeutroSemihypergroups and NeutroH-Semigroups, present some illustrative examples, and study several properties of some important subsets of NeutroSemihypergroups and NeutroH-Semigroups.
Definition 4.
Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called a NeutroHyperoperation on A if some (or all) of the following conditions hold in a way that .
- 1.
- There exist with . (This condition is called degree of truth, “T”).
- 2.
- There exist with . (This condition is called degree of falsity, “F”).
- 3.
- There exist with is indeterminate in A. (This condition is called degree of indeterminacy, “I”).
Definition 5.
Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called an AntiHyperoperation on A if for all .
Definition 6.
Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called NeutroAssociative on A if there exist satisfying some (or all) of the following conditions in a way that .
- 1.
- ; (This condition is called degree of truth, “T”).
- 2.
- ; (This condition is called degree of falsity, “F”).
- 3.
- is indeterminate or is indeterminate or we cannot find if and are equal. (This condition is called degree of indeterminacy, “I”).
Definition 7.
Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called AntiAssociative on A if for all .
Definition 8.
Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called a NeutroWeakAssociative on A if there exist satisfying some (or all) of the following conditions in a way that .
- 1.
- ; (This condition is called degree of truth, “T”).
- 2.
- ; (This condition is called degree of falsity, “F”).
- 3.
- is indeterminate or is indeterminate or we cannot find if and have common elements. (This condition is called degree of indeterminacy, “I”).
Definition 9.
Let A be a non-empty set and “·” be a hyperoperation on A. Then is called a
- 1.
- NeutroHypergroupoid if “·” is a NeutroHyperoperation.
- 2.
- NeutroSemihypergroup if “·” is NeutroAssociative but not an AntiHyperoperation.
- 3.
- NeutroH-Semigroup if “·” is NeutroWeakAssociative but not an AntiHyperoperation.
Example 4.
Let and be defined by the following table.
Then is a NeutroSemihypergroup and NeutroH-Semigroup. This is clear as
| + | 0 | 1 |
| 0 | {0,1} | 0 |
| 1 | 1 | 0 |
Example 5.
Let be the set of real numbers and define “★” on as follows.
Then is a NeutroSemihypergroup. This is clear as and .
Example 6.
Let and be defined by the following table.
Then is a NeutroSemihypergroup. This is clear as and .
| · | m | a | d |
| m | m | m | m |
| a | m | {m,a} | d |
| d | m | d | d |
Remark 3.
It is well known in classical algebraic hyperstructures that every semihypergroup is a hypergroupoid. This may fail to occur in NeutroHyperstructures. In Example 6, is a NeutroSemihypergroup that is not a NeutroHypergroupoid.
Proposition 1.
Every -semigroup that is not a semihypergroup and has an idempotent element is a NeutroSemihypergroup.
Proof.
Let be an -semigroup with for some . Then . Since is not a semihypergroup, it follows that there exist with . Therefore, is a NeutroSemihypergroup. □
Example 7.
Let and be defined by the following table.
Then is an -semigroup having m as an idempotent element and hence, it is a NeutroSemihypergroup.
| ⋄ | m | a | d |
| m | m | {a,d} | d |
| a | {a,d} | d | m |
| d | d | m | a |
Remark 4.
It is well known in algebraic hyperstructures that every semihypergroup is an -semigroup. This may not hold in NeutroHyperstructures. i.e., A NeutroSemihypergroup may not be a NeutroH-Semigroup.
The -semigroup in Example 7 is a NeutroSemihypergroup that is not NeutroH-Semigroup.
Example 8.
Let be the set of integers and define “⊕” on as follows. For all ,
and if
Then is a NeutroSemihypergroup. This is clear as
and
Example 9.
Let be the set of integers and define “⊙” on as follows. For all ,
Then is a NeutroSemihypergroup. This is clear as
and
Example 10.
Let be the set of integers under addition modulo 6 and define “⊞” on as follows.
Then is a NeutroSemihypergroup. This is clear as and .
Example 11.
Let and be defined by the following table.
Then is a NeutroH-Semigroup. This is clear as
and
Moreover, is a NeutroSemihypergroup as .
| • | m | a | d |
| m | a | a | d |
| a | {m,a} | m | d |
| d | d | d | m |
Remark 5.
Every NeutroSemigroup is both: a NeutroSemihypergroup and a NeutroH-Semigroup. So, the results related to NeutroSemihypergroups (NeutroH-Semigroups) are more general than that related to NeutroSemigroups and as a result, we can deal with NeutroSemigroups as a special case of NeutroSemihypergroups (NeutroH-Semigroups).
Example 12.
Let and be defined by the following table.
In [6], Al-Tahan et al. proved that is a NeutroSemigroup. Thus, is a NeutroSemihypergroup.
| ·1 | s | a | m |
| s | s | m | s |
| a | m | a | m |
| m | m | m | m |
Theorem 1.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and “★” be defined on H as for all . Then is a NeutroSemihypergroup (NeutroH-Semigroup).
Proof.
The proof is straightforward. □
Example 13.
Let and be the NeutroSemihypergroup defined in Example 11. By applying Theorem 1, we get that defined in the following table is a NeutroSemihypergroup and a NeutroH-Semigroup.
| ⊛ | m | a | d |
| m | a | {m,a} | d |
| a | a | m | d |
| d | d | d | m |
Definition 10.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and . Then S is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H if is a NeutroSemihypergroup (NeutroH-Semigroup).
Remark 6.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and . Unlike the case in algebraic hyperstructures (Remark 2), proving that for all does not imply that S is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H.
As an illustration of Remark 6, in Example 5 but is not a NeutroSubsemihypergroup of .
Definition 11.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and be a NeutroSubsemihypergroup (NeutroH-Subsemigroup). Then
- (1)
- S is a NeutroLeftHyperideal of H if there exists such that for all .
- (2)
- S is a NeutroRightHyperideal of S if there exists such that for all .
- (3)
- S is a NeutroHyperideal of H if there exists such that and for all .
A NeutroSemihypergroup (NeutroH-Semigroup) is called simple if it has no proper NeutroSubsemihypergroups (NeutroH-Subsemigroups).
Example 14.
Let be the NeutroSemihypergroup defined in Example 4. Then A is simple. This is clear as and are the only options for any possible proper NeutroSubsemihypergroup and and are AntiHypergroupoids.
Example 15.
Let be the NeutroSemihypergroup defined in Example 11. Then is a NeutroSubsemihypergroup of M.
Example 16.
Let be the NeutroSemihypergroup defined in Example 8, , and . Then are NeutroSubsemihypergroups of .
Remark 7.
The intersection of NeutroSubsemihypergroups may fail to be a NeutroSubsemihypergroup. This is clear from Example 16 as is not a NeutroSubsemihypergroup of .
Lemma 1.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and be hypergroupoids. If are NeutroSubsemihypergroups (NeutroH-Subsemigroups) of H then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H.
Proof.
Let be NeutroSubsemihypergroups. Since A and B are hypergroupoids, it follows that “∘” is NeutroAssociative on both of A and B. The latter implies that there exist satisfying some (or all) of the following conditions in a way that .
- T: ;
- F: ;
- I: is indeterminate or is indeterminate or we cannot find if and are equal.
Therefore, is a NeutroSubsemihypergroup of H. The proof of (NeutroH-Subsemigroup is done similarly. □
Example 17.
Let be the NeutroSemihypergroup defined in Example 9, , and . Then are NeutroHyperideals of . We show that is a NeutroHyperideal of and may be done similarly. Since
and
it follows that is a NeutroSubsemihypergroup of . Having and for all ,
implies that is a NeutroHyperideal of .
Remark 8.
The intersection of NeutroHyperideals may fail to be a NeutroHyperideal. This is clear from Example 17 as is not a NeutroHyperideal of .
Lemma 2.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and be hypergroupoids. If are NeutroLeftHyperideals (NeutroRightHyperideals or NeutroHyperideals) of H. Then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H.
Proof.
Let be NeutroLeftHyperideals of H. Lemma 1 asserts that is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H. Since A is a NeutroLeftHyperideal of H, it follows that there exists such that for all . The latter implies that there exists such that for all . Thus, is a NeutroLeftHyperideal of H. □
Definition 12.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a function. Then
- (1)
- ϕ is called NeutroHomomorphism if for some .
- (2)
- ϕ is called NeutroIsomomorphism if ϕ is a bijective NeutroHomomorphism.
- (3)
- ϕ is called NeutroStrongHomomorphism if for all , when , when , and is indeterminate when is indeterminate.
- (4)
- ϕ is called NeutroStrongIsomomorphism if ϕ is a bijective NeutroOrderedStrongHomomorphism. In this case we say that .
Example 18.
Let and be the NeutroSemihypergroups defined in Examples 11 and 13, respectively. Then as is a NeutroStongIsomorphism. Here,
Theorem 2.
The relation “” is an equivalence relation on the set of NeutroSemihypergroups (NeutroH-Semigroups).
Proof.
By taking the identity map, we can easily prove that “” is a reflexive relation. Let . Then there exists a NeutroStrongIsomorphism . We prove that the inverse function of is a NeutroStrongIsomorphism. For all , there exist with and . We have
We consider the following cases for .
Case . Having a NeutroStrongIsomorphism and imply that and hence,
Case . Suppose, to get contradiction, that or indeterminate. Then by using our hypothesis that is NeutroStrongIsomorphism, we get that or indeterminate.
Case is indeterminate. Suppose, to get contradiction, that or . Then by using our hypothesis that is NeutroStrongIsomorphism, we get that or .
Thus, and hence, “” is a symmetric relation. Let and . Then there exist NeutroStrongIsomorphisms and . One can easily see that the composition function of and is a NeutroStrongIsomorphism. Thus, and hence, “” is a transitive relation. □
Lemma 3.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be an injective NeutroStrongHomomorphism. If is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of .
Proof.
Let M be a NeutroSubsemihypergroup of H. If “∘” is NeutroHyperoperation on M then it is clear that “★” is NeutroHyperoperation on . If “∘” is NeutroAssociative then there exist satisfying some (or all) of the following conditions in a way that .
- T: ;
- F: ;
- I: is indeterminate or is indeterminate or we cannot find if and are equal.
The latter and having an injective NeutroStrongHomomorphism imply that some (or all) of the following conditions are satisfied in a way that .
- T: ;
- F: ;
- I: is indeterminate or is indeterminate or we cannot find if and are equal.
Thus, is a NeutroSubsemihypergroup. The proof that is a NeutroH- Subsemigroup of is done similarly. □
Example 19.
Let and be the NeutroSemihypergroups defined in Examples 11 and 13, respectively. Example 15 asserts that is a NeutroSubsemihypergroup of . Using Example 18 and Lemma 3, we get that is a NeutroSubsemihypergroup of .
Lemma 4.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomomorphism. If is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H.
Proof.
Let be a NeutroSubsemihypergroup of . If “★” is NeutroHyperoperation on N then it is clear that “∘” is NeutroHyperoperation on . Let “★” be NeutroAssociative. Having is an onto NeutroStrongHomomorphism implies that there exist satisfying some (or all) of the following conditions in a way that .
- T: ;
- F: ;
- I: is indeterminate or is indeterminate or we cannot find if and are equal.
Having be an injective NeutroStrongHomomorphism implies that there exist satisfying some (or all) of the following conditions in a way that .
- T: ;
- F: ;
- I: is indeterminate or is indeterminate or we cannot find if and are equal.
Thus, is a NeutroSubsemihypergroup of H. The proof that is a NeutroH-Subsemigroup of H may be done similarly. □
Theorem 3.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. Then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H if and only if is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of .
Proof.
The proof follows from Theorem 2 and Lemmas 3 and 4. □
Corollary 1.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. Then H is simple if and only if is simple.
Proof.
The proof follows from Theorem 3. □
Lemma 5.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. If is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of .
Proof.
Let be a NeutroLeftHyperideal of H. Lemma 3 asserts that is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of . Having M a NeutroLeftHyperideal of H implies that there exists such that for all . Having an onto NeutroStrongHomomorphism implies that for all . Thus, is a NeutroLeftHyperideal of . The proofs of NeutroRightHyperideal and NeutroHyperideal are done similarly. □
Lemma 6.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. If is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H.
Proof.
Let be a NeutroLeftHyperideal of H. Lemma 3 asserts that is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H. Having N a NeutroLeftHyperideal of implies that there exists such that for all . Since is an NeutroStrongHomomorphism, it follows that for all where . The latter implies that there exists with for all . Thus, is a NeutroLeftHyperideal of H. The proofs of NeutroRightHyperideal and NeutroHyperideal are done similarly. □
Theorem 4.
Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. Then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H if and only if is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of .
Proof.
The proof follows from Theorem 2, Lemmas 5 and 6. □
Let be any non-empty set for all and “” be a hyperoperation on . We define “∘” on as follows: For all , .
Theorem 5.
Let and be hypergroupoids. Then is a NeutroSemihypergroup (NeutroH-Semigroup) if and only if either is a NeutroSemihypergroup (NeutroH-Semigroup) or is a NeutroSemihypergroup (NeutroH-Semigroup) or both are NeutroSemihypergroups (NeutroH-Semigroups).
Proof.
The proof is straightforward. □
Example 20.
Let be the semihypergroup defined as: for all and be the NeutroSemihypergroup defined in Example 6. Then the following are true.
- 1.
- is a NeutroSemihypergroup,
- 2.
- is a NeutroSemihypergroup, and
- 3.
- is a NeutroSemihypergroup.
In what follows, we present a way to construct a new NeutroSemihypergroup (NeutroH-Semigroup) from an existing one. This tool is of great importance to prove that for any positive integer , there exists at least one NeutroSemihypergroup (NeutroH-Semigroup) of order n.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and J be any non-empty set such that and . The extension of H by J is given as . We define the hyperoperation “⊚” on as follows.
Theorem 6.
Let be a NeutroSemihypergroup (NeutroH-Semigroup) and J be any non-empty set such that and . Then is a NeutroSemihypergroup (NeutroH-Semigroup).
Proof.
Let be a NeutroSemihypergroup. If “∘” is a NeutroHyperoperation then there exist with representing “T”, representing “F”, is indeterminate representing “I”. Where . Since , it follows that there exist with representing “T”, representing “F” (as and ), is indeterminate representing “I”. Where . Thus, “⊚” is NeutroHyperoperation on . If “∘” is NeutroAssociative on H then it is clear that “⊚” is NeutroAssociative on . Therefore, is a NeutroSemihypergroup. The case is a NeutroH-Semigroup is done similarly. □
Example 21.
Let be the NeutroSemihypergroup defined in Example 6 and . Then and is the NeutroSemihypergroup defined by the following table.
| ⊚ | m | a | d | n |
| m | m | m | m | {m,a,d,n} |
| a | m | {m,a} | d | {m,a,d,n} |
| d | m | d | d | {m,a,d,n} |
| n | {m,a,d,n} | {m,a,d,n} | {m,a,d,n} | {m,a,d,n} |
Theorem 7.
Let be an integer. Then there is at least one NeutroSemihypergroup of order n.
Proof.
The proof follows from Example 4 and Theorem 6. □
Corollary 2.
There are infinitely many NeutroSemihypergroups up to NeutroStrongIsomorphism.
Proof.
The proof follows from Theorem 7. □
Theorem 8.
Let be any integer. Then there is at least one NeutroH-Semigroup of order n.
Proof.
The proof follows from Example 4 and Theorem 6. □
Corollary 3.
There are infinitely many NeutroH-Semigroups up to NeutroStrongIsomorphism.
Proof.
The proof follows from Theorem 8. □
4. Conclusions
In this paper, we discussed the properties of some NeutroHyperstructures. More precisely, we introduced NeutroSemihypergroups (NeutroH-Semigroups), constructed several examples, and studied some of their important subsets under NeutroStrongIsomorphism. It was shown through examples that some of the well known results for algebraic hyperstructures do not hold for NeutroHyperstructures. Moreover, it was proved that there is at least one NeutroSemihypergroup (NeutroH-Semigroups) of order n where n is any integer greater than one. The results in this paper may be considered as a base for any possible study in the field of NeutroHyperstructures.
For future research, we raise the following ideas.
- Find all NeutroSemihypergroups (NeutroH-Semigroups) of small order (up to NeutroStrongIsomorphism).
- Find bounds for the number of finite NeutroSemihypergroups (NeutroH-Semigroups) of arbitrary order n (up to NeutroStrongIsomorphism).
- Classify simple NeutroSemihypergroups (NeutroH-Semigroups) up to NeutroStrongIsomorphism.
- Define other NeutroHyperstructures such as NeutroPolygroup, NeutroHyperring, etc.
- Find applications of NeutroHyperstructures in some fields like Biology, Physics, Chemistry, etc.
Author Contributions
Conceptualization, M.A.-T., B.D., F.S., and O.A.; methodology, M.A.-T., B.D., F.S., and O.A.; writing—original draft preparation, M.A.-T.; writing—review and editing, M.A.-T., B.D., F.S., and O.A. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Smarandache, F. NeutroAlgebra is a Generalization of Partial Algebra. Int. J. Neutrosophic Sci. IJNS 2020, 2, 8–17. Available online: http://fs.unm.edu/NeutroAlgebra.pdf (accessed on 1 January 2020).
- Smarandache, F. Introduction to NeutroAlgebraic Structures and AntiAlgebraic Structures. In Advances of Standard and Nonstandard Neutrosophic Theories; Pons Publishing House: Brussels, Belgium, 2019; Chapter 6; pp. 240–265. Available online: http://fs.unm.edu/AdvancesOfStandardAndNonstandard.pdf (accessed on 1 January 2020).
- Smarandache, F. Introduction to NeutroAlgebraic Structures and AntiAlgebraic Structures (revisited). Neutrosophic Sets Syst. 2020, 31, 1–16. [Google Scholar] [CrossRef]
- Agboola, A.A.A. Introduction to NeutroGroups. Int. J. Neutrosophic Sci. IJNS 2020, 6, 41–47. [Google Scholar]
- Agboola, A.A.A. Introduction to NeutroRings. Int. J. Neutrosophic Sci. IJNS 2020, 7, 62–73. [Google Scholar]
- Al-Tahan, M.; Smarandache, F.; Davvaz, B. NeutroOrderedAlgebra: Applications to Semigroups. Neutrosophic Sets Syst. 2021, 39, 133–147. [Google Scholar]
- Al-Tahan, M.; Davvaz, B.; Smarandache, F.; Osman, O. On Some Properties of Productional NeutroOrderedSemigroups. 2021; submitted. [Google Scholar]
- Hamidi, M.; Smarandache, F. Neutro-BCK-Algebra. Int. J. Neutrosophic Sci. IJNS 2020, 8, 110–117. [Google Scholar]
- Rezaei, A.; Smarandache, F. On Neutro-BE-algebras and Anti-BE-algebras. Int. J. Neutrosophic Sci. IJNS 2020, 4, 8–15. [Google Scholar]
- Smarandache, F.; Rezaei, A.; Kim, H.S. A New Trend to Extensions of CI-algebras. Int. J. Neutrosophic Sci. IJNS 2020, 5, 8–15. [Google Scholar] [CrossRef]
- Marty, F. Sur une generalization de la notion de groupe. In Proceedings of the 8th Congress on Mathmatics, Scandinaves, Stockholm, Sweden, 14–18 August 1934; pp. 45–49. [Google Scholar]
- Al-Tahan, M.; Davvaz, B. Chemical Hyperstructures for Astatine, Tellurium and for Bismuth. Bull. Comput. Appl. Math. 2019, 7, 9–25. [Google Scholar]
- Al-Tahan, M.; Davvaz, B. On the Existence of Hyperrings Associated to Arithmetic Functions. J. Number Theory 2017, 174, 136–149. [Google Scholar] [CrossRef]
- Al-Tahan, M.; Davvaz, B. Algebraic Hyperstructures Associated to Biological Inheritance. Math. Biosci. 2017, 285, 112–118. [Google Scholar] [CrossRef]
- Davvaz, B.; Subiono; Al-Tahan, M. Calculus of Meet Plus Hyperalgebra (Tropical Semihyperrings). Commun. Algebra 2020, 48. [Google Scholar] [CrossRef]
- Corsini, P. Prolegomena of Hypergroup Theory; Udine Aviani Editore: Tricesimo (Udine), Italy, 1993. [Google Scholar]
- Davvaz, B. Polygroup Theory and Related Systems; World Scientific Publishing Co., Pte. Ltd.: Hackensack, NJ, USA, 2013; viii+200p. [Google Scholar]
- Davvaz, B.; Leoreanu-Fotea, V. Hyperring Theory and Applications; International Academic Press: Cambridge, MA, USA, 2008. [Google Scholar]
- Vougiouklis, T. The Fundamental Relation in Hyperrings. The General Hyperfield. In Proceedings of the Fourth International Congress on Algebraic Hyperstructures and Applications (AHA 1990); World Scientific: Singapore, 1991; pp. 203–211. [Google Scholar]
- Vougiouklis, T. Hyperstructures and Their Representations; Hadronic Press, Inc.: Palm Harber, FL, USA, 1994. [Google Scholar]
- Vougiouklis, T. Hv-groups Defined on the Same Set. Discret. Math. 1996, 155, 259–265. [Google Scholar] [CrossRef]
- Vougiouklis, T.; Spartalis, S.; Kessoglides, M. Weak Hyperstructures on Small Sets. Ratio Math. 1997, 12, 90–96. [Google Scholar]
- Ibrahim, M.A.; Agboola, A.A.A. Introduction to NeutroHyperGroups. Neutrosophic Sets Syst. 2020, 38, 15–32. [Google Scholar]
- Smarandache, F. Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n-SuperHyperGraph, and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-)HyperAlgebra. Neutrosophic Sets Syst. 2020, 33, 290–296. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).