Enoch Suleiman - Academia.edu (original) (raw)
Papers by Enoch Suleiman
International journal of computational and applied mathematics & computer science, Jun 18, 2024
CRC Press eBooks, Apr 16, 2024
Trends in mathematics, 2024
Trends in mathematics, 2024
Smart innovation, systems and technologies, 2023
Journal of Applied Mathematics
Graph theory (GT) is a mathematical field that involves the study of graphs or diagrams that cont... more Graph theory (GT) is a mathematical field that involves the study of graphs or diagrams that contain points and lines to represent the representation of mathematical truth in a diagrammatic format. From simple graphs, complex network architectures can be built using graph operations. Topological indices (TI) are graph invariants that correlate the physicochemical and interesting properties of different graphs. TI deal with many properties of molecular structure as well. It is important to compute the TI of complex structures. The corona product (CP) of two graphs G and H gives us a new graph obtained by taking one copy of G and V G copies of H and joining the i th vertex of G to every vertex in the i th copy of H . In this paper, based on various CP graphs composed of paths, cycles, and complete graphs, the geometric index (GA) and atom bond connectivity (ABC) index are investigated. Particularly, we discussed the corona products P s ⨀ P t , C t ⨀ C s , K t ⊙ K s , K t ⊙ P s , and...
Journal of Discrete Mathematical Sciences and Cryptography
In this research, one of the non-classical sets, the permutation set, is utilized to analyze a ne... more In this research, one of the non-classical sets, the permutation set, is utilized to analyze a new class of topological groups induced by β-sets, it is named permutation topological groups, and investigates some of its basic features. In addition, several results are applied to our permutation topological group class.
African Scientific Reports, 2023
Wreath product, a powerful construction in group theory, has found extensive applications in vari... more Wreath product, a powerful construction in group theory, has found extensive applications in various areas of mathematics and computer science. In this paper, we present a comprehensive analysis of coding matrices associated with wreath products. The coding matrices for the wreath product of two cyclic finite groups were given for the first time. It gives a generalization of the coding matrices for the semi-direct product. We found out that the coding matrix of wreath product really has the same shape as the one for semidirect product and gave the RW-matrix for the coding matrix. An example was showed to illustrate the assertions. Conditions were also given for different wreath products of cyclic groups and that gives different orders for the wreath products.
2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI)
A research has been conducted at the Department of Mathematics, Faculty of Science, Federal Unive... more A research has been conducted at the Department of Mathematics, Faculty of Science, Federal University, Gashua, Yobe State to study the treatment of multistep collocation method for the direct solution of second order ordinary differential equations using a class of modified BDF-type with one super-future point. The research has proposed the construction of a new method of solving second-order initial valued problem of ordinary differential equation. A step-number, k = 3, a number of discrete members are obtained and used in block through multi-step collocation approach. The stability properties of the newly to be constructed methods are investigated using written computer codes and its convergence are established. The numerical efficiency of the method has been tested on some treated second-order initial valued problems, in order to ascertain its suitability. The solutions of the problems are compared with the corresponding exact solutions and the associated absolute errors are pre...
International Conference on Mathematical and Statistical Physics, Computational Science, Education, and Communication (ICMSCE 2022), Apr 10, 2023
arXiv (Cornell University), Feb 27, 2023
A transitive permutation group G on a finite set Ω is said to be pre-primitive if every G-invaria... more A transitive permutation group G on a finite set Ω is said to be pre-primitive if every G-invariant partition of Ω is the orbit partition of a subgroup of G. It follows that pre-primitivity and quasiprimitivity are logically independent (there are groups satisfying one but not the other) and their conjunction is equivalent to primitivity. Indeed, part of the motivation for studying pre-primitivity is to investigate the gap between primitivity and quasiprimitivity. We investigate the pre-primitivity of various classes of transitive groups including groups with regular normal subgroups, direct and wreath products, and diagonal groups. In the course of this investigation, we describe all G-invariant partitions for various classes of permutation groups G. We also look briefly at conditions similarly related to other pairs of conditions, including transitivity and quasiprimitivity, k-homogeneity and k-transitivity, and primitivity and synchronization.
2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI)
2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI)
2022 14th International Conference on Mathematics, Actuarial Science, Computer Science and Statistics (MACS), Nov 12, 2022
arXiv (Cornell University), Oct 27, 2022
Dedicated to Daniela Nikolva on the occasion of her 70 th birthday. We give a short proof for an ... more Dedicated to Daniela Nikolva on the occasion of her 70 th birthday. We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order p, acting on a set of given size n, which is sharp for certain n and p. Namely, we prove that if n ≡ k (mod p) with 0 ≤ k ≤ p − 1, then this proportion is at most (p • k!) −1 with equality if and only if p ≤ n < 2n.
2022 14th International Conference on Mathematics, Actuarial Science, Computer Science and Statistics (MACS)
International journal of computational and applied mathematics & computer science, Jun 18, 2024
CRC Press eBooks, Apr 16, 2024
Trends in mathematics, 2024
Trends in mathematics, 2024
Smart innovation, systems and technologies, 2023
Journal of Applied Mathematics
Graph theory (GT) is a mathematical field that involves the study of graphs or diagrams that cont... more Graph theory (GT) is a mathematical field that involves the study of graphs or diagrams that contain points and lines to represent the representation of mathematical truth in a diagrammatic format. From simple graphs, complex network architectures can be built using graph operations. Topological indices (TI) are graph invariants that correlate the physicochemical and interesting properties of different graphs. TI deal with many properties of molecular structure as well. It is important to compute the TI of complex structures. The corona product (CP) of two graphs G and H gives us a new graph obtained by taking one copy of G and V G copies of H and joining the i th vertex of G to every vertex in the i th copy of H . In this paper, based on various CP graphs composed of paths, cycles, and complete graphs, the geometric index (GA) and atom bond connectivity (ABC) index are investigated. Particularly, we discussed the corona products P s ⨀ P t , C t ⨀ C s , K t ⊙ K s , K t ⊙ P s , and...
Journal of Discrete Mathematical Sciences and Cryptography
In this research, one of the non-classical sets, the permutation set, is utilized to analyze a ne... more In this research, one of the non-classical sets, the permutation set, is utilized to analyze a new class of topological groups induced by β-sets, it is named permutation topological groups, and investigates some of its basic features. In addition, several results are applied to our permutation topological group class.
African Scientific Reports, 2023
Wreath product, a powerful construction in group theory, has found extensive applications in vari... more Wreath product, a powerful construction in group theory, has found extensive applications in various areas of mathematics and computer science. In this paper, we present a comprehensive analysis of coding matrices associated with wreath products. The coding matrices for the wreath product of two cyclic finite groups were given for the first time. It gives a generalization of the coding matrices for the semi-direct product. We found out that the coding matrix of wreath product really has the same shape as the one for semidirect product and gave the RW-matrix for the coding matrix. An example was showed to illustrate the assertions. Conditions were also given for different wreath products of cyclic groups and that gives different orders for the wreath products.
2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI)
A research has been conducted at the Department of Mathematics, Faculty of Science, Federal Unive... more A research has been conducted at the Department of Mathematics, Faculty of Science, Federal University, Gashua, Yobe State to study the treatment of multistep collocation method for the direct solution of second order ordinary differential equations using a class of modified BDF-type with one super-future point. The research has proposed the construction of a new method of solving second-order initial valued problem of ordinary differential equation. A step-number, k = 3, a number of discrete members are obtained and used in block through multi-step collocation approach. The stability properties of the newly to be constructed methods are investigated using written computer codes and its convergence are established. The numerical efficiency of the method has been tested on some treated second-order initial valued problems, in order to ascertain its suitability. The solutions of the problems are compared with the corresponding exact solutions and the associated absolute errors are pre...
International Conference on Mathematical and Statistical Physics, Computational Science, Education, and Communication (ICMSCE 2022), Apr 10, 2023
arXiv (Cornell University), Feb 27, 2023
A transitive permutation group G on a finite set Ω is said to be pre-primitive if every G-invaria... more A transitive permutation group G on a finite set Ω is said to be pre-primitive if every G-invariant partition of Ω is the orbit partition of a subgroup of G. It follows that pre-primitivity and quasiprimitivity are logically independent (there are groups satisfying one but not the other) and their conjunction is equivalent to primitivity. Indeed, part of the motivation for studying pre-primitivity is to investigate the gap between primitivity and quasiprimitivity. We investigate the pre-primitivity of various classes of transitive groups including groups with regular normal subgroups, direct and wreath products, and diagonal groups. In the course of this investigation, we describe all G-invariant partitions for various classes of permutation groups G. We also look briefly at conditions similarly related to other pairs of conditions, including transitivity and quasiprimitivity, k-homogeneity and k-transitivity, and primitivity and synchronization.
2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI)
2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI)
2022 14th International Conference on Mathematics, Actuarial Science, Computer Science and Statistics (MACS), Nov 12, 2022
arXiv (Cornell University), Oct 27, 2022
Dedicated to Daniela Nikolva on the occasion of her 70 th birthday. We give a short proof for an ... more Dedicated to Daniela Nikolva on the occasion of her 70 th birthday. We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order p, acting on a set of given size n, which is sharp for certain n and p. Namely, we prove that if n ≡ k (mod p) with 0 ≤ k ≤ p − 1, then this proportion is at most (p • k!) −1 with equality if and only if p ≤ n < 2n.
2022 14th International Conference on Mathematics, Actuarial Science, Computer Science and Statistics (MACS)