Up to now, the study on the cardinal number of fuzzy sets has advanced at on pace since it is very hard to give it an appropriate definition. Althrough for it in [1], it is with some harsh terms and is not reasonable ...Up to now, the study on the cardinal number of fuzzy sets has advanced at on pace since it is very hard to give it an appropriate definition. Althrough for it in [1], it is with some harsh terms and is not reasonable as we point out in this paper. In the paper, we give a general definition of fuzzy cardinal numbers. Based on this definition, we not only obtain a large part of results with re spect to cardinal numbers, but also give a few of new properties of fuzzy cardinal numbers.展开更多
In this paper,the pointwise characterizations of fuzzy mappings are given. Based of this definition,we give a few of new properties of fuzzy cardinal numbers.
A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the preci...A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M<sub>N</sub>]. This permits the formulation of an extended twin prime conjecture. Moreover, it is found that the prime numbers subsets contained in Mersenne intervals have cardinalities strongly correlated with the corresponding Mersenne numbers.展开更多
In the complexity and indeterminacy of decision making(DM)environments,orthopair neutrosophic number set(ONNS)presented by Ye et al.can be described by the truth and falsity indeterminacy degrees.Then,ONNS demonstrate...In the complexity and indeterminacy of decision making(DM)environments,orthopair neutrosophic number set(ONNS)presented by Ye et al.can be described by the truth and falsity indeterminacy degrees.Then,ONNS demonstrates its advantages in the indeterminate information expression,aggregations,and DM problems with some indeterminate ranges.However,the existing research lacks some similarity measures between ONNSs.They are indispensable mathematical tools and play a crucial role in DM,pattern recognition,and clustering analysis.Thus,it is necessary to propose some similaritymeasures betweenONNSs to supplement the gap.To solve the issue,this study firstly proposes the p-indeterminate cosine measure,p-indeterminate Dice measure,p-indeterminate Jaccard measure of ONNSs(i.e.,the three parameterized indeterminate vector similarity measures of ONNSs)in vector space.Then,a DMmethod based on the parameterized indeterminate vector similarity measures of ONNSs is developed to solve indeterminate multiple attribute DM problems by choosing different indeterminate degrees of the parameter p,such as the small indeterminate degree(p=0)or the moderate indeterminate degree(p=0.5)or the big indeterminate degree(p=1).Lastly,an actual DM example on choosing a suitable logistics supplier is provided to demonstrate the flexibility and practicability of the developed DM approach in indeterminate DM problems.By comparison with existing relative DM methods,the superiority of this study is that the established DMapproach indicates its flexibility and suitability depending on decision makers’indeterminate degrees(decision risks)in ONNS setting.展开更多
Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the n...Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.展开更多
LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical(in short,fractional ID-k-factor-critical),if G I has a fractional k-factor for every independent set ...LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical(in short,fractional ID-k-factor-critical),if G I has a fractional k-factor for every independent set I of G.The binding number bind(G)of a graph G is defined as bind(G)=min|NG(X)||X|:=X V(G),NG(X)=V(G).In this paper,it is proved that a graph G is fractional ID-k-factor-critical if n≥6k 9 and bind(G)〉(3k 1)(n 1)kn 2k+2.展开更多
The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves a resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matc...The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves a resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. In this paper, we find this number and classify all optimal sets for the augmented k-ary n-cubes with even k ≥ 4.展开更多
文摘Up to now, the study on the cardinal number of fuzzy sets has advanced at on pace since it is very hard to give it an appropriate definition. Althrough for it in [1], it is with some harsh terms and is not reasonable as we point out in this paper. In the paper, we give a general definition of fuzzy cardinal numbers. Based on this definition, we not only obtain a large part of results with re spect to cardinal numbers, but also give a few of new properties of fuzzy cardinal numbers.
文摘In this paper,the pointwise characterizations of fuzzy mappings are given. Based of this definition,we give a few of new properties of fuzzy cardinal numbers.
文摘A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M<sub>N</sub>]. This permits the formulation of an extended twin prime conjecture. Moreover, it is found that the prime numbers subsets contained in Mersenne intervals have cardinalities strongly correlated with the corresponding Mersenne numbers.
文摘In the complexity and indeterminacy of decision making(DM)environments,orthopair neutrosophic number set(ONNS)presented by Ye et al.can be described by the truth and falsity indeterminacy degrees.Then,ONNS demonstrates its advantages in the indeterminate information expression,aggregations,and DM problems with some indeterminate ranges.However,the existing research lacks some similarity measures between ONNSs.They are indispensable mathematical tools and play a crucial role in DM,pattern recognition,and clustering analysis.Thus,it is necessary to propose some similaritymeasures betweenONNSs to supplement the gap.To solve the issue,this study firstly proposes the p-indeterminate cosine measure,p-indeterminate Dice measure,p-indeterminate Jaccard measure of ONNSs(i.e.,the three parameterized indeterminate vector similarity measures of ONNSs)in vector space.Then,a DMmethod based on the parameterized indeterminate vector similarity measures of ONNSs is developed to solve indeterminate multiple attribute DM problems by choosing different indeterminate degrees of the parameter p,such as the small indeterminate degree(p=0)or the moderate indeterminate degree(p=0.5)or the big indeterminate degree(p=1).Lastly,an actual DM example on choosing a suitable logistics supplier is provided to demonstrate the flexibility and practicability of the developed DM approach in indeterminate DM problems.By comparison with existing relative DM methods,the superiority of this study is that the established DMapproach indicates its flexibility and suitability depending on decision makers’indeterminate degrees(decision risks)in ONNS setting.
文摘Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.
基金Supported by Natural Science Foundation of the Higher Education Institutions of Jiangsu Province(Grant No.10KJB110003)Jiangsu University of Science and Technology(Grant No.2010SL101J)+1 种基金National Natural Science Foundation of China(Grant No.71271119)National Social Science Foundation of China(Grant No.11BGL039)
文摘LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical(in short,fractional ID-k-factor-critical),if G I has a fractional k-factor for every independent set I of G.The binding number bind(G)of a graph G is defined as bind(G)=min|NG(X)||X|:=X V(G),NG(X)=V(G).In this paper,it is proved that a graph G is fractional ID-k-factor-critical if n≥6k 9 and bind(G)〉(3k 1)(n 1)kn 2k+2.
文摘The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves a resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. In this paper, we find this number and classify all optimal sets for the augmented k-ary n-cubes with even k ≥ 4.