eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 1 17 article Gee-Choon Lau geeclau@yahoo.com 1 Wai-Chee Shiu wcshiu@associate.hkbu.edu.hk 2 Ho-Kuen Ng ho-kuen.ng@sjsu.edu 3 Faculty of Computer & Mathematical Sciences, Universiti Teknologi MARA (UiTM) Malaysia Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong Department of Mathematics, San José State University, San José CA 95192 USA An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f:E →{1,... ,|E|} such that for any pair of adjacent vertices x and y, f+(x)≠ f+(y), where the induced vertex label f+(x)= ∑ f(e), with e ranging over all the edges incident to x.  The local antimagic chromatic number of G, denoted by Xla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, the sharp lower bound of the local antimagic chromatic number of a graph with cut-vertices given by pendants is obtained. The exact value of the local antimagic chromatic number of many families of graphs with cut-vertices (possibly given by pendant edges) are also determined. Consequently, we partially answered Problem 3.1 in [Local antimagic vertex coloring of a graph, Graphs and Combin., 33, (2017),  275--285]. http://ijmsi.ir/article-1-1726-en.pdf Local antimagic labeling Local antimagic chromatic number Cut-vertices Pendants. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 19 33 article Moosa Gabeleh Gabeleh@abru.ac.ir 1 Lotfollah Karimi lkarimi@hut.ac.ir 2 Calogero Vetro calogero.vetro@unipa.it 3 Department of Mathematics, Ayatollah Boroujerdi University, Boroujerd, Iran Department of Electrical Engineering, Hamedan University of Technology, Hamedan, Iran Department of Mathematics and Computer Science, University of Palermo, Via Archirafi 34, 90123, Palermo, Italy In the setting of uniformly convex Banach spaces equipped with a partially ordered relation, we survey the existence of fixed points for monotone orbitally nonexpansive mappings. In this way, we extend and improve the main results of Alfuraidan and Khamsi [M. R. Alfuraidan, M. A. Khamsi, Proc. Amer. Math. Soc., 146, (2018), 2451-2456]. Examples are given to show the usability of our main conclusions. We also study the existence of an optimal solution for cyclic contractions in such spaces. http://ijmsi.ir/article-1-1729-en.pdf Best proximity point T -cyclic contraction Monotone orbitally nonexpansive mapping Uniformly convex Banach space. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 35 49 article Nihan Baydar Yarbil nihan.baydar.yarbil@ege.edu.tr 1 Nurcan Argaç nurcan.argac@ege.edu.tr 2 Department of Mathematics, Ege University Bornova, Izmir 35100, Turkey Department of Mathematics, Ege University Bornova, Izmir 35100, Turkey Let R be a prime ring with center Z(R) and G be a generalized α-derivation of R for  α∈ Aut(R). Let a ∈ R be a nonzero element and n be a fixed positive integer. (i) If aG(x)n ∈ Z(R) for all x ∈ R then aG(x) = 0 for all x ∈ R unless dimCRC = 4. (ii) If aG(x)n ∈ Z(R) for all x ∈ L, where L is a noncommutative Lie ideal of R then aG(x) = 0 for all x ∈ R unless dimCRC = 4. http://ijmsi.ir/article-1-1700-en.pdf Prime ring Lie ideal Generalized skew derivation Generalized derivation Automorphism Right Martindale quotient ring Two-sided Martindale quotient ring Generalized polynomial identity eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 51 62 article Saeid Jamali saeid.jamali@modares.ac.ir 1 Department of Pure Mathematics, Faculty of Mathematical Sciences, Tarbiat Modares University, Tehran, Iran The tracial cyclic Rokhlin property for automorphisms of simple not necessarily unital C*-algebras is investigated. We show that the tracial cyclic Rokhlin property is preserved by going to certain restrictions to subalgebras and taking direct limit or tensor products of actions. We also show that under certain conditions properties such as real rank zero, the tracial rank zero, stable rank one, (tracial) Z-stability, Property (SP), strict comparison on projections are passed to crossed products under automorphisms with the tracial cyclic Rokhlin property. http://ijmsi.ir/article-1-1372-en.pdf Tracial cyclic Rokhlin property Crossed product Tracial rank Property $(mathrm{T}_{k})$. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 63 70 article Eric F. Bravo jbravo@unicauca.edu.co 1 Jhon J. Bravo eric.bravo@unad.edu.co 2 Departamento de Matemáticas, Universidad del Cauca, Calle 5 No. 4–70, Popayán, Colombia Departamento de Matemáticas, Universidad del Cauca, Calle 5 No. 4–70, Popayán, Colombia A positive integer is called a repdigit if it has only one distinct digit in its decimal expansion. In this paper, we find all repdigits that are products of consecutive Pell or Pell–Lucas numbers. This paper continues previous work which dealt with finding occurrences of repdigits in the Pell and Pell–Lucas sequences. p, li { white-space: pre-wrap; } http://ijmsi.ir/article-1-1746-en.pdf Pell and Pell–Lucas number Repdigit Linear form in logarithms Reduction method. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 71 83 article Sabiha Tabassum sabiha.math08@gmail.com 1 Ruqaiyya Fatma ruqaiyyafatma@rediffmail.com 2 Department of Applied Mathematics, Aligarh Muslim University, Aligarh-202002, India Department of Applied Mathematics, Aligarh Muslim University, Aligarh-202002, India In recent years, a variety of work has been done in the field of single, double and triple sequences. Study on n-tuple sequence is new in this field. The main interest of this paper is to explore the idea of n-tuple sequences x = (xi_1,i_2,...,i_n) in metric spaces. We introduce the concept of n-sequence space of interval number and discussed its arithmetic properties. Furthermore, we combined the concept of Orlicz function, statistical convergence, interval number and n-sequence to construct some new nsequence spaces and discussed their properties. Some suitable examples for these spaces have been constructed. http://ijmsi.ir/article-1-1717-en.pdf n-sequence Statistical convergence Interval number Orlicz function. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 85 93 article Chawalit Boonpok chawalit.b@msu.ac.th 1 Mathematics and Applied Mathematics Research Unit Department of Mathematics, Faculty of Science, Mahasarakham University Mahasarakham, 44150, Thailand This paper deals with the concepts of Iµ-g-closed sets, Iµ-semi-open sets and Iµ-semi-preopen sets in ideal topological spaces and investigate several properties of these sets. Some characterizations of Iµ -regular spaces and Iµ-normal spaces are discussed. http://ijmsi.ir/article-1-1723-en.pdf $mathscr{I}_mu$-g-closed set $mathscr{I}_mu$-semi-open set $mathscr{I}_mu$-semi-preopen set $mathscr{I}_mu$-normal space $mathscr{I}_mu$-regular space. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 95 105 article Raheleh Khoshtarash rakho86@gmail.com 1 Mohammad Reza Rajabzadeh Moghaddam rezam@ferdowsi.um.ac.ir 2 Mohammad Amin Rostamyari m.a.rostamyari@khayyam.ac.ir 3 Department of Mathematics, Mashhad Branch, Islamic Azad University, Mashhad, Iran Department of Mathematics, Khayyam University, Mashhad, Iran Department of Mathematics, Khayyam University, Mashhad, Iran In 2016, the second and third authors introduced the notion of 2-Engelizer of the element x in a given group G and denoted the set of all 2-Engelizers in G by E2(G). They also constructed the possible values of |E2(G)| [Bull. Korean Math. Soc., 53(3), (2016), 657-665]. In the present paper, we classify all non 2-Engel finite groups G, when |E2(G)| = 4, 5. http://ijmsi.ir/article-1-1691-en.pdf 2-Engelizer subgroup 2-Engel element 2-Engel group. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 107 115 article Said Boulmane said.boulmane@gmail.com 1 Department of Economic Sciences and Management Moulay Ismail University, Polydisciplinary Faculty, Errachidia-Morocco We give some new characterizations of semisimple alternative algebras among the pseudo-Euclidean alternative algebras. These charcterizations are based on the index of a pseudo Euclidean alternative algebra, operators of Casimir type and representations of alternative algebras. http://ijmsi.ir/article-1-1704-en.pdf Pseudo-Euclidean alternative algebras Semisimple alternative algebras Index of pseudo Euclidean alternative algebras Operators of Casimir type Representations of alternative algebras. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 117 133 article Mahdi Dehghani Darmain m.dehghanidarmian@gmail.com 1 Amir Hashemi amir.hashemi@ipm.ir 2 Department of Mathematics, Technical and Vocational University (TVU), Tehran, Iran Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, 84156-83111, Iran In this paper, we present a parametric F4 algorithm (socalled PF4) which can be considered as a generalization of Faugére’s F4 algorithm [8] to polynomial ideals with parametric coefficients. Our approach is based on the F4 algorithm, Montes DisPGB algorithm [21] and the parametric linear algebra method developed in [6]. The PF4 algorithm takes as input a parametric polynomial ideal and two monomial orderings on the variables and the parameters and returns a Gröbner system of the ideal with respect to a compatible elimination product of the given monomial orderings. We have implemented our new algorithm in Maple and give timings to compare its performance with those of (our implementation) of the Kapur et al. algorithm [16] and the DisPGB algorithm [21]. http://ijmsi.ir/article-1-1718-en.pdf Gröbner bases Gröbner systems F4 algorithm PF4 algorithm PGBMain algorithm DisPGB algorithm. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 135 148 article Kifayat Ullah kifayatmath@yahoo.com 1 Mujahid Abbas abbas.mujahid@gmail.com 2 Junaid Ahmad ahmadjunaid436@gmail.com 3 Fayyaz Ahmad fayyaz.rana83@gmail.com 4 Department of Mathematical Sciences, University of Lakki Marwat, Lakki Marwat-28420, Khyber Pakhtunkhwa, Pakistan Department of Mathematics, Government College University, Lahore 54000, Pakistan Department of Mathematics and Statistics, International Islamic University, H-10, Islamabad - 44000, Pakistan Department of Mathematical Sciences, University of Lakki Marwat, Lakki Marwat-28420, Khyber Pakhtunkhwa, Pakistan Suppose C is any nonempty subset of a Banach space X. A mapping T : C → C is said to satisfy condition (Bγ,µ) if there exists γ ∈ [0, 1] and µ ∈ [0, 1 /2 ] with 2µ ≤ γ such that for each two elements x, y ∈ C, γ||x - T x|| ≤ ||x - y|| + µ||y - T y|| implies ||T x - T y|| ≤ (1 - γ)||x - y|| + µ(||x - T y|| + ||y - T x||). In this research, we suggest some convergence results for these mappings under a up-to-date iterative process in a Banach space setting. Our results are new and improve some known results of the literature. http://ijmsi.ir/article-1-1714-en.pdf Condition $(B_{gamma mu})$ Condition (I) Convergence result K* iteration Banach space. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 149 160 article P Shanas Babu babushanas@gmail.com 1 Chithra A V chithra@nitc.ac.in 2 Department of Mathematics, National Institute of Technology, Calicut, Kerala, India-673601 Department of Mathematics, National Institute of Technology, Calicut, Kerala, India-673601 A vertex coloring of a graph G is called acyclic if no two adjacent vertices have the same color and no cycle in G is bichromatic. The acyclic chromatic number a(G) of a graph G is the least number of colors in an acyclic coloring of G. In this paper, we obtain bound for the acyclic chromatic number of the strong product of a tree and a graph. An exact value for the acyclic chromatic number of the strong product of two trees is derived. Further observations are made on the upper bound for the strong product of three paths. http://ijmsi.ir/article-1-1743-en.pdf Strong product of graphs Acyclic coloring Acyclic chromatic number. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 161 174 article Ashish Pathak ashishpathak@bhu.ac.in 1 Dileep Kumar dkbhu07@gmail.com 2 Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi-221005, India Department of Applied Science and Humanities (Mathematics), GL Bajaj Institute of Technology and Management, Greater Noida-201306, India A general concept of wavelets and multiresolution analysis on Sobolev space over local fields of positive characteristic (Hs(K)) is given. A characterization of the scaling functions associated with an MRA is also given. http://ijmsi.ir/article-1-1443-en.pdf Wavelets Multiresolution analysis Local fields Sobolev space Fourier transform. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 175 192 article Pradip Ramesh Patle deepesh456@gmail.com 1 Deepesh Kumar Patel pradip.patle12@gmail.com 2 Department of Mathematics, Visvesvaraya National Institute of Technology, Nagpur-440010, India Department of Mathematics School of Advanced Sciences, VIT-AP University, Amravati-522237, Andhra Pradesh The concept of measure of noncompactness (MNC) allows us to select an important class of mappings which are more general than compact operators. The proposed work exploits the axiomatic definitio of MNC and introduces the notion of relatively nonexpansive cyclic (noncyclic) SR-condensing operators along with the aid of SR-functions. The first phase of the paper concentrates on establishing the best proximity point (pair) theorems for such operators. The main results in this manuscript extend and generalize several state of art literature on Darbo type fixed point results. In the second phase, proposed results are applied to show the actuality of optimum solutions for system of second order differential equations with two initial conditions. http://ijmsi.ir/article-1-1750-en.pdf Darbo fixed point theorem Best proximity point Measure of noncompactness R-function. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 193 209 article Irem Baglan isakinc@kocaeli.edu.tr 1 Fatma Kanca fatma.kanca@fbu.edu.tr 2 Vishnu Narayan Mishra Mishra vishnunarayanmishra@gmail.com 3 Department of Mathematics, Kocaeli University, Kocaeli 41380, Turkey Department of Computer Engineering, Fenerbahce University, Istanbul, Turkey Department of Mathematics, Indira Gandhi National Tribal University, Lalpur, Amarkantak, Anuppur, Madhya Pradesh 484 887, India In this work, the inverse quasi-linear pseudo-parabolic problem was investigated. We demonstrated the solution by the Fourier approximation. The inverse problem was first examined by linearizing and then used implicit finite difference schema for the numerical solution. http://ijmsi.ir/article-1-1757-en.pdf Pseudo-parabolic problem Fourier method Nonlocal(periodic) boundary condition Implicit method. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 211 232 article Lafhim Lahoussine lafhim68@gmail.com 1 LASMA Laboratory, Faculty of Sciences Dhar El Mehrez, Sidi Mohammed Ben Abdelah University, Department of Mathematics, Fes, Morocco In this paper, first and second order optimality conditions using the concept of approximations are developed for an optimistic fractional multiobjective bilevel problem with non-convex lower level problem. Our idea is based on using the properties of approximations in nonsmooth analysis and a separation theorem in convex analysis. All over the article, the data is assumed to be continuous but not necessarily Lipschitz. http://ijmsi.ir/article-1-1758-en.pdf Fractional Bilevel programming Optimal value function Second order approximation Optimality conditions Multiobjective optimization. eng ACECR at Tarbiat Modares University Iranian Journal of Mathematical Sciences and Informatics 1735-4463 2008-9473 2024-04 19 1 233 249 article The Name of Authors in this Volume ma.hoseinzade@gmai.com 1 Academic Center for Education, Culture and Research (ACECR) Please see the full text contains the Persian abstracts of this volume. http://ijmsi.ir/article-1-2647-en.pdf ABSTRACTS PERSIAN Vol. 19 No. 1.