Journal of Mahani Mathematical Research
Volume:11 Issue: 2, Summer and Autumn 2022

In this paper, some designs from the primitive permutation representations of the groups PSL2(81)PSL2(81) and PSL2(89)PSL2(89) are constructed using the Key-Moori Method 1. We determine the automorphism groups of all the obtained designs and prove that the groups PSL2(81)PSL2(81), PSL2(81).2PSL2(81).2, PSL2(81):2PSL2(81):2, PGL2(81)PGL2(81), PΣL2(81)PΣL2(81), PΓL2(81)PΓL2(81), PSL2(89)PSL2(89) and PSL2(89):2PSL2(89):2 appear as the automorphism groups of these constructed designs.

In this paper, we investigate an interesting subclass of univalent functions. Also, we introduce a new subclass of meromorphic bi-univalent functions. We obtain the estimates on the initial Taylor-Maclurin Coefficients for functions in the interesting subclass of meromorphically bi-univalent functions defined on Δ={z∈C: 1<|z|<∞}Δ={z∈C: 1<|z|<∞}.

Our ultimate goal in this paper is to introduce a special type of topological spaces including manifolds and also, orbifolds. Because of using of generalized groups, we call them GGGG-spaces. We will study their properties, and then we will introduce a special GGGG-space that is not manifold and orbifold. Finally we obtain conditions that cause a GGGG-space to become manifold.

In this papers we investigate the Hyers-Ulam stability of the following 2-dimensional Pexider quadratic functional equation f(x+y,z+w)+f(x−y,z−w)=2g(x,z)+2g(y,w) in non-Archimedean normed spaces.

In Mobile Ad-hoc Networks (MANETs), each node is free to move and connect with another over a wireless connection, without the requirement for a centralized controller or base station. These features make MANET useful and functional in a variety of areas, including tactical situations, sensor networks, and rescue operations. However, this type of network also has a range of issues such as security, Quality of Service, dynamic topology, scalability, the absence of central management, and energy consumption. In MANETs, some of the nodes do not take part in forwarding packets to other nodes to conserve their resources such as energy, bandwidth, and power. The nodes which act selfishly to conserve their resources are called selfish nodes. In recent years, mobile ad hoc networks have become a very popular research topic. In this paper, we classified techniques for detecting selfish nodes in 4 categories namely reputation-based scheme, credit-based scheme, acknowledgment-based scheme, and game-theoretic scheme. Then we mentioned different methods available for reducing the effect of selfish nodes in mobile ad hoc networks. Finally tables 1 and 2 show the comparison of techniques for detecting selfish nodes.

Resources scarcity, available capabilities and cost-benefit point of view, make it essential to select the best project(s) from available project portfolio. Project selection process has a significant role in the success. Here the main problem is what projects must be selected and how manage simultaneous projects. Used approach to answer these questions must be real, fast, global, flexible, economic and easy to use. It is clear that choosing a good approach for project selection problem with economic and non-economic criteria can be vital for a project manager to success within constraints. The complexity of this problem increases as the number of projects and the number of objectives increase. Therefore, in this research we aim to present a heuristic based on genetic and simulates annealing to select and prioritize available projects based on economic and non-economic criteria. Considered issues are benefit, credit and risk (technical and financial). Presented method starts from multi population of generated solutions and moves toward the final solution. Comparison studies between our method with other recently method in the literature demonstrates the capability of it to find a good basket of projects. Experimental results demonstrate that this method can be used for all kinds of projects basket.

The aim of this paper is to define the concepts of remotest points and approximate remotest points in G-metric spaces and obtain some existence results on these concepts. In particular, we define G-remotest points and G-ϵ-approximate remotest points by considering a cyclic map and prove some results in G-metric spaces.

This paper introduces a novel concept of $KM$-single valued neutrosophic Hausdorff space and $KM$-single valued neutrosophic manifold space. This study generalizes the concept of $KM$-single valued neutrosophic manifold space to union and product of $KM$-single valued neutrosophic manifold space and in this regard investigates some product of $KM$-single valued neutrosophic manifold spaces. Indeed, this study analyses the notation of $KM$-single valued neutrosophic manifold based on a valued-level subset.

In this survey, two new control charts CCLR and CCALR for bivariate exponential variables by dependence structure based on Farlie-Gumbel-Morgenstern copula model are introduced. Simulation study is done to make a comparison between two proposed control charts in terms of average run length (ARL). Results show that the CCALR performs better than CCLR. Anumerical example is provided to fortify the theoretical findings.

‎A matrix AA is said to be multivariate majorized by a matrix BB‎, ‎written A≺BA≺B‎, ‎if there exists a doubly stochastic matrix DD such that A=BDA=BD‎ . ‎In the present paper‎, ‎we obtain a totally ordered subset of MnmMnm which contains a given matrix AA‎. ‎Also‎, ‎we show that the totality of all extreme points of the collection of all the matrices which are multivariate‏‎ly‎ majorized by a matrix AA is the set of all matrices obtained by permuting the columns of AA‎.

In the study of partially ordered sets, topologies such as Scott-topology have shown to be of paramount importance. In order to have analogous topology-like tools in the more general setting of quantitative domains, we introduce a method to construct Scotttopology on a set equipped with a transitive binary relation which we call t-set. As an application of this result there is a Scott-topology associated to any topology induced by its specialization pre-ordered relation. Some relations between this topology and the original topology are investigated.

The current article presents a novel hybrid approach based on the Rothe time-marching algorithm and a spectral matrix collocation approach using the well-known Newton bases to deal with the spatial variable. Utilizing the Rothe approach converts the underlying convection-diffusion into initial-boundary value problems and then the Newton collocation method solves the continuous discretized time equation in each time step. The error analysis of the newly employed basis functions is established. Three numerical simulations are developed to show the accuracy and utility of the proposed hybrid strategy.Applying the current study to other linear and nonlinear PDEs and high-order PDEs can be performed straightforwardly.