Shahid Bahonar University of KermanJournal of Mahani Mathematical Research2251-79527220181001I-homomorphism for BL-I-General L-fuzzy Automata5777219610.22103/jmmrc.2018.12475.1067ENMarziehShamsizadehDepartment of Mathematics, Graduate University of Advanced Technology, Kerman, Iran0000-0002-9336-289XMohammad MehdiZahediDepartment of Mathematics Graduate University of Advanced Technology, Kerman, Iran0000-0003-3197-9904KhadijehAbolpourDepartment of Mathematics, Shiraz Branch, Islamic Azad University, Shiraz, Iran0000-0001-9402-5441Journal Article20180721Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.<br />Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuitionistic general L-fuzzy automaton. Fortunately, this quotient is the minimal BL-intuitionistic general L-fuzzy automaton. In addition, in this study, we show that if there is an I-bisimulation between two BL-intuitionistic general L-fuzzy automata, then they have the same behavior. Furthermore, we give an algorithm which determines the I-bisimulation between any two BL-intuitionistic general L-fuzzy automata. To clarify the notions and the results obtained in this paper, we have submitted some examples as well.Shahid Bahonar University of KermanJournal of Mahani Mathematical Research2251-79527220181001FINITENESS PROPERTIES OF LOCALE COHOMOLOGY MODULES FOR (I;J)- MINIMAX MODULES7994220310.22103/jmmrc.2018.12807.1072ENJavadTayyebitabrizJournal Article20181002ABSTRACT. Let R be a commutative noetherian ring, I and J are two ideals of R. In<br />this paper we introduce the concept of (I;J)- minimax R- module, and it is shown that<br />if M is an (I;J)- minimax R- module and t a non-negative integer such that Hi<br />I;J(M) is<br />(I;J)- minimax for all iShahid Bahonar University of KermanJournal of Mahani Mathematical Research2251-79527220181001SGLT-MAJORIZATION ON Mn,m AND ITS LINEAR PRESERVERS95104223710.22103/jmmrc.2019.12385.1061ENAsmaIlkhanizadeh ManeshDepartment of Mathematics, vali-e-asr University, Rafsanjan, Iran0000-0003-4879-9600Journal Article20180701A matrix R is said to be g-row substochastic if Re ≤ e. For X, Y ∈ Mn,m, it is said that X is sglt-majorized by Y , X ≺sglt Y , if there exists an n-by-n lower triangular g-row substochastic matrix R such that X = RY . This paper characterizes all (strong) linear preservers and strong linear preservers of ≺sglt on Rn and Mn,m, respectively.Shahid Bahonar University of KermanJournal of Mahani Mathematical Research2251-79527220181001Application of moving kriging interpolation based on the meshless local Petrov-Galerkin (MK-MLPG) method for the two-dimensional time-dependent Schrodinger equation105125224110.22103/jmmrc.2019.12431.1063ENEsmailHesameddiniDepartment of Mathematical Sciences, Shiraz University of Technology, Shiraz, IranAliHabibiradDepartment of Applied Mathematics Faculty of Basic Sciences, Shiraz University of Technology, shiraz, IranJournal Article20180711In this article, an efficient numerical technique for solving the two-dimensional time-dependent Schrodinger equation is presented. At first, we employ the meshless<br />local Petrov-Galerkin (MLPG) method based on a local weak formulation to construct a system of discretized equations and then the solution of time-dependentSchrodinger<br />equation will be approximated. We use the Moving Kriging (MK) interpolation instead<br />of Moving least Square (MLS) approximation to construct the MLPG shape functions<br />and hence the Heaviside step function is chosen to be the test function. In this method,<br />no mesh is needed neither for integration of the local weak form nor construction of the<br />shape functions. So, the MLPG is truly a meshless method. Several numerical examples<br />are presented and the results are compared to their analytical and RBF<br />solutions to illustrate the accuracy and capability of this algorithm.