Year | 2009 | 2010 | 2011 | 2012 | 2013 |
No.ofdismissedstudents | 16 | 20 | 33 | 65 | 43 |
In this paper, we give the generalized form of soft semihypergroups in ternary structure and have studied it with the help of examples. There are some structures that are not appropriately handled by using the binary operation of the semihypergroup, such as all the sets of non-positive numbers are not closed under binary operation but hold for ternary operation. To deal with this type of problem and handling special type of uncertainty, we study the ternary semihypergroup in terms of prime soft hyperideals. We have introduced prime, strongly prime, semiprime, irreducible and strongly irreducible soft bi-hyperideals in ternary semihypergroups and studied certain properties of these soft bi-hyperideals in ternary semihypergroups. The main advantage of this paper is that we proved that each soft bi-hyperideal of ternary semihypergroup K is strongly prime if it is idempotent and the set of soft bi-hyperideals of K is totally ordered by inclusion.
Citation: Shahida Bashir, Rabia Mazhar, Bander Almutairi, Nauman Riaz Chaudhry. A novel approach to study ternary semihypergroups in terms of prime soft hyperideals[J]. AIMS Mathematics, 2023, 8(9): 20269-20282. doi: 10.3934/math.20231033
[1] | Warud Nakkhasen, Teerapan Jodnok, Ronnason Chinram . Intra-regular semihypergroups characterized by Fermatean fuzzy bi-hyperideals. AIMS Mathematics, 2024, 9(12): 35800-35822. doi: 10.3934/math.20241698 |
[2] | Jayanta Ghosh, Dhananjoy Mandal, Tapas Kumar Samanta . Soft prime and semiprime int-ideals of a ring. AIMS Mathematics, 2020, 5(1): 732-745. doi: 10.3934/math.2020050 |
[3] | Jukkrit Daengsaen, Sorasak Leeratanavalee . Semilattice strongly regular relations on ordered n-ary semihypergroups. AIMS Mathematics, 2022, 7(1): 478-498. doi: 10.3934/math.2022031 |
[4] | G. Muhiuddin, Ahsan Mahboob . Int-soft ideals over the soft sets in ordered semigroups. AIMS Mathematics, 2020, 5(3): 2412-2423. doi: 10.3934/math.2020159 |
[5] | Jian Tang, Xiang-Yun Xie, Ze Gu . A study on weak hyperfilters of ordered semihypergroups. AIMS Mathematics, 2021, 6(5): 4319-4330. doi: 10.3934/math.2021256 |
[6] | Mohammad Hamidi, Irina Cristea . Hyperideal-based zero-divisor graph of the general hyperring Zn. AIMS Mathematics, 2024, 9(6): 15891-15910. doi: 10.3934/math.2024768 |
[7] | Ibtesam Alshammari, Islam M. Taha . On fuzzy soft β-continuity and β-irresoluteness: some new results. AIMS Mathematics, 2024, 9(5): 11304-11319. doi: 10.3934/math.2024554 |
[8] | Rehab Alharbi, S. E. Abbas, E. El-Sanowsy, H. M. Khiamy, K. A. Aldwoah, Ismail Ibedou . New soft rough approximations via ideals and its applications. AIMS Mathematics, 2024, 9(4): 9884-9910. doi: 10.3934/math.2024484 |
[9] | Rabia Mazhar, Shahida Bashir, Muhammad Shabir, Mohammed Al-Shamiri . A soft relation approach to approximate the spherical fuzzy ideals of semigroups. AIMS Mathematics, 2025, 10(2): 3734-3758. doi: 10.3934/math.2025173 |
[10] | Rukchart Prasertpong . Roughness of soft sets and fuzzy sets in semigroups based on set-valued picture hesitant fuzzy relations. AIMS Mathematics, 2022, 7(2): 2891-2928. doi: 10.3934/math.2022160 |
In this paper, we give the generalized form of soft semihypergroups in ternary structure and have studied it with the help of examples. There are some structures that are not appropriately handled by using the binary operation of the semihypergroup, such as all the sets of non-positive numbers are not closed under binary operation but hold for ternary operation. To deal with this type of problem and handling special type of uncertainty, we study the ternary semihypergroup in terms of prime soft hyperideals. We have introduced prime, strongly prime, semiprime, irreducible and strongly irreducible soft bi-hyperideals in ternary semihypergroups and studied certain properties of these soft bi-hyperideals in ternary semihypergroups. The main advantage of this paper is that we proved that each soft bi-hyperideal of ternary semihypergroup K is strongly prime if it is idempotent and the set of soft bi-hyperideals of K is totally ordered by inclusion.
In classical mathematics, all the mathematical formulas and methods are exact which cannot deal with the problems of having uncertainty and incomplete data. Many theories are presented by scientists to tackle such complications such as the vague set theory [1], interval mathematics [2], rough set theory [3,4] and fuzzy set theory [5,6]. According to fuzzy set theory, the problems with uncertainties are solved by use of membership functions. As time passes, many researchers noticed that there are no parameterization tools in the fuzzy set theory. In 1999, Molodtsov gave the idea of soft set to remove this inadequacy [7]. He offered parameters that are helpful to tackle the uncertainties occurring in medical diagnosis and decision making issues. In industrialized countries, the second most reason of cancer death of men is prostate cancer, which depends on elements like age, ethnic background, family cancer history, the level of prostate-specific antigen in blood etc. Many researchers are working to find the risk of prostate cancer with the help of fuzzy set and soft set theories [8].
Zakri et al. [9] have worked to diagnose the educational complications for students with the applications of soft sets and fuzzy sets. They created a survey of dismissed student in Saudi Arabia, Jazan University, Science Department Girls, Mathematic Department from 2009 to 2013, as given in the following table and find the risk of dismissed by using soft set. In Table 1, number of dismissed students is given. Figure 1 shows the graphical representation of this risk.
Year | 2009 | 2010 | 2011 | 2012 | 2013 |
No.ofdismissedstudents | 16 | 20 | 33 | 65 | 43 |
In 1934, at the 8th Congress of Scandinavian Mathematicians, a French Mathematician Marty gave a theory of algebraic hyperstructure [10]. For more applications and representation of hyperstructures, see [11,12,13] respectively. In schools, especially at basic level, both academic skills and teacher trainings are not enough to reach required and good consequences unless there is a coperative, pleasent, kind and positive relationship. These associations between students are expected preconditions for organizing interferences focused to get appropriate teaching and learning ability. Consider a set K consisting of students of a specific classroom S. Due to a scientific approach to the relationship between students in a classroom, a final set of relationships R is determined. Initially, several researchers studied social relationships within a school by using a set of binary relations. The most efficient teaching methods within a classroom have also been studied in [14] by using hyperoperations. If n is the number of members of the class, to apply this method it is necessary to propose 2nd meetings for interviews (as for a football league with n teams). This technique is used to get hyperstructures associated with the class and is therefore very significant.
In a book by Corsini and Leoreanu [15], there are a lot of applications of algebraic hyperstructures in the fields of cryptography, geometry, automata, median algebras, relation algebras, artificial intelligence, hypergraphs, binary relations, probabilities, lattices, rough sets, fuzzy sets and codes. Algebraic hyperstructures are studied in many countries of Europe, America and Asia. Also, fuzzy hyperstructure is studied by many researchers [16]. The researchers are attracted to hyperstructures due to their distinctive property that hyperstructure multiplication of any two entries of a set is a set. Usually, the multiplication of any two entries of a set is an entry which belongs to that set. Because of the multi-valued property, hyperstructures are better than the common structures, which give all the possible results of a problem between individuals.
In 1932, ternary algebraic structure was first studied by D. H. Lehmer [17]. To deal with the mathematical frameworks that are not closed under binary operation, we have used ternary operation. For example, A={−i,0,i} is a semigroup under ternary multiplication. Also Z+(non-negative integers) is a semigroup because it is closed under binary multiplication while Z−(negative integers) does not close under binary multiplication, but it is closed under ternary multiplication that results in the formation of a ternary semigroup. An algebraic structure with one associative hyperoperation is called ternary semihypergroup and it is a specific case of an n-ary semihypergroup for n = 3 [18]. A semihypergroup can be reduced to ternary semihypergroup while converse may not be true as a ternary semihypergroup may not be semihypergroup under usual multiplication. Bashir and Du worked on ordered and fuzzy ordered ternary semigroup [19,20]. Continuing this work, Bashir et al. studied bipolar fuzzy ideals of ordered ternary semigroup [21], rough fuzzy ideals of ternary semigroup [22] and bipolar fuzzy ideals of ternary semiring [23].
After introducing the concept of soft set, Molodtsov gave soft sets techniques in 2006 [24]. This theory is studied in different directions by Naz and Shabir [25,26]. Tripathy applied soft sets in game theory [27]. The study of operations of soft set is given by Sezgin et al. [28,29]. Many operations on soft sets are also studied in [30,31]. The comparison of soft sets to fuzzy sets and rough sets is given by Feng et al. [32]. Aktas and Cagman applied soft set on group [33]. Davvaz [34] has done work on soft semihypergroups. Shabir and Kanwal [35] worked on prime bi-ideals of semigroups in 2007. Shabir and Bashir worked on prime ideals in ternary semigroup [36]. Later on, Shabir et al. [37] studied prime fuzzy bi-ideals of semigroup in 2010. Bashir et al. studied prime bi-ideals in ternary semiring [38]. Then, Mehmood [39] studied prime fuzzy bi-hyperideals of a semihypergroup in 2012. Hila and Naka [40,41,42] worked on hyperideals of ternary semihypergroup. Shabir and Naz [43] presented prime soft bi-hyperideals of semihypergroup. In this paper, we have enhanced the work of [43] and transformed all the definitions, propositions and theorems of [43] in ternary semihypergroups and studied on primeness of soft bi-hyperideals of ternary semihypergroups.
This paper is organized as follows in Figure 2.
The acronyms are listed below in Table 2
Acronyms | Representation |
TSHG | Ternary subsemihypergroup |
SSHG | Soft subsemihypergroup |
SBHI | Soft bi-hyperideal |
PSBHI | Prime soft bi-hyperideal |
SPSBHI | Strongly prime soft bi-hyperideal |
SSBHI | Semiprime soft bi-hyperideal |
ISBHI | Irreducible soft bi-hyperideal |
SISBHI | Strongly irreducible soft bi-hyperideal |
iff | If and only if |
Some basic definitions and notions are presented here.
Let K be a non-empty set and P(K) be the power set of K. A pair (K,∘) is called a hypergroupoid if ∘:K×K→P(K) is a hyperoperation on K. If A and B are non-empty subsets of K and x∈K, then x∘A={x}∘A, A∘x=A∘{x} and A∘B=∪a∈A,b∈Ba∘b. Additionally, (K,∘) is called a semihypergroup if K is hypergroupoid and for all l,m,n∈K, (l∘m)∘n=l∘(m∘n) [40].
The motivating example is as follow: Let K be a semigroup and S be any subsemigroup of K. Then K/S={x∗S | x∈K} becomes a semihypergroup under the hyperoperation "∘" is defined as (x∗S)∘(y∗S)={z∗S;z∈(x∗S)∗(y∗S)} for all x∗S,y∗S∈K/S [44].
By a subset we always mean a non-empty one. A mapping f:K×K×K→P(K) is called a ternary hyperoperation on K if L, M, N are subsets of K, then f(L,M,N)=∪l∈L,m∈M,n∈Nf(l,m,n). A non-empty set with ternary hyperoperation (K,∘) is known as a ternary semihypergroup if for every l,m,n,p,q∈K we have, (l∘m∘n)∘p∘q=l∘(m∘n∘p)∘q=l∘m∘(n∘p∘q). A subset M of ternary semihypergroup (K,∘) is said to be a ternary subsemihypergroup (TSHG) of K iff M∘M∘M⊆M. A subset M of ternary semihypergroup K is called a left (lateral, right respectively) hyperideal of K if K∘K∘M⊆M(K∘M∘K⊆M,M∘K∘K⊆M,respectively). Additionally, if M is left, lateral and right hyperideal of K, then M is called an hyperideal of K. In ternary semihypergroup (K,∘), an element 0 is called a zero element if for all l, m∈K, (0∘l∘m)=(l∘0∘m)=(l∘m∘0)={0}. An element e in TSHG (K,∘) is known as a left identity element, if for any l∈K, (e∘e∘l)={l}. Additionally, e∈K is known as an identity element of K if for any l∈K, (l∘e∘e)=(e∘l∘e)=(e∘e∘l)={l} [45]. A subsemihypergroup M of K is called a bi-hyperideal of K if (M∘K∘M∘K∘M)⊆M [46].
Throughout, in this paper ternary semihypergroup is represented by K, Universal set is U, powerset of U is P(U) and R,S,T are non-empty subsets of K. Also, C(U) denotes the collection of all soft sets of K over U and B(U) denotes the set of all SBHIs of K over U.
A soft set fR over U is a function fR:K→P(U) such that fR(x)=Φ if x∉R and its representation is given as fR={(x,fR(x)):x∈K,fR(x)∈P(U)}. Let fR, fS∈C(U) and if for all x∈K, fR(x)⊆fS(x) then fR is a soft subset of fS and it is denoted by fR˜⊆fS. If fS˜⊇fR and fS˜⊆fR, then fR≅fS. Let fR, fS∈C(U), then union of fR and fS is denoted by fR˜∪fS=fR∪S, where fR∪S(x)=fR(x)∪fS(x) for all x∈K. Let fR, fS∈C(U), then intersection of fR and fS is denoted by fR˜∩fS=fR∪S where fR∩S(x)=fR(x)∩fS(x) for all x∈K [43].
Example 2.1. Consider a soft set fR, which shows the "attractiveness of cars" for purchase. Suppose that there are five cars in the universal set U, that isU={k1,k2,k3,k4,k5} and R={r1,r2,r3,r4} is a set of decision parameters, whereri(i=1,2,3,4) are the parameters "expensive", "beautiful", "damaged" and "cheap" respectively. Consider a mappingf :R→P(U). Suppose thatf(r1)={k1,k2},f(r2)={k1,k2,k5},f(r3)={k3},f(r4)={k3,k4}. The parameterized family{f(ri),i=1,2,3,4} can be seen as a collection of approximations:
fR={expensive cars={k1,k2},beautiful cars={k1,k2,k5},damaged cars={k3},cheap cars={k3,k4}}. |
Also, this soft set is expressed in a tabular form as given in Table 3.
U | r1 | r2 | r3 | r4 |
k1 | 1 | 1 | 0 | 0 |
k2 | 1 | 1 | 0 | 0 |
k3 | 0 | 0 | 1 | 1 |
k4 | 0 | 0 | 0 | 1 |
k5 | 0 | 1 | 0 | 0 |
To store a soft set in a computer, tabular representation is very useful.
Ternary product of any three soft sets is defined as below.
For fR, gS, hT∈C(U) and x∈K, soft ternay product is defined as
(fR∗gS∗hT)(x)={∪x∈l∘m∘n{fR(l)∩gS(m)∩hT(n)}Φif there existl,m,n∈Ksuch thatx∈l∘m∘notherwise. |
If we define Ax={(l,m,n)∈K×K×K:x∈l∘m∘n}, then fR∗gS∗hT is stated as
(fR∗gS∗hT)(x)={∪x∈l∘m∘n{fR(l)∩gS(m)∩hT(n)}Φif Ax≠Φif Ax=Φ. |
For each l,m,n∈K, fR∈C(U), is said to be a soft subsemihypergroup (SSHG) of K over U if ∩x∈l∘m∘n{fR(x)}⊇fR(l)∩fR(m)∩fR(n). Additionally, fR∈C(U) is said to be a soft left (lateral, right respectively) hyperideal of K over U if for all l,m,n∈K, fR(n)⊆∩x∈l∘m∘n{fR(x)}(fR(m)⊆∩x∈l∘m∘n{fR(x)},fR(l)⊆∩x∈l∘m∘n{fR(x)}respectively). If fR is a soft left, lateral and right hyperideal of K over U, then it is called a soft hyperideal of K over U. A soft hyperideal fR of K over U is said to be a SBHI of K if for all l,m,n,p,q∈K,∩x∈l∘p∘m∘q∘n{fR(x)}⊇fR(l)∩fR(m)∩fR(n). For a soft set fR of K over U, upper ζ-inclusion of fR is defined as U(fR,ζ)={x∈K:fR(x)⊇ζ}. It can be easily seen that B(U) is closed under ternary product and it is closed under arbitrary intersection.
Proposition 2.2. A soft set fR is a TSHG of K over U iff fR∗fR∗fR˜⊆fR.
Proof. Straightforward.
In this part, PSBHIs, SPSBHIs, SSBHIs, ISBHIs, SISBHIs of ternary semihypergroup K over U are studied and characterized ternary semihypergroup under the structure of softness. Also for better understanding, we have given an example of PSBHIs and SPSBHIs. Here, Bi(≠Φ)⊆K for all i.
Definition 3.1. A SBHI fB∈B(U) is called prime if lB1∗gB2∗hB3˜⊆fB, implies lB1˜⊆fB, gB2˜⊆fBorhB3˜⊆fB for all lB1, gB2, hB3 ∈B(U).
Example 3.2. Let K={r1,r2,r3,r4} be a ternary semihypergroup under the operation ∘ defined as (r1∘r2∘r3)=(r1∘r2)∘r3 and given in Table 4.
∘ | r1 | r2 | r3 | r4 |
r1 | {r1} | {r1} | {r1} | {r1} |
r2 | {r1} | {r1} | {r1} | {r1} |
r3 | {r1} | {r1} | {r1,r2} | {r1,r2} |
r4 | {r1} | {r1} | {r1,r2} | {r1,r2} |
Here, A={r1}, B={r1,r2}, C={r1,r2,r3}, D={r1,r2,r4} and K are bi-hyperideals of K. Let U={1,2,3} and define fA(r1)={1,2}, fA(r2)= fA(r3)=fA(r4)=Φ. Then
U(fA,ζ)={{r1} if ζ={1}{r1} if ζ={2}Φ if ζ={3}{r1} if ζ={1,2}Φ if ζ={1,3}Φ if ζ={2,3}Φ if ζ={1,2,3}. |
Since U(fA,ζ) is bi-hyperideal of K. So, fA is a SBHI of K. Now, define gB(r1)={1,2,3}, gB(r2)={1,2}, gB(r3)=gB(r4)=Φ. Then
U(gB,ζ)={{r1,r2}{r1,r2}{r1}{r1,r2}{r1}{r1}{r1} if ζ={1} if ζ={2} if ζ={3} if ζ={1,2} if ζ={1,3} if ζ={2,3} if ζ={1,2,3}. |
So, gB is a SBHI of K. Now, define hC(r1)={1,2}, hC(r2)={1,2}, hC(r3)={1}, hC(r4)=Φ. Then
U(hC,ζ)={{r1,r2,r3} if ζ={1}{r1,r2} if ζ={2}Φ if ζ={3}{r1,r2} if ζ={1,2}Φ if ζ={1,3}Φ if ζ={2,3}Φ if ζ={1,2,3}. |
So, hC is a SBHI of K. Now, define jD(r1)={1,2}, jD(r2)={1}, jD(r3)=Φ, jD(r4)={1}. Then
U(jD,ζ)={{r1,r2,r4} if ζ={1}{r1} if ζ={2}Φ if ζ={3}{r1} if ζ={1,2}Φ if ζ={1,3}Φ if ζ={2,3}Φ if ζ={1,2,3}. |
So, jD is a SBHI of K.
It is easy to see that gB, hC and jD are PSBHIs of K while fA is not PSBHI of K. The reason is that gB∗hC∗jD˜⊆fA, but gB˜⊈fA, hC˜⊈fA and jD˜⊈fA.
Definition 3.3. A SBHI fB∈B(U) is called SPSBHI of K over U if (lB1∗gB2∗hB3)˜∩(gB2∗hB3∗lB1)˜∩(hB3∗lB1∗gB2)˜⊆fB implies lB1˜⊆fB, gB2˜⊆fBorhB3˜⊆fB for all lB1, gB2, hB3 ∈B(U).
Definition 3.4. A SBHI fB ∈B(U) is called semiprime if gB1∗gB1∗gB1˜⊆fB implies gB1˜⊆fBfor all gB1 ∈B(U).
Remark 3.5. For any ternary semihypergroup K over U, every PSBHI is a SSBHI but its counter does not exist.
Proposition 3.6. Let {fRi:i∈I} be a collection of PSBHIs of K, then ∼∩i∈IfRi is SSBHI of K.
Proof. For all fRi∈B(U) where i∈I, ∼∩i∈IfRi∈B(U). Now let gB∈B(U) such that gB∗gB∗gB˜⊆∼∩i∈IfRi. Then, gB∗gB∗gB˜⊆fRi for all i∈I. As given fRi is PSBHI of K for all i∈I. This implies fRi is SSBHI of K for all i∈I. So, gB˜⊆fRi for all i∈I, this implies gB˜⊆∼∩i∈IfRi. Hence proved.
Definition 3.7. A SBHI fR ∈B(U) is said to be an irreducible (strongly irreducible) if gB1˜∩hB2˜∩lB3≅fR, (gB1˜∩hB2˜∩lB3˜⊆fR) implies either gB1≅fR or hB2≅fR or lB3≅fR, (gB1˜⊆fR or hB2˜⊆fR or lB3˜⊆fR) respectively, for all gB1, hB2, lB3 ∈B(U).
Proposition 3.8. If fR is a strongly irreducible semiprime-SBHI of K, then it is SPSBHI of K.
Proof. To prove fR be a SPSBHI of K, consider
(gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2)˜⊆fBwhere gB1, hB2, lB3∈B(U). Also, (gB1˜∩hB2˜∩lB3)∈B(U).
(gB1˜∩hB2˜∩lB3)∗(hB2˜∩lB3˜∩gB1)∗(lB3˜∩gB1˜∩hB2)˜⊆(gB1∗hB2∗lB3) and (gB1˜∩hB2˜∩lB3)∗(hB2˜∩lB3˜∩gB1)∗(lB3˜∩gB1˜∩hB2)˜⊆(hB2∗lB3∗gB1) and (gB1˜∩hB2˜∩lB3)∗(hB2˜∩lB3˜∩gB1)∗(lB3˜∩gB1˜∩hB2)˜⊆(lB3∗gB1∗hB2).
Thus, (gB1˜∩hB2˜∩lB3)∗(hB2˜∩lB3˜∩gB1)∗(lB3˜∩gB1˜∩hB2)˜⊆(gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2)˜⊆fR. Since fR is SSBHI of K, then (gB1˜∩hB2˜∩lB3)˜⊆fR. Also fR is SISBHI of K, so either gB1˜⊆fR or hB2˜⊆fR or lB3˜⊆fR. Thus, proved.
Proposition 3.9. Let fR ∈B(U) with fR(x)=T where x ∈K and T∈P(U), then there exists an ISBHI lB of K such that fR˜⊆lB and lB(x)=T.
Proof. Let X={hS:hS∈B(U),hS(x)=TwhereT∈P(U)andfR˜⊆hS} be a partially ordered set under inclusion. Then X≠Φ, since fR∈X. Let V={hSi:i∈I} be a subset of X which is totally ordered. Consider, for all a,b,c∈K and x∈l∘m∘n.
∩x∈l∘m∘n(∼∪i∈IhSi)(x)=∪i∈I(∩x∈l∘m∘nhSi(x)) |
⊇∪i∈I(hSi(l)∩hSi(m)∩hSi(n)) |
={∪i∈I(hSi(l))}∩{∪i∈I(hSi(m))}∩{∪i∈I(hSi(n))} |
=(∼∪i∈IhSi)(l)∩(∼∪i∈IhSi)(m)∩(∼∪i∈IhSi)(n). |
So, ∼∪i∈IhSi is a TSSHG of K over U.
Now, for all l,m,n,p,q∈K and y∈l∘p∘m∘q∘n.
∩y∈l∘p∘m∘q∘n(∼∪i∈IhSi)(y)=∪i∈I(∩y∈l∘p∘m∘q∘nhSi(y)) |
⊇∪i∈I(hSi(l)∩hSi(m)∩hSi(n)) |
={∪i∈I(hSi(l))}∩{∪i∈I(hSi(m))}∩{∪i∈I(hSi(n))} |
=(∼∪i∈IhSi)(l)∩(∼∪i∈IhSi)(m)∩(∼∪i∈IhSi)(n). |
Hence, ∼∪i∈IhSi is SBHI of K. As fR˜⊆hSi for all i∈I, so fR˜⊆∼∪i∈IhSi. Also (∼∪i∈IhSi)(x)=∪i∈I(hSi)(x)=T. Thus, ∼∪i∈IhSi is the supremum of V. So, there exists a SBHI lB of K that is maximal, fR˜⊆lB and lB(x)=T. Now we have to prove that lB is an irreducible. Suppose lB≅dB1˜∩gB2˜∩jB3 where dB1,gB2 and jB3 are SBHIs of K. Then lB˜⊆dB1 or lB˜⊆gB2 or lB˜⊆jB3. We claim that lB≅dB1 or lB≅ gB2 or lB≅jB3. Suppose on contrary that lB≆dB1 and lB≆gB2 and lB≆jB3. Since lB is maximal with respect to the property that lB(x)=T. It follows that dB1(x)≠T,gB2(x)≠T and jB3(x)≠T. This implies T=lB(x)=dB1˜∩gB2˜∩jB3(x)≠T. Which is a contradiction. Hence either lB≅dB1 or lB≅gB2 or lB≅jB3. Hence proved.
Theorem 3.10. For a ternary semihypergroup K, there is a correspondence between the following statements.
(1) fB∗fB∗fB≅fB for all fB∈B(U).
(2) (gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2)≅gB1˜∩hB2˜∩lB3 for all gB1,hB2 and lB3∈B(U).
(3) Every fB ∈B(U) is semiprime i.e., gB1∗gB1∗gB1˜⊆fB implies gB1˜⊆fB for all gB1∈B(U).
(4) Every proper SBHI fB∈B(U) is the intersection of all irreducible semiprime SBHIs of K which are the supersets of fB.
Proof. (1)⇒(2). Let gB1,hB2,lB3∈B(U), then gB1˜∩hB2˜∩lB3∈B(U). By supposition
(gB1˜∩hB2˜∩lB3)≅(gB1˜∩hB2˜∩lB3)3 |
≅(gB1˜∩hB2˜∩lB3)∗(gB1˜∩hB2˜∩lB3)∗(gB1˜∩hB2˜∩lB3) |
˜⊆(gB1∗hB2∗lB3). |
Similarly, (gB1˜∩hB2˜∩lB3)˜⊆(hB2∗lB3∗gB1) and (gB1˜∩hB2˜∩lB3)˜⊆(lB3∗gB1∗hB2).
So, (gB1˜∩hB2˜∩lB3)˜⊆(gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2).
Conversely, (gB1∗hB2∗lB3),(hB2∗lB3∗gB1) and (lB3∗gB1∗hB2) are SBHIs of K. Also, (gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2) is a SBHI of K. Then, consider
(gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2) |
≅((gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2))3 |
˜⊆(gB1∗hB2∗lB3)(hB2∗lB3∗gB1)(lB3∗gB1∗hB2) |
˜⊆(gB1∗gK∗gK)(gK∗gB1∗gK)(gK∗gK∗gB1) |
≅gB1∗(gK∗gK∗gK)∗gB1∗(gK∗gK∗gK)∗gB1 |
˜⊆gB1∗gK∗gB1∗gK∗gB1˜⊆gB1. |
Similarly, (gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2)˜⊆hB2 and (gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2)˜⊆lB3.
Thus, (gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2)˜⊆gB1˜∩hB2˜∩lB3.
Hence, (gB1∗hB2∗lB3)˜∩(hB2∗lB3∗gB1)˜∩(lB3∗gB1∗hB2)≅gB1˜∩hB2˜∩lB3.
(2)⇒(1). Let gB1 be a SBHI of K. Then
gB1≅gB1˜∩gB1˜∩gB1 |
≅(gB1∗gB1∗gB1)˜∩(gB1∗gB1∗gB1)˜∩(gB1∗gB1∗gB1) |
≅gB1∗gB1∗gB1. |
So, gB1 is idempotent.
(1)⇒(3). Let fB∈B(U). To prove fB is semiprime, consider gB1∗gB1∗gB1˜⊆fB for any gB1∈B(U). Then, by supposition gB1≅gB1∗gB1∗gB1˜⊆fB. Implies, gB1˜⊆fB. Hence proved.
(3)⇒(4). Let {fBi:i∈I} be a family of all ISBHIs of K which are the supersets of fB. Then, fB˜⊆∼∩i∈IfBi. Now, let x∈K. Then by Proposition 3.9, there is an ISBHI fB of K such that fB(x)=fBα(x). Thus, fBα∈{fBi:i∈I}. Hence, ∼∩i∈IfBi˜⊆fBa. So, ∼∩i∈IfBi(x)⊆fBa(x)⊆fB(x). Thus, ∼∩i∈IfBi˜⊆fB. Consequently, ∼∩i∈IfBi≅fB.
(4)⇒(1). By Proposition 2.2, fB∗fB∗fB˜⊆fB for all fB∈B(U). By supposition, fB∗fB∗fB≅∼∩i∈IfBi where fBi are irreducible semiprime soft bi-hyperideals of K for all i∈I. Thus, fB∗fB∗fB˜⊆fBi for all i. Hence, fB˜⊆fBi for all i because each fBi is semiprime. Thus, fB˜⊆∼∩i∈IfBi≅fB∗fB∗fB. Hence fB is idempotent.
Theorem 3.11. Each SBHI fK∈B(U) is strongly prime iff it is idempotent and B(U) is totally ordered by inclusion.
Proof. First, suppose that each SBHI of K is strongly prime, then it is semiprime. Thus by Theorem 3.10, each SBHI is idempotent. Let fB1,fB2∈B(U), then
fB1˜∩fB2˜∩fk≅(fB1∗fB2∗fk)˜∩(fB2∗fk∗fB1)˜∩(fk∗fB1∗fB2). |
Implies
(fB1∗fB2∗fk)˜∩(fB2∗fk∗fB1)˜∩(fk∗fB1∗fB2)˜⊆(fB1˜∩fB2). |
By hypothesis, fB1,fB2 are SPSBHIs of K, so is (fB1˜∩fB2).
Then fB1˜⊆fB1˜∩fB2 or fB2˜⊆fB1˜∩fB2 or fk˜⊆fB1˜∩fB2. Thus, fB1˜⊆fB2 or fB2˜⊆fB1. Since fB1,fB2 are arbitrary SBHIs of K, so B(U), the set of SBHIs of K is totally ordered by inclusion.
Conversely, let fB be any SBHI of K and fB1,fB2,fB3∈B(U) such that
(fB1∗fB2∗fB3)˜∩(fB2∗fB3∗fB1)˜∩(fB3∗fB1∗fB2)˜⊆fB. |
By Theorem 3.10, we have
fB1˜∩fB2˜∩fB3≅(fB1∗fB2∗fB3)˜∩(fB2∗fB3∗fB1)˜∩(fB3∗fB1∗fB2)˜⊆fB. |
From our supposition, by using the property of inclusion, there are the following six possibilities.
(i) fB1˜⊆fB2˜⊆fB3 (ii) fB1˜⊆fB3˜⊆fB2 (iii) fB2˜⊆fB3˜⊆fB1.
(iv) fB2˜⊆fB1˜⊆fB3 (v) fB3˜⊆fB1˜⊆fB2 (iv) fB3˜⊆fB2˜⊆fB1.
In these cases, we have
(i)fB1˜∩fB2˜∩fB3≅fB1 (ii) fB1˜∩fB2˜∩fB3≅fB1 (iii) fB1˜∩fB2˜∩fB3≅fB2.
(iv) fB1˜∩fB2˜∩fB3≅fB2 (v) fB1˜∩fB2˜∩fB3≅fB3 (iv) fB1˜∩fB2˜∩fB3≅fB3.
Hence, according to each case either fB1˜⊆fB2 or fB2˜⊆fB1 or fB3˜⊆fB Hence, fB is strongly prime.
Theorem 3.12. Let B(U) be a totally ordered set under inclusion, then each SBHI of K is idempotent iff it is prime.
Proof. Suppose that any fB∈B(U) is idempotent and let fB1,fB2,fB3∈B(U) such that
fB1∗fB2∗fB3˜⊆fB. |
From our supposition, by using the property of inclusion, there are the following six possibilities.
(i)fB1˜⊆fB2˜⊆fB3 (ii) fB1˜⊆fB3˜⊆fB2 (iii) fB2˜⊆fB3˜⊆fB1.
(v) fB2˜⊆fB1˜⊆fB3 (v) fB3˜⊆fB1˜⊆fB2 (iv) fB3˜⊆fB2˜⊆fB1.
From (ⅰ) and (ⅱ), we have
fB1=fB1∗fB1∗fB1˜⊆fB1∗fB2∗fB3˜⊆fB implies fB1˜⊆fB as fB1 is idempotent.
Similarly, for other choices we have fB2˜⊆fB or fB3˜⊆fB. So, fB is prime.
Conversely, suppose that each SBHI of K is prime, so by Remark 3.5, it is semiprime. Thus by Theorem 3.10, each SBHI of K is idempotent.
Theorem 3.13. Let B(U) be a totally ordered set under inclusion, then each PSBHI of K is equivalent to strongly prime.
Proof. Suppose fB is a PSBHI of K. To prove that fB is a SPSBHI of K, let fB1,fB2,fB3∈B(U) such that
(fB1∗fB2∗fB3)˜∩(fB2∗fB3∗fB1)˜∩(fB3∗fB1∗fB2)˜⊆fB. |
From our supposition, by using the property of inclusion, there are the following six possibilities.
(i)fB1˜⊆fB2˜⊆fB3 (ii) fB1˜⊆fB3˜⊆fB2 (iii) fB2˜⊆fB3˜⊆fB1.
(vi) fB2˜⊆fB1˜⊆fB3 (v) fB3˜⊆fB1˜⊆fB2 (iv) fB3˜⊆fB2˜⊆fB1.
From (ⅰ) and (ⅱ) we have,
f3B1≅f3B1˜∩f3B1˜∩f3B1˜⊆(fB1∗fB2∗fB3)˜∩(fB2∗fB3∗fB1)˜∩(fB3∗fB1∗fB2)˜⊆fB. |
Implies fB1˜⊆fB. Similarly, we have fB2˜⊆fB or fB1˜⊆fB. So fB is strongly prime.
Conversely, suppose fB is a SPSBHI of K over U. Now we have to prove that fB is PSBHI of K. For this consider,
fB1∗fB2∗fB3˜⊆fB. Implies
(fB1∗fB2∗fB3)˜∩(fB2∗fB3∗fB1)˜∩(fB3∗fB1∗fB2)˜⊆fB1∗fB2∗fB3˜⊆fB. |
Implies either fB1˜⊆fB or fB2˜⊆fB or fB3˜⊆fB. As fB is SPSBHI of K. This shows that fB is a PSBHI of K. Thus every SPSBHI ofK is a PSBHI of K.
Theorem 3.14. Let gB∈B(U), then the following statements are equivalent.
(1)B(U) is totally ordered by inclusion.
(2)gB is strongly irreducible.
(3)gB is irreducible.
Proof. (1)⇒(2). To prove that gB is a strongly irreducible, let gB1,gB2,gB3∈B(U) such that
gB1˜∩gB2˜∩gB3˜⊆gB. |
By our supposition, gB1˜∩gB2˜∩gB3≅gB1or gB2 or gB3. Thus, either gB1˜⊆gB or gB2˜⊆gB or gB3˜⊆gB. So gB is strongly irreducible.
(2)⇒(3). To show that gB is an irreducible, let gB1,gB2,gB3 be any three SBHIs of K such that gB1˜∩gB2˜∩gB3˜⊆gB. Implies gB˜⊆gB1 or gB˜⊆gB2 or gB˜⊆gB3.
And by hypothesis we have, gB1˜⊆gB or gB2˜⊆gB or gB3˜⊆gB. Hence either, gB1≅gB or gB2≅gB or gB3≅gB. Thus, gB is irreducible. Hence, each SBHI of K is irreducible.
(3)⇒(1). Let gB1,gB2∈B(U). Then, gB1˜∩gB2∈B(U) and so is irreducible. Consider, gB1˜∩gB2˜∩gK≅gB1˜∩gB2, implies gB1≅gB1˜∩gB2 or gB2≅gB1˜∩gB2 or gK≅gB1˜∩gB2. Implies either gB1˜⊆gB2 or gB2˜⊆gB1. Hence, B(U) is totally ordered by inclusion.
Hyperstructures are better than the common structures because of the multi-valued property, which give all the possible results of a problem between individuals. In this section, we describe how this research work is better and related to previous work. In [43], Naz studied the PSBHIs of semihypergroups. By extending the work of [43], we worked on ternary semihypergroups. We introduced PSBHIs in ternary semihypergroups. This technique is more useful than [43] because there are many algebraic structures that are not closed under binary multiplication but closed under ternary multiplication, such as Z- (set of negative integers), Q- (set of negative rational numbers) and R- (set of negative real numbers). To remove this difficulty, we studied the ternary operation, and have generalized all results in ternary semihypergroup. Hence, the technique used in this paper is more general than previous.
Molodtsov initiated the idea of soft set theory for solving the problems with uncertainty. In this paper, we use the concept of soft set theory on ternary algebraic structure. We generalized the work of [43] to ternary framework. Many related theorems, propositions and examples are discussed here with ternary hyperoperation. We generalize the ternary semihypergroups by the characterizations of PSBHIs. The main advantage of this paper is that we have proved with ternary operation that each SBHI of K is strongly prime iff, it is idempotent and the set of SBHIs of K is totally ordered by inclusion.
If data is incomplete and uncertain, the above technique is not appropriate. For this, we will use parameterization tool with fuzzy set and bipolar fuzzy set. In the future, based on these results, we will apply soft sets to bipolar fuzzy hyperideals in ternary semihypergroups and extend it to the structure of soft semihyperrings and soft ternary semihyperrings in a similar way.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The authors present their appreciation to King Saud University for funding this research through "Researchers supporting Project (Project number: RSPD2023R650), King Saud University, Riyadh, Saudi Arabia".
The authors declare that they have no conflict of interest.
[1] |
W. L. Gau, D. J. Buehrer, Vague sets, IEEE T. Syst. Man Cy-S., 23 (1993), 610–614. https://doi.org/10.1109/21.229476 doi: 10.1109/21.229476
![]() |
[2] |
M. B. Gorzalzany, A method of inference in approximate reasoning based on interval-valued fuzzy sets, Fuzzy Set. Syst., 21 (1987), 1–17. https://doi.org/10.1016/0165-0114(87)90148-5 doi: 10.1016/0165-0114(87)90148-5
![]() |
[3] |
Z. Pawlak, Rough sets, Inter. J. Inform. Comput. Sci., 11 (1982), 341–356. https://doi.org/10.1007/BF01001956 doi: 10.1007/BF01001956
![]() |
[4] |
Z. Pawlak, A. Skoworn, Rudiments of rough sets, Inform. Sciences, 177 (2007), 3–27. https://doi.org/10.1016/j.ins.2006.06.003 doi: 10.1016/j.ins.2006.06.003
![]() |
[5] |
L. A. Zadeh, Fuzzy sets, Inform. Control, 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
![]() |
[6] | L. A. Zadeh, Toward a generalized theory of uncertainty (GTU)-an outline, Inform. Sciences, 172 (2005), 1–40. |
[7] |
D. Molodtsov, Soft set theory-first results, Comput. Math. Appl., 37 (1999), 19–31. https://doi.org/10.1016/S0898-1221(99)00056-5 doi: 10.1016/S0898-1221(99)00056-5
![]() |
[8] |
S. Yuksel, T. Dizman, G. Yildizdan, U. Sert, Application of soft sets to diagnose the prostate cancer risk, J. Inequal. Appl., 229 (2013), 1–11. https://doi.org/10.1186/1029-242X-2013-229 doi: 10.1186/1029-242X-2013-229
![]() |
[9] |
A. H. Zakri, H. M. Hossen, L. Y. Erwi, E. Al-Sharif, Application of soft sets to diagnose the educational obstacles for students, J. Innov. Technol. Educ., 3 (2016), 61–70. https://doi.org/10.12988/jite.2016.626 doi: 10.12988/jite.2016.626
![]() |
[10] | F. Marty, Sur une generalization de la notion de groups, In: 8th Congress Math, Scandinaves, Stockholm, 1934, 45–49. |
[11] | P. Corsini, Prolegomena of hypergroup theory, Tricesimo: Aviani Editore, 1993. |
[12] | B. Davvaz, V. L. Fotea, Hyperring theory and applications, USA: International Academic Press, 2007. |
[13] | T. Vougiouklis, Hyperstructures and their representations, Palm Harbor: Hadronic Press, 1994. |
[14] | S. Hoskova-Mayerova, A. Maturo, On some applications of algebraic hyperstructures for the management of teaching and relationships in schools, Ital. J. Pure Appl. Math., 41 (2019), 584–592. |
[15] | P. Corsini, V. Leoreanu, Applications of hyperstructure theory, Advances in Mathematics, Kluwer Academic Publisher, 2003. https://doi.org/10.1007/978-1-4757-3714-1 |
[16] | I. Cristea, S. Hoskova, Fuzzy pseudotopological hypergroupoids, Iran. J. Fuzzy Syst., 6 (2009), 11–19. |
[17] |
D. H. Lehmer, A ternary analogue of abelian groups, Am. J. Math., 54 (1932), 329–338. https://doi.org/10.2307/2370997 doi: 10.2307/2370997
![]() |
[18] |
B. Davvaz, W. A. Dudek, S. Mirvakili, Neutral elements, fundamental relations and n-ary hypersemigroups, Int. J. Algebra Comput., 19 (2009), 567–583. https://doi.org/10.1142/S0218196709005226 doi: 10.1142/S0218196709005226
![]() |
[19] |
S. Bashir, X. Du, On weakly regular fuzzy ordered ternary semigroups, Appl. Math. Inform. Sci., 10 (2016), 2247–2254. https://doi.org/10.18576/amis/100627 doi: 10.18576/amis/100627
![]() |
[20] |
S. Bashir, X. Du, Intra-regular and weakly regular ordered ternary semigroups, Annals Fuzzy Math. Inform., 13 (2017), 539–551. https://doi.org/10.30948/afmi.2017.13.4.539 doi: 10.30948/afmi.2017.13.4.539
![]() |
[21] |
S. Bashir, M. Fatima, M. Shabir, Regular ordered ternary semigroups in terms of bipolar fuzzy ideals, Mathematics, 7 (2019), 233. https://doi.org/10.3390/math7030233 doi: 10.3390/math7030233
![]() |
[22] |
S. Bashir, H. Abbas, R. Mazhar, M. Shabir, Rough fuzzy ternary subsemigroups based on fuzzy ideals with three-dimensional congruence relation, Comput. Appl. Math., 39 (2020), 1–16. https://doi.org/10.1007/s40314-020-1079-y doi: 10.1007/s40314-020-1079-y
![]() |
[23] |
S. Bashir, R. Mazhar, H. Abbas, M. Shabir, Regular ternary semirings in terms of bipolar fuzzy ideals, Comput. Appl. Math., 39 (2020), 1–18. https://doi.org/10.1007/s40314-020-01319-z doi: 10.1007/s40314-020-01319-z
![]() |
[24] | D. Molodtsov, V. Y. Leonov, D. V. Kovkov, Soft sets technique and its application, Nechetkie Sistemi I Myakie Vychisleniya, 1 (2006), 8–39. |
[25] | M. Naz, M. Shabir, Fuzzy soft sets and their algebraic structure, World Appl. Sci. J., 22 (2013), 45–61. |
[26] |
M. Shabir, M. Naz, On soft topological spaces, Comput. Math. Appl., 61 (2011), 1786–1799. https://doi.org/10.1016/j.camwa.2011.02.006 doi: 10.1016/j.camwa.2011.02.006
![]() |
[27] | B. K. Tripathy, T. R. Sooraj, R. N. Mohanty, Application of soft set in game theory, In: Advanced Methodologies and Technologies in Artificial Intelligence, Computer Simulation, and Human-Computer Interaction, 2019,421–435. https://doi.org/10.4018/978-1-5225-7368-5.ch031 |
[28] |
A. Sezgin, A. O. Atagün, N. Çağman, Soft intersection near-rings with its applications, Neural Comput. Appl., 21 (2012), 221–229. https://doi.org/10.1007/s00521-011-0782-4 doi: 10.1007/s00521-011-0782-4
![]() |
[29] |
A. Sezgin, A. O. Atagün, On operations of soft sets, Comput. Math. Appl., 61 (2011), 1457–1467. https://doi.org/10.1016/j.camwa.2011.01.018 doi: 10.1016/j.camwa.2011.01.018
![]() |
[30] |
P. K. Maji, R. Biswas, A. R. Roy, Soft set theory, Comput. Math. Appl., 45 (2003), 555–562. https://doi.org/10.1016/S0898-1221(03)00016-6 doi: 10.1016/S0898-1221(03)00016-6
![]() |
[31] |
M. I. Ali, F. Feng, X. Liu, W. K. Min, M. Shabir, On some new operations in soft set theory, Comput. Math. Appl., 57 (2009), 1547–1553. https://doi.org/10.1016/j.camwa.2008.11.009 doi: 10.1016/j.camwa.2008.11.009
![]() |
[32] |
F. Feng, C. Li, B. Davvaz, M. I. Ali, Soft sets combined with fuzzy sets and rough sets, Atentative approach, Soft Comput., 14 (2010), 899–911. https://doi.org/10.1007/s00500-009-0465-6 doi: 10.1007/s00500-009-0465-6
![]() |
[33] |
H. Aktas, N. Cagman, Soft sets and soft groups, Inform. Sci., 177 (2007), 2726–2735. https://doi.org/10.1016/j.ins.2006.12.008 doi: 10.1016/j.ins.2006.12.008
![]() |
[34] | S. M. Anvariyeh, S. Mirvakili, O. Kazanci, B. Davvaz, Algebraic hyperstructures of soft sets associated to semihypergroups, SE. Asian B. Math., 35 (2011), 911–925. |
[35] | M. Shabir, N. Kanwal, Prime bi-ideals of semigroups, SE. Asian B. Math., 31 (2007), 757–764. |
[36] |
M. Shabir, S. Bashir, Prime ideals in ternary semigroups, Asian-Eur. J. Math., 2 (2009), 141–154. https://doi.org/10.1142/S1793557109000121 doi: 10.1142/S1793557109000121
![]() |
[37] | M. Shabir, Y. B. Jun, M. Bano, On prime fuzzy bi-ideals of semigroups, Iran. J. Fuzzy Syst., 7 (2010), 115–128. |
[38] | S. Bashir, J. Mehmood, M. S. Kamran, Prime bi-ideals in ternary semirings, Ann. Fuzzy Math. Inform., 6 (2013), 181–189. |
[39] | T. Mahmood, Some contributions to semihypergroups, Ph.D. Thesis Quaid-i-Azam University, Islamabad, 2012. |
[40] | K. Hila, B. Davvaz, K. Naka, On hyperideal structure of ternary semihypergroups, Iran. J. Math. Sci. Info., 9 (2014), 81–98. |
[41] | K. Naka, K. Hila, On some special classes of hyperideals in ternary semihypergroups, Utilitas Mathematica, 98 (2015), 97–112. |
[42] |
K. Naka, K. Hila, Some properties of hyperideals in ternary semihypergroups, Math. Slovaca, 63 (2013), 449–468. https://doi.org/10.2478/s12175-013-0108-3 doi: 10.2478/s12175-013-0108-3
![]() |
[43] |
S. Naz, M. Shabir, On prime soft bi-hyperideals of semihypergroups, J. Int. Fuzzy Syst., 26 (2014), 1539–1546. https://doi.org/10.3233/IFS-130837 doi: 10.3233/IFS-130837
![]() |
[44] | B. Davvaz, Intuitionistic hyperideals of semihypergroups, Bull. Malays. Math. Sci. Soc., 29 (2006), 203–207. |
[45] |
B. Davvaz, V. Leoreanu, Binary relations on ternary semihypergroups, Commun. Algebra, 38 (2010), 3621–3636. https://doi.org/10.1080/00927870903200935 doi: 10.1080/00927870903200935
![]() |
[46] |
N. Yaqoob, M. Aslam, K. Hilla, Rough Fuzzy hyperideals in ternary semihypergroups, Adv. Fuzzy Syst., 2012 (2012). https://doi.org/10.1155/2012/595687 doi: 10.1155/2012/595687
![]() |
Year | 2009 | 2010 | 2011 | 2012 | 2013 |
No.ofdismissedstudents | 16 | 20 | 33 | 65 | 43 |
Acronyms | Representation |
TSHG | Ternary subsemihypergroup |
SSHG | Soft subsemihypergroup |
SBHI | Soft bi-hyperideal |
PSBHI | Prime soft bi-hyperideal |
SPSBHI | Strongly prime soft bi-hyperideal |
SSBHI | Semiprime soft bi-hyperideal |
ISBHI | Irreducible soft bi-hyperideal |
SISBHI | Strongly irreducible soft bi-hyperideal |
iff | If and only if |
U | r1 | r2 | r3 | r4 |
k1 | 1 | 1 | 0 | 0 |
k2 | 1 | 1 | 0 | 0 |
k3 | 0 | 0 | 1 | 1 |
k4 | 0 | 0 | 0 | 1 |
k5 | 0 | 1 | 0 | 0 |
∘ | r1 | r2 | r3 | r4 |
r1 | {r1} | {r1} | {r1} | {r1} |
r2 | {r1} | {r1} | {r1} | {r1} |
r3 | {r1} | {r1} | {r1,r2} | {r1,r2} |
r4 | {r1} | {r1} | {r1,r2} | {r1,r2} |
Year | 2009 | 2010 | 2011 | 2012 | 2013 |
No.ofdismissedstudents | 16 | 20 | 33 | 65 | 43 |
Acronyms | Representation |
TSHG | Ternary subsemihypergroup |
SSHG | Soft subsemihypergroup |
SBHI | Soft bi-hyperideal |
PSBHI | Prime soft bi-hyperideal |
SPSBHI | Strongly prime soft bi-hyperideal |
SSBHI | Semiprime soft bi-hyperideal |
ISBHI | Irreducible soft bi-hyperideal |
SISBHI | Strongly irreducible soft bi-hyperideal |
iff | If and only if |
U | r1 | r2 | r3 | r4 |
k1 | 1 | 1 | 0 | 0 |
k2 | 1 | 1 | 0 | 0 |
k3 | 0 | 0 | 1 | 1 |
k4 | 0 | 0 | 0 | 1 |
k5 | 0 | 1 | 0 | 0 |
∘ | r1 | r2 | r3 | r4 |
r1 | {r1} | {r1} | {r1} | {r1} |
r2 | {r1} | {r1} | {r1} | {r1} |
r3 | {r1} | {r1} | {r1,r2} | {r1,r2} |
r4 | {r1} | {r1} | {r1,r2} | {r1,r2} |