Abstract
This paper solves the issues of determining the number Fn of fuzzy subsets of a nonempty finite set X. To solve this, this paper incorporates the equivalence relation on the collection of all fuzzy subsets of X. We derive two closed explicit formulas for Fn, which is the sum of a finite series in the product of binomial numbers or the sum of k-level fuzzy subsets Fn,k by introducing a classification technique. Moreover, these explicit formulas enable us to find the number of the maximal chains of crisp subsets of X. Further, this paper presents some elementary properties of Fn,k and Fn.
| Original language | English |
|---|---|
| Article number | 1161 |
| Journal | Mathematics |
| Volume | 10 |
| Issue number | 7 |
| DOIs | |
| State | Published - 1 Apr 2022 |
| Externally published | Yes |
Keywords
- binomial numbers
- chains of crisp subsets
- finite fuzzy subsets
- integer sequences
- α-cuts
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- General Mathematics
- Engineering (miscellaneous)
Fingerprint
Dive into the research topics of 'On the Number of Finite Fuzzy Subsets with Analysis of Integer Sequences'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver