S. M. Elsayed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
S. M. Elsayed has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Keng Meng Ng
SPMS School, NTU University, Jurong West, Singapore
1 shared publication- Tareq Mohammad Al-Shami
Department of Mathematics, Sana’a University, Sana’a, Yemen
1 shared publication
Latest Publications
- Open Access
- 1 January 2025
- Published by Wiley in Journal of Mathematics
- Vol. 2025 (1)
Investigating Novel Types of Coincidence and Quasi‐Coincidence Relations and Studying Equivalent Intuitionistic Fuzzy Sets
In this work, we modify the definition of intuitionistic fuzzy points so that the definition is concise, generalizes fuzzy points, and excludes . We establish new forms of relations between intuitionistic fuzzy sets and demonstrate that every quasi‐coincidence relation is coincidence. Then, we present and examine the concept of equivalence of intuitionistic fuzzy sets. We also study their prominent features and characteristics that aid in our comprehension of how they affect and are influenced by the other concepts in intuitionistic fuzzy topological spaces. Moreover, we define the concept of intuitionistic fuzzy R 0 topological spaces using the equivalence of each intuitionistic fuzzy set with its closure. Elucidative examples are provided to demonstrate the invalidity of some implementation results.
- 1 January 2025
- Published by Wiley in Journal of Mathematics
- Vol. 2025 (1)
Open AccessInvestigating Novel Types of Coincidence and Quasi‐Coincidence Relations and Studying Equivalent Intuitionistic Fuzzy Sets
In this work, we modify the definition of intuitionistic fuzzy points so that the definition is concise, generalizes fuzzy points, and excludes . We establish new forms of relations between intuitionistic fuzzy sets and demonstrate that every quasi‐coincidence relation is coincidence. Then, we present and examine the concept of equivalence of intuitionistic fuzzy sets. We also study their prominent features and characteristics that aid in our comprehension of how they affect and are influenced by the other concepts in intuitionistic fuzzy topological spaces. Moreover, we define the concept of intuitionistic fuzzy R 0 topological spaces using the equivalence of each intuitionistic fuzzy set with its closure. Elucidative examples are provided to demonstrate the invalidity of some implementation results.
- 12 October 2023
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 33 (9) , 781-808
Computable soft separation axioms
Soft sets were introduced as a means to study objects that are not defined in an absolute way and have found applications in numerous areas of mathematics, decision theory, and in statistical applications. Soft topological spaces were first considered in Shabir and Naz ((2011). Computers & Mathematics with Applications 61 (7) 1786–1799) and soft separation axioms for soft topological spaces were studied in El-Shafei et al. ((2018). Filomat 32 (13) 4755–4771), El-Shafei and Al-Shami ((2020). Computational and Applied Mathematics 39 (3) 1–17), Al-shami ((2021). Mathematical Problems in Engineering 2021). In this paper, we introduce the effective versions of soft separation axioms. Specifically, we focus our attention on computable u-soft and computable p-soft separation axioms and investigate various relations between them. We also compare the effective and classical versions of these soft separation axioms.
- 12 October 2023
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 33 (9) , 781-808
Computable soft separation axioms
Soft sets were introduced as a means to study objects that are not defined in an absolute way and have found applications in numerous areas of mathematics, decision theory, and in statistical applications. Soft topological spaces were first considered in Shabir and Naz ((2011). Computers & Mathematics with Applications 61 (7) 1786–1799) and soft separation axioms for soft topological spaces were studied in El-Shafei et al. ((2018). Filomat 32 (13) 4755–4771), El-Shafei and Al-Shami ((2020). Computational and Applied Mathematics 39 (3) 1–17), Al-shami ((2021). Mathematical Problems in Engineering 2021). In this paper, we introduce the effective versions of soft separation axioms. Specifically, we focus our attention on computable u-soft and computable p-soft separation axioms and investigate various relations between them. We also compare the effective and classical versions of these soft separation axioms.
- 12 December 2022
- Published by Springer Nature in Soft Computing
- Vol. 27 (2) , 691-699
Soft equivalent sets
- 12 December 2022
- Published by Springer Nature in Soft Computing
- Vol. 27 (2) , 691-699
Soft equivalent sets
- 1 March 2001
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 41 (5-6) , 579-588
Two iteration processes for computing positive definite solutions of the equation X - A*X−nA = Q
- 1 March 2001
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 41 (5-6) , 579-588
Two iteration processes for computing positive definite solutions of the equation X - A*X−nA = Q