Loading [MathJax]/jax/output/SVG/jax.js
Research article

Covering cross-polytopes with smaller homothetic copies

  • Received: 30 November 2023 Revised: 08 January 2024 Accepted: 10 January 2024 Published: 11 January 2024
  • MSC : 52A20, 52C17, 52A15

  • Let Cn be an n-dimensional cross-polytope and Γp(Cn) be the smallest positive number γ such that Cn can be covered by p translates of γCn. We obtain better estimates of Γ2n(Cn) for small n and a universal upper bound of Γ2n(Cn) for all positive integers n.

    Citation: Feifei Chen, Shenghua Gao, Senlin Wu. Covering cross-polytopes with smaller homothetic copies[J]. AIMS Mathematics, 2024, 9(2): 4014-4020. doi: 10.3934/math.2024195

    Related Papers:

    [1] Asit Dey, Tapan Senapati, Madhumangal Pal, Guiyun Chen . A novel approach to hesitant multi-fuzzy soft set based decision-making. AIMS Mathematics, 2020, 5(3): 1985-2008. doi: 10.3934/math.2020132
    [2] Feng Feng, Zhe Wan, José Carlos R. Alcantud, Harish Garg . Three-way decision based on canonical soft sets of hesitant fuzzy sets. AIMS Mathematics, 2022, 7(2): 2061-2083. doi: 10.3934/math.2022118
    [3] Atiqe Ur Rahman, Muhammad Saeed, Hamiden Abd El-Wahed Khalifa, Walaa Abdullah Afifi . Decision making algorithmic techniques based on aggregation operations and similarity measures of possibility intuitionistic fuzzy hypersoft sets. AIMS Mathematics, 2022, 7(3): 3866-3895. doi: 10.3934/math.2022214
    [4] 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
    [5] S. Meenakshi, G. Muhiuddin, B. Elavarasan, D. Al-Kadi . Hybrid ideals in near-subtraction semigroups. AIMS Mathematics, 2022, 7(7): 13493-13507. doi: 10.3934/math.2022746
    [6] Changlin Xu, Yaqing Wen . New measure of circular intuitionistic fuzzy sets and its application in decision making. AIMS Mathematics, 2023, 8(10): 24053-24074. doi: 10.3934/math.20231226
    [7] Tareq M. Al-shami, José Carlos R. Alcantud, Abdelwaheb Mhemdi . New generalization of fuzzy soft sets: (a,b)-Fuzzy soft sets. AIMS Mathematics, 2023, 8(2): 2995-3025. doi: 10.3934/math.2023155
    [8] Rana Muhammad Zulqarnain, Xiao Long Xin, Muhammad Saeed . Extension of TOPSIS method under intuitionistic fuzzy hypersoft environment based on correlation coefficient and aggregation operators to solve decision making problem. AIMS Mathematics, 2021, 6(3): 2732-2755. doi: 10.3934/math.2021167
    [9] T. M. Athira, Sunil Jacob John, Harish Garg . A novel entropy measure of Pythagorean fuzzy soft sets. AIMS Mathematics, 2020, 5(2): 1050-1061. doi: 10.3934/math.2020073
    [10] Wajid Ali, Tanzeela Shaheen, Iftikhar Ul Haq, Hamza Toor, Faraz Akram, Harish Garg, Md. Zia Uddin, Mohammad Mehedi Hassan . Aczel-Alsina-based aggregation operators for intuitionistic hesitant fuzzy set environment and their application to multiple attribute decision-making process. AIMS Mathematics, 2023, 8(8): 18021-18039. doi: 10.3934/math.2023916
  • Let Cn be an n-dimensional cross-polytope and Γp(Cn) be the smallest positive number γ such that Cn can be covered by p translates of γCn. We obtain better estimates of Γ2n(Cn) for small n and a universal upper bound of Γ2n(Cn) for all positive integers n.



    N-soft sets (NSSs) theory and their applications were first introduced by Fatimah et al. [8] as a generalization to the concept of soft sets (SSs) defined by Molodtsov [11]. In the last three years, the NSS theory and its use in decision-making problems for various issues in daily life have been growing steadily. By combining the NSS theory with previous theories such as fuzzy sets (FSs) [16], fuzzy soft sets (FSSs) [10], hesitant fuzzy soft sets (HFSSs) [5], intuitionistic fuzzy sets (IFSs) [4], thus new concepts were constructed, among which were the theories of fuzzy N-soft sets (FNSSs) [3], hesitant fuzzy N-soft sets (HFNSSs) [2] and intuitionistic fuzzy N-soft sets (IFNSSs) [1]. Therefore, these results can be applied to a wider variety of problem models in everyday life.

    On the other hand, Nazra et al. [12] have developed a new concept of hesitant intuitionistic fuzzy soft sets (HIFSSs) as a combination of HFSS and IFS concepts. However, the models constructed by Akram et al. [1,2,3] could not cover the decision-making problems that contain elements of hesitation and, at the same time, it also intuitionistic, because each model only suitable for elements of hesitation or intuitionistic separately. Another shortcoming of Akram's models is that the models do not consider the degree of importance (preference) of parameters. Therefore, the concept of HIFSSs and generalized hesitant intuitionistic fuzzy soft sets (GHIFSSs), considering the degree of preference of parameters that Nazra et al. [12,13] have introduced, needs to be developed further in the context of N-soft sets (NSSs).

    The problem in this research is how the generalization of the research results of Nazra et al. [13] on GHIFSS is related to the research results of Fatimah et al. [8], as well as the generalization of the research of Akram et al.[1,2,3]. Hence this new concept is called the generalized hesitant intuitionistic fuzzy N-soft set (GHIFNSS) concept. This research aims to formulate the definition of GHIFNSS, their complements, and some related operations. Then, we analytically prove some properties concerning the operations and complements. As an application of our new model, we construct a novel algorithm for decision-making problems. The algorithm is a generalization of that constructed by Caǧman and Karatas [7], and Khan and Zhu [9] to solve decision-making problems based on intuitionistic fuzzy soft sets.

    We organize this paper as follows. Section 2 recalls definitions of FSs, SSs and their combinations, and NSSs. Sections 3 and 4 are the main results. Section 3 introduces our new hybrid model GHIFNSS, its complements, operations and properties. In order to be easily understood, we provide some examples. In Section 4, we construct an algorithm as an application of a GHIFNSS and give a numerical example illustrating a decision-making problem in a GHIFNSS information using the algorithm. Section 5 concludes the paper.

    In this section, we review some definitions, such as, fuzzy set (FS), soft set (SS), fuzzy soft set (FSS), intuitionistic fuzzy set (IFS), hesitant intuitionistic fuzzy set (HIFS) and N-soft set (NSS).

    The concept of fuzzy set is introduced by Zadeh [16]. A fuzzy set (FS) over a set of objects O is a set Fs={(u,f(u))|uO} where f:O[0,1]. Here f and f(u) are called the membership function of Fs and the membership value of u in Fs, respectively. Molodtsov, in [11], defined a kind of set called the soft set (SS).

    Definition 2.1. [11] Let U be a universal set, P(U) be a power set of U, and E be a set of parameters. A pair F,E is called a soft set (SS) over U if and only if F is a function F:EP(U), such that

    F,E={ε,F(ε)|εE,F(ε)P(U)}. (2.1)

    As a generalization of a FS, it is introduced the concept of an intuitionistic fuzzy set (IFS).

    Definition 2.2. [4] Let X be a universal set. An intuitionistic fuzzy set (IFS) I over X is

    I={x,μI(x),γI(x)|xX}, (2.2)

    where μI,γI:X[0,1] are membership and non-membership functions on I. Moreover, for any xX, 0μI(x)+γI(x)1.

    Beg and Rashid [6] generalized the concept of IFS to hesitant intuitionistic fuzzy set (HIFS). However, in this article, we revise the definition to make it simpler and more general.

    Definition 2.3. Let X be a universal set. An hesitant intuitionistic fuzzy set (HIFS) H over X is

    H={x,α(x),β(x)|xX}, (2.3)

    where β,α:XP([0,1]) are membership and non-membership functions on H. The set P([0,1]) denotes the collection of non-empty subsets of real numbers in [0,1], Moreover, for any xX, 0max{a|aα(x)}+max{b|bβ(x)}1.

    Fatimah et al. [8] expand the concept SS to N-soft set.

    Definition 2.4. [8] Suppose that U is a set of objects, E is a set of parameters or attributes, AE. R={0,1,2,...,N1} is a set of grades where N{2,3,...}. An N-soft set (NSS) (F,A,N) over U is defined as

    (F,A,N)={(a,F(a))aA}

    where F:A2U×R such that F(a)={(u,rau)|uU,rauR}. Here, for some aA, for any uU there exist a unique rauR so that we may write rau=F(u)(a) as the grade of the object u related to the parameter a.

    First of all, we define a new hybrid model called a hesitant intuitionistic fuzzy N-soft set as a combination of HIFS and NSS, and IFNSS and HFNSS.

    Definition 3.1. Let X be a set of objects, E be a set of parameters, and AE. A pair (HA,NF) is called a hesitant intuitionistic fuzzy N-soft set (HIFNSS) over X where NF=(F,A,N) is an NSS over U, if

    HA:AaAˆF(F(a)),

    where ˆF(F(a)) is a collection of all HIFSs over F(a).

    An HIFNSS may restate as

    (HA,NF)={(a,HA(a))|aA},

    where HA(a)={(u,rau),μa(u,rau),γa(u,rau)|(u,rau)F(a)}, with μa,γa:F(a)P([0,1]). Here, P([0,1]) denotes the collection of non-empty subsets of real numbers in [0,1], rau is a grade of an object u corresponding to a parameter a, and μa and γa are called membership and non-membership functions respectively. For simplify, we denote mau:=μa(u,rau) and wau:=γa(u,rau) as a possible membership degrees and a possible non-membership degrees of an object u related to a parameter a, respectively, so that

    (HA,NF)={(a,HA(a))|aA},withHA(a)={(u,rau)(mau,wau)|(u,rau)F(a)}0max{γ|γmau}+max{γ|γwau}1. (3.1)

    Furthermore, the set {(u,rau),μa(u,rau),γa(u,rau)|(u,rau)F(a)} may be written as

    {HA(a)(u,rau)|(u,rau)F(a)},

    with HA(a)(u,rau)=(u,rau)(mau,wau). An HIFNSS over a set U may be represented in a table called Representation Table of an HIFNSS as in Table 1.

    Table 1.  Representation table of an HIFNSS.
    (HA,NF) a1 a2 an
    u1 (r11,m11,w11) (r12,m12,w12) (r1n,m1n,w1n)
    u2 (r21,m21,w21) (r22,m22,w22) (r2n,m2n,w2n)
    um (rm1,mm1,wm1) (rm2,mm2,wm2) (rmn,mmn,wmn)

     | Show Table
    DownLoad: CSV

    In Table 1, uiU,i=1,...,m,ajA,j=1,...,n, and (rij,mij,wij) at the cell (i,j) represents that (ui,rij),mij,wijHA(aj) where rij=rajui, mij=μaj(ui,rij), and wij=γaj(ui,rij).

    Example 1. The Indonesian Ministry of Agriculture conducts a selection of candidates for agricultural extension workers. The candidates taking the test are u1.u2,u3,u4 which is expressed in the set of objects U={u1.u2,u3,u4}. Competencies (parameters) tested are e1=Development of Extension Programs, e2=Development of Farmer Participation and e3=Farmers' Education. Suppose A={e1,e2,e3}. The selection process is carried out in two stages: the written test stage and the interview stage of testing all types of competencies. At the written test stage, the test score s of each candidate is stated in grades as follows:

    a) grade 4, if 8<s10.

    b) grade 3, if 6<s8.

    c) grade 2, if 4<s6.

    d) grade 1, if 2<s4.

    e) grade 0, if 0s2.

    Furthermore, the candidate's ability and inability to explain all the competencies tested will be assessed, from the interview test. The results of this assessment are expressed as real numbers in [0, 1], which are the membership and non-membership values of each candidate for each parameter.

    Following are the results of the assessment of all candidates, which can be stated in the table of representation of an HIFNSS (see Table 2).

    Table 2.  Representation table of an HIFNSS.
    (HA,NF) e1 e2 a3
    u1 (4,{0.60,0.70},{0.30,0.25}) (3,{0.65,0.75},{0.20,0.25}) (2,{0.60,0.55},{0.30,0.35})
    u2 (3,{0.50,0.55},{0.30,0.35}) (2,{0.50,0.55},{0.30,0.35}) (1,{0.45,0.30},{0.55,0.50})
    u2 (2,{0.40,0.35},{0.55,0.50}) (1,{0.40,0.35},{0.55,0.50}) (3,{0.65,0.75},{0.20,0.25})
    u4 (4,{0.75,0.80},{0.20,0.10}) (4,{0.75,0.70},{0.20,0.15}) (4,{0.70,0.80},{0.20,0.10})

     | Show Table
    DownLoad: CSV

    Now, we define some complements of an HIFNSS.

    Definition 3.2. The top grade complement of an HIFNSS (HA,NF), as in (3.1), is defined as

    (HtgA,NF)={(a,HtgA(a))|aA}, (3.2)

    where HtgA(a)={HtgA(a)(u,rtgau)|(u,rau)F(a)} with

    HtgA(a)(u,rtgau):={(u,N1)(mau,wau),ifrau<N1,(u,0)(mau,wau),ifrau=N1.

    Definition 3.3. The bottom grade complement of an HIFNSS (HA,NF), as in (3.1), is defined as

    (IbgA,NF)={(a,HbgA(a))|aA} (3.3)

    where HbgA(a)={HbgA(a)(u,rbgau)|(u,rau)F(a)} with

    HbgA(a)(u,rbgau):={(u,0)(mau,wau),ifrau>0,(u,N1)(mau,wau),ifrau=0.

    Definition 3.4. The top grade hesitant intuitionistic complement of an HIFNSS (HA,NF), as in (3.1), is defined as

    (HthA,NF)={(a,HthA(a))|aA}, (3.4)

    where HthA(a)={HthA(a)(u,rthau)|(u,rau)F(a)} with

    HthA(a)(u,rthau):={(u,N1)(wau,mau),ifrau<N1,(u,0)(wau,mau),ifrau=N1.

    Definition 3.5. The bottom grade hesitant intuitionistic complement of an HIFNSS (HA,NF), as in (3.1), is defined as

    (HbhA,NF)={(a,HbhA(a))|aA}, (3.5)

    where HbhA(a)={HbhA(a)(u,rbhau)|(u,rau)F(a)} with

    HbhA(a)(u,rbhau):={(u,0)(wau,mau),ifrau>0,(u,N1)(wau,mau),ifrau=0.

    As a generalization of HIFNSS, and a study of HIFSS in context NSS, we propose the following concept called a generalized hesitant intuitionistic fuzzy N-soft set.

    Definition 3.6. Let U be a set of objects and P be a set of parameters, AP. Suppose (HA,NF) is an HIFNSS over U and α is a FS over A, with α:A[0,1]. The triple (Gα,G,α), where G=(F,A,N) is an NSS, is called a generalized hesitant intuitionistic fuzzy N-soft set (GHIFNSS) over U, if

    Gα:AaAˆF(F(a))×[0,1],

    which is defined as Gα(a)=(HA(a),α(a)), with ˆF(F(a)) is the collection of all hesitant intuitionistic fuzzy sets over F(a). In more detail, a GHIFNSS can be written in the form

    (Gα,G,α)={(a,Gα(a))|aA}={(a,HA(a),α(a))|aA} (3.6)

    where Gα(a)=(HA(a),α(a))=({(u,rau),μa(u,rau),γa(u,rau)|(u,rau)F(a)},α(a)).

    Next, we may write

    Gα(a)=({HA(a)(u,rau)|(u,rau)F(a)},α(a))=({(u,rau)(mau,wau)|(u,rau)F(a)},α(a)), (3.7)

    with HA(a)(u,rau)=(u,rau)(mau,wau), mau=μa(u,rau) and wau=γa(u,rau). Since the definition is closely related to a hesitant intuitionistic fuzzy set, then it must be 0max{γ|γmau}+max{γ|γwau}1.

    A GHIFNSS contains not only a grade, degrees of membership, and degrees of non-membership for each object based on specific parameter, but also a degree of importance for each of these parameters, which is expressed by α(a). A GHIFNSS can also be represented in a table. The following table illustrates the representation of a GHIFNSS (Table 3), called representation table of a GHIFNSS.

    Table 3.  Representation table of a GHIFNSS.
    (Gα,G,α) a1;α(a1) a2;α(a2) an;α(an)
    u1 (r11,m11,w11) (r12,m12,w12) (r1n,m1n,w1n)
    u2 (r21,m21,w21) (r22,m22,w22) (r2n,m2n,w2n)
    um (rm1,mm1,wm1) (rm2,mm2,wm2) (rmn,mmn,wmn)

     | Show Table
    DownLoad: CSV

    In Table 3, uiU,i=1,...,m, ajA,j=1,...,n, and (rij,mij,wij) in each cell (i,j) represents that (ui,rij),mij,wijHA(aj)(ui,rajui) where rij=rajui, mij=μaj(ui,rajui), wij=γaj(ui,rajui) and α(aj)[0,1].

    Example 2. Given a case as in Example 1. Assume that a decision maker defines that degrees of importance for each parameter as follows.

    α(e1)=0.5,α(e2)=0.3,α(e3)=0.2.

    By this assumption we obtain a GHIFNSS as represented in Table 4.

    Table 4.  Representation table of a GHIFNSS.
    (Gα,G,α) e1;α(e1)=0.5 e2;α(e2)=0.3 a3;α(e3)=0.2
    u1 (4,{0.60,0.70},{0.30,0.25}) (3,{0.65,0.75},{0.20,0.25}) (2,{0.60,0.55},{0.30,0.35})
    u2 (3,{0.50,0.55},{0.30,0.35}) (2,{0.50,0.55},{0.30,0.35}) (1,{0.45,0.30},{0.55,0.50})
    u2 (2,{0.40,0.35},{0.55,0.50}) (1,{0.40,0.35},{0.55,0.50}) (3,{0.65,0.75},{0.20,0.25})
    u4 (4,{0.75,0.80},{0.20,0.10}) (4,{0.75,0.70},{0.20,0.15}) (4,{0.70,0.80},{0.20,0.10})

     | Show Table
    DownLoad: CSV

    The following are developed forms of complements and operations on generalized hesitant intuitionistic fuzzy N-soft sets.

    Definition 3.7. A weak complement of a GHIFNSS (Gα,G,α) as in (3.7), is defined by

    (Gwα,G,α)={(a,Gwα(a))|aA} (3.8)

    where

    Gwα(a)=(HA(a),α(a))=({(u,rau)(mau,wau)|(u,rau)F(a)},α(a)),

    with HA(a)={(u,rau)(mau,wau)|(u,rau)F(a)}, rauR,raurau.

    Grades in a weak complement of a GHIFNSS are different with those in the GHIFNSS. In contrast, the degrees of membership and non-membership and the degree of importance remain.

    Definition 3.8. The hesitant intuitionistic fuzzy complement of a GHIFNSS (Gα,G,α) as in (3.7), is defined by

    (Ghα,G,α)={(a,Ghα(a))|aA}, (3.9)

    where

    Ghα(a)=(HcA(a),α(a)),=({(u,rau)(wau,mau)|(u,rau)F(a)},α(a)),

    with HcA(a)={(u,rau)(wau,mau)|(u,rau)F(a)}.

    In this complement, the degrees of membership of each object in (Gα,G,α), will be the degrees of non-membership in (Ghα,G,α) and vice versa. At the same time, the grade and the degree of importance have not changed. Hence, the hesitant intuitionistic fuzzy complement of a GHIFNSS is unique.

    Definition 3.9. The preference complement of a GHIFNSS (Gα,G,α) as in (3.7), is defined by

    (Gpα,G,α)={(a,Gpα(a))|aA}, (3.10)

    where

    Gpα(a)=(HA(a),αp(a))=({(u,rau)(mau,wau)|(u,rau)F(a)},1α(a)),

    with αp(a)=1α(a).

    In this complement, the degree of importance in the preference complement of a GHIFNSS, is one minus the corresponding degree of importance in the GHIFNSS. Meanwhile, grades, membership and non-membership degrees do not change. Therefore, the preference complement of a GHIFNSS is unique.

    Definition 3.10. A weak hesitant intuitionistic fuzzy complement of a GHIFNSS (Gα,G,α) as in (3.7), is defined by

    (Gwhα,G,α)={(a,Gwhα(a))|aA}, (3.11)

    where

    Gwhα(a)=(HcA(a),α(a)),=({(u,rcau)(wau,mau)|(u,rau)F(a)},α(a)),

    with HcA(a)={(u,rcau)(wau,mau)|(u,rau)F(a)}, rcaurau.

    In this complement, the grades in a weak hesitant intuitionistic fuzzy complement of a GHIFNSS, are different from the corresponding grades in the GHIFNSS. In addition, the degrees of membership in a weak hesitant intuitionistic fuzzy complement of a GHIFNSS, will be the degrees of non-membership of the GHIFNSS, and vice versa. At the same time, the degrees of importance have not changed.

    Definition 3.11. A weak preference complement of a GHIFNSS (Gα,G,α) as in (3.7), is defined by

    (Gwpα,G,α)={(a,Gwpα(a))|aA}, (3.12)

    where

    Gwpα(a)=(HA(a),αp(a)),=({(u,rau)(mau,wau)|(u,rau)F(a)},1α(a)).

    In this complement, membership and non-membership degrees are the same as those in the GHIFNSS.

    Definition 3.12. The hesitant intuitionistic fuzzy preference complement of a GHIFNSS (Gα,G,α) as in (3.7), is defined by

    (Ghpα,G,α)={(a,Ghpα(a))|aA}, (3.13)

    where

    Ghpα(a)=(HcA(a),αp(a)),=({(u,rau)(wau,mau)|(u,rau)F(a)},1α(a)).

    This complement is unique for a GHIFNSS, and the grades are remain.

    Definition 3.13. A weak hesitant intuitionistic fuzzy preference complement of a GHIFNSS (Gα,G,α) as in (3.7), is defined by

    (Gwhpα,G,α)={(a,Gwhpα(a))|aA}, (3.14)

    where

    Gwhpα(a)=(HcA(a),αp(a)),=({(u,rcau)(wau,mau)|(u,rau)F(a)},1α(a)).

    The following are some interesting special complements of a weak complement, a weak hesitant intuitionistic fuzzy complement and a weak hesitant intuitionistic fuzzy preference complement of a GHIFNSS.

    Definition 3.14. The top grade complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined by

    (Gtgα,G,α)={(a,Gtgα(a))|aA}, (3.15)

    where Gtgα(a)=(HtgA(a),α(a)).

    Compared to the GHIFNSS, the changes part from its complement is the grade, where the grade becomes N1 if the corresponding grade in the GHIFNSS is less than N1 and becomes 0 if that is equal to N1. By this definition, it is clear that the top grade complement of a GHIFNSS is unique.

    Definition 3.15. The top grade hesitant intuitionistic fuzzy complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined by

    (Gthα,G,α)={(a,Gthα(a))|aA}, (3.16)

    where Gthα(a)=(HthA(a),α(a)).

    In this complement, the determination of the grades is the same as that of the top grade complement. At the same time, the membership and non-membership degrees in the GHIFNSS and the top grade hesitant intuitionistic fuzzy complement are interchanging each other. The top grade hesitant intuitionistic fuzzy complement of a GHIFNSS is also unique.

    Definition 3.16. The top grade preference complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined by

    (Gtpα,G,α)={(a,Gtpα(a))|aA}, (3.17)

    where Gtpα(a)=(HtgA(a),αp(a)).

    The difference between Definitions 3.16 and 3.14 is in the degree of importance. It is also clear that (Gtpα,G,α) is unique.

    Definition 3.17. The top grade hesitant intuitionistic fuzzy preference complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined as

    (Gthpα,G,α)={(a,Gthpα(a))|aA}, (3.18)

    where Gthpα(a)=(HthA(a),αp(a)).

    The difference between Definitions 3.15 and 3.17 is in the degree of importance. This kind of complement is also unique.

    Definition 3.18. The bottom grade complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined as the following

    (Gbgα,G,α)={(a,Gbgα(a))|aA}, (3.19)

    where Gbgα(a)=(HbgA(a),α(a)).

    Compared to the GHIFNSS, the changes part from its complement is the grade, where the grade becomes 0 if the corresponding grade in the GHIFNSS is greater than 0 and becomes N1 if that is equal to 0. By this definition, it is clear that the top bottom grade complement of a GHIFNSS is unique.

    Definition 3.19. The bottom grade hesitant intuitionistic fuzzy complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined as

    (Gbhα,G,α)={(a,Gbhα(a))|aA}, (3.20)

    where Gbhα(a)=(HbhA(a),α(a)).

    In this complement, the determination of the grades is the same as that of the bottom grade complement. However, the membership and non-membership degrees in the GHIFNSS and the bottom hesitant intuitionistic fuzzy complement are interchanging each other. This complement is also unique.

    Definition 3.20. The bottom grade preference complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined as

    (Gbpα,G,α)={(a,Gbpα(a))|aA}, (3.21)

    where Gbpα(a)=(HbgA(a),αp(a)).

    The difference between Definitions 3.20 and 3.18 is in the degree of importance. It is also clear that (Gbpα,G,α) is unique.

    Definition 3.21. The bottom grade hesitant intuitionistic fuzzy preference complement of a GHIFNSS (Gα,G,α) as in (3.7) is defined as

    (Gbhpα,G,α)={(a,Gbhpα(a))|aA}, (3.22)

    where Gbhpα(a)=(HbhA(a),αp(a)).

    The difference between Definitions 3.19 and 3.21 is in the degree of importance. This kind of complement is also unique.

    In the following, we define some operations on generalized hesitant intuitionistic fuzzy N-soft sets.

    Definition 3.22. Suppose that (Gα,G1,α)={(a,HA(a),α(a))|aA} and (Gβ,G2,β)={(a,HB(a),β(a))|bB} are two GHIFNSSs over U, where G1=(F1,A,N1) and G2=(F2,B,N2) are two NSSs over U,

    Gα(a)=(HA(a),α(a))=({(u,r(1)au)(m(1)au,w(1)au)|(u,r(1)au)F1(a)},α(a)),
    Gβ(a)=(HB(a),β(a))=({(u,r(2)au)(m(2)au,w(2)au)|(u,r(2)au)F2(a)},β(a)).

    A restricted intersection between (Gα,G1,α) and (Gβ,G2,β), denoted by (Gα,G1,α) R(Gβ,G2,β), is defined as (GδRI,G3,δ) where G3=(F3,AB,min(N1,N2)), and cC=AB,uU,

    (GδRI,G3,δ)={(c,GδRI(c))|cC}. (3.23)

    Here,

    GδRI(c)=(HC(c),δ(c))=({(u,r(3)cu)(m(3)cu,w(3)cu)|(u,r(3)cu)F3(c)},δ(c))

    with

    r(3)cu=min(r(1)cu,r(2)cu),m(3)cu={γ|γ=min{p,q},pm(1)cu,qm(2)cu},w(3)cu={γ|γ=max{p,q},pw(1)cu,qw(2)cu},δ(c)=min(α(c),β(c)).

    Definition 3.23. Suppose that (Gα,G1,α)={(a,HA(a),α(a))|aA} and (Gβ,G2,β)={(a,HB(a),β(a))|bB} are two GHIFNSSs over U, where G1=(F1,A,N1) and G2=(F2,B,N2) are two NSSs over U,

    Gα(a)=(HA(a),α(a))=({(u,r(1)au)(m(1)au,w(1)au)|(u,r(1)au)F1(a)},α(a)),
    Gβ(a)=(HB(a),β(a))=({(u,r(2)au)(m(2)au,w(2)au)|(u,r(2)au)F2(a)},β(a)).

    An extended intersection between (Gα,G1,α) and (Gβ,G2,β) denoted by (Gα,G1,α) E(Gβ,G2,β) is defined as (GδEI,G3,δ) where G3=(F3,AB,max(N1,N2)), and cC=AB,uU,

    (GδEI,G3,δ)={(c,GδEI(c))|cC}, (3.24)

    with GδEI(c)={Gα(c),ifcAB,Gβ(c),ifcBA,GδRI(c),ifcAB.

    Definition 3.24. Suppose that (Gα,G1,α)={(a,HA(a),α(a))|aA} and (Gβ,G2,β)={(a,HB(a),β(a))|bB} are two GHIFNSSs over U, where G1=(F1,A,N1) and G2=(F2,B,N2) are two NSSs over U,

    Gα(a)=(HA(a),α(a))=({(u,r(1)au)(m(1)au,w(1)au)|(u,r(1)au)F1(a)},α(a)),
    Gβ(a)=(HB(a),β(a))=({(u,r(2)au)(m(2)au,w(2)au)|(u,r(2)au)F2(a)},β(a)).

    A restricted union between (Gα,G1,α) and (Gβ,G2,β) denoted by (Gα,G1,α) R(Gβ,G2,β) is defined as (GδRU,G3,δ) where G3=(F3,AB,max(N1,N2)), and cC=AB,uU,

    (GδRU,G3,δ)={(c,GδRU(c))|cC}. (3.25)

    Here,

    GδRU(c)=(HC(c),δ(c))=({(u,r(3)cu)(m(3)cu,w(3)cu)|(u,r(3)cu)F3(c)},δ(c))

    with

    r(3)cu=max(r(1)cu,r(2)cu),m(3)cu={γ|γ=max{p,q},pm(1)cu,qm(2)cu},w(3)cu={γ|γ=min{p,q},pw(1)cu,qw(2)cu},δ(c)=max(α(c),β(c)).

    Definition 3.25. Suppose that (Gα,G1,α)={(a,HA(a),α(a))|aA} and (Gβ,G2,β)={(a,HB(a),β(a))|bB} are two GHIFNSSs over U, where G1=(F1,A,N1) and G2=(F2,B,N2) are two NSSs over U,

    Gα(a)=(HA(a),α(a))=({(u,r(1)au)(m(1)au,w(1)au)|(u,r(1)au)F1(a)},α(a)),
    Gβ(a)=(HB(a),β(a))=({(u,r(2)au)(m(2)au,w(2)au)|(u,r(2)au)F2(a)},β(a)).

    An extended union between (Gα,G1,α) and (Gβ,G2,β), denoted by (Gα,G1,α) E(Gβ,G2,β), is defined as (GδEU,G3,δ) where G3=(F3,AB,max(N1,N2)), and cC=AB,uU,

    (GδEU,G3,δ)={(c,GδEU(c))|cC}, (3.26)

    with GδEU(c)={Gα(c),ifcAB,Gβ(c),ifcBA,GδRU(c),ifcAB.

    Now, we prove some properties of GHIFNSS corresponding to the operations and the top or bottom grade hesitant intuitionistic fuzzy preference complements.

    Theorem 3.26. Given two top grade hesitant intuitionistic fuzzy preference complements (Gthpα,G1,α) and (Gthpβ,G2,β) of (Gα,G1,α) and (Gβ,G2,β) over U respectively, where G1=(F1,A,N1) and G2=(F2,B,N2) are two NSSs over U. Let Gthpα(a)=(HthA(a),αp(a)), where

    HthA(a)(u,rthau):={(u,N1)(w(1)au,m(1)au),ifr(1)au<N1,(u,0)(w(1)au,m(1)au),ifr(1)au=N1,

    with (u,r(1)au)F1(a), and Gthpβ(b)=(HthB(b),βp(b)), where

    HthB(b)(u,rthbu):={(u,N1)(w(2)bu,m(2)bu),ifr(2)bu<N1,(u,0)(w(2)bu,m(2)bu),ifr(2)bu=N1,

    with (u,r(2)bu)F2(b).

    Then the following holds.

    (1) Let (Gα,G1,α)R(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=min(N1,N2)). Then (GthpδRI,G3,δ)=(Gthpα,G1,α)R(Gthpβ,G2,β).

    (2) Let (Gα,G1,α)R(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=max(N1,N2)). Then (GthpδRI,G3,δ)=(Gthpα,G1,α)R(Gthpβ,G2,β).

    Proof. Let (Gα,G1,α)={(a,{HA(a)(u,r(1)au)|(u,r(1)au)F1(a)},α(a))|aA}, with

    HA(a)(u,r(1)au)=(u,r(1)au)(m(1)au,w(1)au),

    and (Gβ,G2,β)={(b,{HB(b)(u,r(2)bu)|(u,r(2)bu)F2(b)},β(b))|bB}, with

    HB(b)(u,r(2)bu)=(u,r(2)bu)(m(2)bu,w(2)bu).

    Using Definition 3.22 for cC=AB

    GδRI(c)=(HC(c),δ(c))=({(u,r(3)cu)(m(3)cu,w(3)cu)|(u,r(3)cu)F3(c)},δ(c))

    with

    r(3)cu=min(r(1)cu,r(2)cu),m(3)cu={γ|γ=min{p,q},pm(1)cu,qm(2)cu},w(3)cu={γ|γ=max{p,q},pw(1)cu,qw(2)cu},δ(c)=min(α(c),β(c)).

    Then, by Definition 3.17, GthpδRI(c)=(HthC(c),1δ(c)) with

    HthC(c)(u,rthcu)={(u,N1)(w(3)cu,m(3)cu),ifr(3)cu<N1,(incase,r(1)cu,r(2)cu<N1)(u,N1)(w(3)cu,m(3)cu),ifr(3)cu<N1,(incase,r(1)cu<N1,r(2)cu=N1)(u,N1)(w(3)cu,m(3)cu),ifr(3)cu<N1,(incase,r(1)cu=N1,r(2)cu<N1)(u,0)(w(3)cu,m(3)cu),ifr(3)bu=N1,(incase,r(1)cu=N1=r(2)cu).

    On the other hand, by Definition 3.24,

    (Gthpα,G1,α)R(Gthpβ,G2,β)=(GthpγRU,G4,γ) with G4=(F4,C=AB,max(N1,N2)). Let, for cC=AB,

    GthpγRU(c)=(HC(c),γ(c))=({(u,r(4)cu)(m(4)cu,w(4)cu)|(u,r(4)cu)F4(c)},γ(c)).

    Suppose that HC(c)(u,r(4)cu)=(u,r(4)cu)(m(4)cu,w(4)cu). Then

    m(4)cu={γ|γ=max{p,q},pw(1)cu,qw(2)cu}=w(3)cu and w(4)cu={γ|γ=min{p,q},pm(1)cu,qm(2)cu}=m(3)cu,

    HC(c)(u,r4cu)={(u,N1)(m(4)cu,w(4)cu),ifr(1)cu,r(2)cu<N1(u,N1)(m(4)cu,w(4)cu),ifr(1)cu<N1,r(2)cu=N1(u,N1)(m(4)cu,w(4)cu),ifr(1)cu=N1,r(2)cu<N1(u,0)(m(4)cu,w(4)cu),ifr(1)cu=N1=r(2)cu.=HthC(c)(u,rthcu)

    and γ(c)=max(αp(c),βp(c))=max(1α(c), 1β(c))=1min(α(c),β(c))=1δ(c). Therefore, Theorem 3.26 (1) is proved.

    The proof of Theorem 3.26 (2) is similar.

    Theorem 3.27. Given two bottom grade hesitant intuitionistic fuzzy preference complements (Gbhpα,G1,α) and (Gbhpβ,G2,β) of (Gα,G1,α) and (Gβ,G2,β) over U respectively, where G1=(F1,A,N1) and G2=(F2,B,N2) are two NSSs over U. Let Gbhpα(a)=(HbhA(a),αp(a)), where

    HbhA(a)(u,rbhau):={(u,0)(w(1)au,m(1)au),ifr(1)au>0,(u,N1)(w(1)au,m(1)au),ifr(1)au=0,

    with (u,r(1)au)F1(a), and Gbhpβ(b)=(HbhB(b),βp(b)), where

    HbhB(b)(u,rbhbu):={(u,0)(w(2)bu,m(2)bu),ifr(2)bu>0,(u,N1)(w(2)bu,m(2)bu),ifr(2)bu=0,

    with (u,r(2)bu)F2(b).

    Then the following holds.

    (1) Let (Gα,G1,α)R(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=min(N1,N2)). Then (GbhpδRI,G3,δ)=(Gbhpα,G1,α)R(Gbhpβ,G2,β).

    (2) Let (Gα,G1,α)R(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=max(N1,N2)). Then (GbhpδRI,G3,δ)=(Gbhpα,G1,α)R(Gbhpβ,G2,β).

    Proof. Let (Gα,G1,α)={(a,{HA(a)(u,r(1)au)|(u,r(1)au)F1(a)},α(a))|aA}, with

    HA(a)(u,r(1)au)=(u,r(1)au)(m(1)au,w(1)au),

    and (Gβ,G2,β)={(b,{HB(b)(u,r(2)bu)|(u,r(2)bu)F2(b)},β(b))|bB}, with

    HB(b)(u,r(2)bu)=(u,r(2)bu)(m(2)bu,w(2)bu).

    Using Definition 3.22 for cC=AB

    GδRI(c)=(HC(c),δ(c))=({(u,r(3)cu)(m(3)cu,w(3)cu)|(u,r(3)cu)F3(c)},δ(c))

    with

    r(3)cu=min(r(1)cu,r(2)cu),m(3)cu={γ|γ=min{p,q},pm(1)cu,qm(2)cu},w(3)cu={γ|γ=max{p,q},pw(1)cu,qw(2)cu},δ(c)=min(α(c),β(c)).

    Then, by Definition 3.21, GbhpδRI(c)=(HbhC(c),1δ(c)) with

    HbhC(c)(u,rbhcu):={(u,0)(w(3)cu,m(3)cu),ifr(3)cu>0,(incase,r(1)cu,r(2)cu>0)(u,N1)(w(3)cu,m(3)cu),ifr(3)cu=0,(incase,r(1)cu>0,r(2)cu=0)(u,N1)(w(3)cu,m(3)cu),ifr(3)cu=0,(incase,r(1)cu=0,r(2)cu>0)(u,N1)(w(3)cu,m(3)cu),ifr(3)bu=0,(incase,r(1)cu=0=r(2)cu).

    On the other hand, by Definition 3.24,

    (Gbhpα,G1,α)R(Gbhpβ,G2,β)=(GbhpγRU,G4,γ) with G4=(F4,C=AB,max(N1,N2)). Let, for cC=AB,

    GbhpγRU(c)=(HC(c),γ(c))=({(u,r(4)cu)(m(4)cu,w(4)cu)|(u,r(4)cu)F4(c)},γ(c)).

    Suppose that HC(c)(u,r(4)cu)=(u,r(4)cu)(m(4)cu,w(4)cu). Then

    m(4)cu={γ|γ=max{p,q},pw(1)cu,qw(2)cu}=w(3)cu and w(4)cu={γ|γ=min{p,q},pm(1)cu,qm(2)cu}=m(3)cu,

    HC(c)(u,r4cu)={(u,0)(m(4)cu,w(4)cu),ifr(1)cu,r(2)cu>0(u,N1)(m(4)cu,w(4)cu),ifr(1)cu>0,r(2)cu=0(u,N1)(m(4)cu,w(4)cu),ifr(1)cu=0,r(2)cu>0(u,N1)(m(4)cu,w(4)cu),ifr(1)cu=0=r(2)cu.=HthC(c)(u,rthcu)

    and γ(c)=max(αp(c),βp(c))=max(1α(c), 1β(c))=1min(α(c),β(c))=1δ(c). Therefore, Theorem 3.27 (1) is proved.

    The proof of Theorem 3.27 (2) is similar.

    Using Definitions 3.17, 3.21, 3.23 and 3.25, we obtain the following two theorems, in which proving is similar to Theorems 3.26 and 3.27 respectively.

    Theorem 3.28. Given two top grade hesitant intuitionistic fuzzy preference complements (Gthpα,G1,α) and (Gthpβ,G2,β) of (Gα,G1,α) and (Gβ,G2,β) over U respectively.

    Then the following holds.

    (1) Let (Gα,G1,α)E(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=min(N1,N2)). Then (GthpδRI,G3,δ)=(Gthpα,G1,α)E(Gthpβ,G2,β).

    (2) Let (Gα,G1,α)E(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=max(N1,N2)). Then (GthpδRI,G3,δ)=(Gthpα,G1,α)E(Gthpβ,G2,β).

    Theorem 3.29. Given two bottom grade hesitant intuitionistic fuzzy preference complements (Gbhpα,G1,α) and (Gbhpβ,G2,β) of (Gα,G1,α) and (Gβ,G2,β) over U respectively.

    Then the following holds.

    (1) Let (Gα,G1,α)E(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=min(N1,N2)). Then (GbhpδRI,G3,δ)=(Gbhpα,G1,α)E(Gbhpβ,G2,β).

    (2) Let (Gα,G1,α)E(Gβ,G2,β)=(GδRI,G3,δ) with G3=(F3,AB,N=max(N1,N2)). Then (GbhpδRI,G3,δ)=(Gbhpα,G1,α)E(Gbhpβ,G2,β).

    In this section, we propose a decision-making algorithm for a decision-making problem represented as a GHIFNSS. Before that, several definitions used in the decision-making process will be introduced.

    Definition 4.1. Given a GHIFNSS (Gα,G,α) over U as in Eq (3.6). An induced generalized intuitionistic fuzzy N-soft set (IGIFNSS) (IGα,G,α) over U is defined as follows.

    (IGα,G,α)={(a,IGα(a))|aA}={(a,IFA(a),α(a))|aA} (4.1)

    where IGα(a)=(IFA(a),α(a)) and IFA(a)={(u,rau),ˉμa(u,rau),ˉγa(u,rau)|(u,rau)F(a)}, with ˉμa(u,rau):=μmauμ|mau| and ˉγa(u,rau):=γwauγ|wau|.

    An IGIFNSS over U may be represented in a table called representation table of an IGIFNSS as in Table 5.

    Table 5.  Representation table of a IGIFNSS.
    (IGα,G,α) a1;α(a1) a2;α(a2) an;α(an)
    u1 (r11,ˉm11,ˉw11) (r12,ˉm12,ˉw12) (r1n,ˉm1n,ˉw1n)
    u2 (r21,ˉm21,ˉw21) (r22,ˉm22,ˉw22) (r2n,ˉm2n,ˉw2n)
    um (rm1,ˉmm1,ˉwm1) (rm2,ˉmm2,ˉwm2) (rmn,ˉmmn,ˉwmn)

     | Show Table
    DownLoad: CSV

    In Table 5, uiU,i=1,...,m, ajA,j=1,...,n, and (rij,ˉmij,ˉwij) in each cell (i,j) represents that (ui,rij),ˉmij,ˉwijIFA(aj)(ui,rajui) where rij=rajui, ˉmij=ˉμaj(ui,rajui), ˉwij=ˉγaj(ui,rajui) and α(aj)[0,1].

    Caǧman and Karatas [7] (see also Khan and Zhu [9]) developed a novel algorithm to solve decision-making problems based on Intuitionistic Fuzzy Soft sets (IFSSs). Referring to these algorithms, we propose a similar algorithm but in the field of IGIFNSS information. For this, we define the following definitions. For an object ui at ej, it is defined the left and right values of an IGIFNSS, as

    ˉmlij:=ˉmijandˉmrij:=1ˉwij (4.2)

    respectively.

    Definition 4.2. Given an IGIFNSS (IGα,G,α) over U where G={F,A,N}, U={u1,u2,,um} and A={e1,e2,,en}. The intuitionistic value of an object ui at ej, of the IGIFNSS, is defined by

    ψej(ui)=ˉmlij+ˉmrij, (4.3)

    with ˉmlij and ˉmrij are the left and right values of ui at ej respectively.

    Definition 4.3. Given an IGIFNSS (IGα,G,α) over U where G={F,A,N}, U={u1,u2,,um} and A={e1,e2,,en}. The grade score and the membership score of an object ui at ej, of the IGIFNSS, is defined by

    ˜gej(ui)=mk=1(rijrkj), (4.4)

    and

    ˜sej(ui)=mk=1(ψej(ui)ψej(uk)), (4.5)

    respectively.

    Definition 4.4. Given an IGIFNSS (IGα,G,α) over U where G={F,A,N}, U={u1,u2,,un} and A={e1,e2,,em}. The total score of an object ui, of the IGIFNSS, is defined by

    Ti=nk=1α(ek)(˜gek(ui)+˜sek(ui)). (4.6)

    The optimal score to determine the best ub is computed by

    Tb=max1in(Ti). (4.7)

    Note that the evaluation score of an object ui at ej as in Theorem 1 [9] is a special case of the total score (4.6) with α(ek)=1 and ˜gek(ui)=0 for any ekA and uiU. This means that the GHIFNSS as a generalization of the IFSS gives the total score formula as a generalization of the evaluation score formula.

    Now, we present an algorithm for decision-making problems as an application of GHIFNSSs.

    Algorithm

    (1) Define a representation table of a GHIFNSS (Gα,G,α) over U.

    (2) Using (Gα,G,α) over U, set the IGIFNSS (IGα,G,α) over U.

    (3) Using (IGα,G,α) over U, compute the left and the right values for any object ui at any parameter ej.

    (4) Compute the intuitionistic value ψej(ui) for any object ui at any parameter ej.

    (5) Calculate the grade and membership scores ˜gej(ui) and ˜sej(ui) respectively, for any object ui at any parameter ej.

    (6) Calculate the total score Ti for any object ui

    (7) If Tb=max1in(Ti) is the maximum score, then the object ub is the best choice.

    Example 3. Given the decision-making problem as in Example 2. To determine the best candidate for agricultural extension worker, we apply the Algorithm above.

    (1) Defined the representation table of a GHIFNSS (Gα,G,α) over U as in Table 4.

    (2) Using Definition 4.1, we obtain the IGIFNSS (IGα,G,α) over U as in Table 6.

    (3) Using (IGα,G,α) over U, we compute the left and the right values for any object ui at any parameter ej, of the IGIFNSS (IGα,G,α) over U, by using Eq (4.2) and we present in Table 7.

    (4) We compute the intuitionistic value ψej(ui), using Definition 4.2 for any object ui at any parameter ej and represented in Table 8.

    (5) Calculate the grade and the membership scores ˜gej(ui) and ˜sej(ui) respectively, for any object ui at any parameter ej, using Definition 4.3 and we obtain Table 9.

    (6) We get the total score Ti for any object ui as in Table 10, using Definition 4.4.

    (7) Since Tb=maxain(Ti)= is the maximum score, then the object ub is the best choice.

    Table 6.  Representation table of an IGIFNSS.
    (IGα,G,α) e1;α(e1)=0.5 e2;α(e2)=0.3 a3;α(e3)=0.2
    u1 (4,0.650,0.275) (3,0.700,0.225) (2,0.575,0.325)
    u2 (3,0.525,0.325) (2,0.525,0.325) (1,0.375,0.525)
    u2 (2,0.375,0.525) (1,0.375,0.525) (3,0.700,0.225)
    u4 (4,0.775,0.150) (4,0.725,0.175) (4,0.750,0.150)

     | Show Table
    DownLoad: CSV
    Table 7.  Table of the left and the right values of the IGIFNSS.
    (rij,ˉmlij,ˉmrij) e1;α(e1)=0.5 e2;α(e2)=0.3 a3;α(e3)=0.2
    u1 (4,0.650,0.725) (3,0.700,0.775) (2,0.575,0.675)
    u2 (3,0.525,0.675) (2,0.525,0.675) (1,0.375,0.475)
    u2 (2,0.375,0.475) (1,0.375,0.475) (3,0.700,0.775)
    u4 (4,0.775,0.850) (4,0.725,0.825) (4,0.750,0.850)

     | Show Table
    DownLoad: CSV
    Table 8.  Table of the intuitionistic values of the IGIFNSS.
    (rij,ψej(ui)) e1;α(e1)=0.5 e2;α(e2)=0.3 a3;α(e3)=0.2
    u1 (4,1.375) (3,1.475) (2,1.250)
    u2 (3,1.200) (2,1.200) (1,0.850)
    u2 (2,0.875) (1,0.875) (3,1.475)
    u4 (4,1.625) (4,1.550) (4,1.600)

     | Show Table
    DownLoad: CSV
    Table 9.  Table of the grade and the membership scores of the IGIFNSS.
    (˜gej(ui),˜sej(ui)) e1;α(e1)=0.5 e2;α(e2)=0.3 a3;α(e3)=0.2
    u1 (3,0.45) (2,0.83) (2,0.18)
    u2 (1,0.25) (2,0.27) (6,1.78)
    u2 (5,1.65) (6,1.68) (2,0.73)
    u4 (3,1.45) (6,1.13) (6,1.23)

     | Show Table
    DownLoad: CSV
    Table 10.  Table of total scores of the IGIFNSS.
    ui Ti
    u1 2.14
    u2 -2.86
    u2 -5.08
    u4 5.81

     | Show Table
    DownLoad: CSV

    Since T4 is the maximum, then the best candidate is u4.

    Previous scholars have proposed fuzzy N-soft sets and hesitant fuzzy N-soft sets. Furthermore, we generalize HIFNSSs to generalized hesitant intuitionistic fuzzy N-soft sets (GHIFNSSs) as a hybrid model between generalized hesitant intuitionistic fuzzy sets and N-soft sets. Then, it was introduced some complements of the GHIFNSSs, intersection and union operations between GHIFNSSs, and proved that the operations between some particular complements hold De Morgan Law. An algorithm for decision-making problems in GHIFNSSs information was constructed, and a numerical example was given.

    This research can be extended by combining the concept of generalized interval-valued hesitant intuitionistic fuzzy soft sets (see Nazra et al. [14]) and NSS. Therefore, the study on NSS is more complete and more general. On the other hand, the study on the distance measure introduced by Xiao [15], may be constructed in the field of GHIFNSS.

    This research is supported by research fund from Universitas Andalas in accordance with contract of Professor's acceleration research cluster scheme (Batch Ⅱ), T/25/UN.16.17/PP.Energi-PDU-KRP2GB-Unand/2021.

    The authors declare that there are no conflicts of interest.



    [1] K. Bezdek, Hadwiger's covering conjecture and its relatives, Am. Math. Mon., 99 (1992), 954–956. https://doi.org/10.1080/00029890.1992.11995963 doi: 10.1080/00029890.1992.11995963
    [2] K. Bezdek, Classical topics in discrete geometry, CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, New York: Springer, 2010. https://doi.org/10.1007/978-1-4419-0600-7
    [3] K. Bezdek, M. A. Khan, The geometry of homothetic covering and illumination, In: Discrete Geometry and Symmetry, Cham: Springer, 2018. https://doi.org/10.1007/978-3-319-78434-2
    [4] V. Boltyanski, H. Martini, P. S. Soltan, Excursions into combinatorial geometry, Universitext, Berlin: Springer-Verlag, 1997. https://doi.org/10.1007/978-3-642-59237-9
    [5] P. Brass, W. Moser, J. Pach, Research problems in discrete geometry, New York: Springer, 2005. https://doi.org/10.1007/0-387-29929-7
    [6] H. Martini, V. Soltan, Combinatorial problems on the illumination of convex bodies, Aequationes Math., 57 (1999), 121–152. https://doi.org/10.1007/s000100050074 doi: 10.1007/s000100050074
    [7] F. W. Levi, Überdeckung eines Eibereiches durch Parallelverschiebungen seines offenen Kerns, Arch. Math., 6 (1955), 369–370. https://doi.org/10.1007/BF01900507 doi: 10.1007/BF01900507
    [8] C. Zong, A quantitative program for Hadwiger's covering conjecture, Sci. China Math., 53 (2010), 2551–2560. https://doi.org/10.1007/s11425-010-4087-3 doi: 10.1007/s11425-010-4087-3
    [9] X. Li, L. Meng, S. Wu, Covering functionals of convex polytopes with few vertices, Arch. Math., 119 (2022), 135–146. https://doi.org/10.1007/s00013-022-01727-z doi: 10.1007/s00013-022-01727-z
    [10] F. Xue, Y. Lian, Y. Zhang, On Hadwiger's covering functional for the simplexand the cross-polytope, arXiv Preprint, 2021. https://doi.org/10.48550/arXiv.2108.13277
    [11] U. Betke, M. Henk, Intrinsic volumes and lattice points of crosspolytopes, Monatsh. Math., 115 (1993), 27–33. https://doi.org/10.1007/BF01311208 doi: 10.1007/BF01311208
    [12] G. Pólya, G. Szegő, Problems and theorems in analysis: Series, integral calculus, theory of functions, Classics in Mathematics, Berlin: Springer-Verlag, 1998. https://doi.org/10.1007/978-3-642-61905-2
  • This article has been cited by:

    1. Dliouah Ahmed, Binxiang Dai, Ahmed Mostafa Khalil, Possibility Fermatean fuzzy soft set and its application in decision-making, 2023, 44, 10641246, 1565, 10.3233/JIFS-221614
    2. Lei Zhao, Managing incomplete general hesitant linguistic preference relations and their application, 2024, 9, 2473-6988, 28870, 10.3934/math.20241401
    3. Hüseyin Kamacı, Balakrishnan Palpandi, Subramanian Petchimuthu, M. Fathima Banu, m-Polar N-soft set and its application in multi-criteria decision-making, 2025, 44, 2238-3603, 10.1007/s40314-024-03029-2
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1123) PDF downloads(63) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog