The aim of our work is to develop a new type of games which are related to (D, WD, LD) compactness of topological groups. We used an infinite game that corresponds to our work. Also, we used an alternating game in which the response of the second player depends on the choice of the first one. Many results of winning and losing strategies have been studied, consistent with the nature of the topological groups. As well as, we presented some topological groups, which fail to have winning strategies and we give some illustrated examples. Finally, the effect of functions on the aforementioned compactness strategies was studied.
The topic of supra.topological.spaces considered one of the important topics because it is a generalization to topological.spaces. Many researchers have presented generalizations to supra open sets such as supra semi.open and supra pre.open sets and others. In this paper, the concept of δ∼open sets was employed and introduced in to the concept of supra topology and a new type of open set was extracted, which was named S∼δ∼open. Our research entails the utilization of this category of sets to form a new concepts in these spaces, namely S∼δ∼limit points and S∼δ∼derive points, and examining its relationship with S∼open and S∼reg∼open. Based on this class of sets, we have introduced other new concepts such as S∼isolate
... Show MoreThis paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.
The significance fore supra topological spaces as a subject of study cannot be overstated, as they represent a broader framework than traditional topological spaces. Numerous scholars have proposed extension to supra open sets, including supra semi open sets, supra per open and others. In this research, a notion for ⱨ-supra open created within the generalizations of the supra topology of sets. Our investigation involves harnessing this style of sets to introduce modern notions in these spaces, specifically supra ⱨ - interior, supra ⱨ - closure, supra ⱨ - limit points, supra ⱨ - boundary points and supra ⱨ - exterior of sets. It has been examining the relationship with supra open. The research was also enriched with many
... Show MoreThe use of silicon carbide is increasing significantly in the fields of research and technology. Topological indices enable data gathering on algebraic graphs and provide a mathematical framework for analyzing the chemical structural characteristics. In this paper, well-known degree-based topological indices are used to analyze the chemical structures of silicon carbides. To evaluate the features of various chemical or non-chemical networks, a variety of topological indices are defined. In this paper, a new concept related to the degree of the graph called "bi-distance" is introduced, which is used to calculate all the additive as well as multiplicative degree-based indices for the isomer of silicon carbide, Si2
... Show MoreRecently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results
... Show MoreFor any group G, we define G/H (read” G mod H”) to be the set of left cosets of H in G and this set forms a group under the operation (a)(bH) = abH. The character table of rational representations study to gain the K( SL(2,81)) and K( SL(2, 729)) in this work.