Shahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Carleson measure and composition operators on
vector valued weighted Besov type spacesCarleson measure and composition operators on
vector valued weighted Besov type spaces1121730510.22055/jamm.2022.38918.1974FASepideNasresfahaniDepartment of Pure Mathematics, Faculty of Mathematics and statistics, University of Isfahan,
Isfahan, IranMostafaHassanlouEngineering Faculty of Khoy, Urmia University of Technology, Urmia, IranEbrahimAbbasiDepartment of Mathematics, Mahabad Branch, Islamic Azad University, Mahabad, IranJournal Article20211021In this paper we investigate composition operator $C_phi$ and also product of composition and differentiation $C_phi D$ and $D C_phi$ on vector valued weighted Besov type space $mathcal{B}^p_v(X)$ and weak vector valued weighted Besov type space $wmathcal{B}^p_v(X)$ for complex Banach space $X$ and $1leq p<2$ and equivalent conditions for boundedness and compactness of these operators on such spaces have been obtained using Carleson measure.In this paper we investigate composition operator $C_phi$ and also product of composition and differentiation $C_phi D$ and $D C_phi$ on vector valued weighted Besov type space $mathcal{B}^p_v(X)$ and weak vector valued weighted Besov type space $wmathcal{B}^p_v(X)$ for complex Banach space $X$ and $1leq p<2$ and equivalent conditions for boundedness and compactness of these operators on such spaces have been obtained using Carleson measure.https://jamm.scu.ac.ir/article_17305_346483762fee4e056c004b2289f9fcde.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Simultaneous Modeling of Mean and Variance In Augmented Mixed Beta RegressionSimultaneous Modeling of Mean and Variance In Augmented Mixed Beta Regression13231730810.22055/jamm.2022.34594.1841FAZohrehFallah MohsenkhaniStatistical Research and Training Center, Tehran, IranParvinAzhdariDepartment of statistics, Islamic Azad University Tehran North Branch, Tehran, Iran0000-0001-5091-8555Journal Article20200809Augmented Beta Regression models are used for modeling data such as rate, ratio or percentage. This model is made by combining the Beta distribution on the interval (0,1) and two degenerate distributions at 0 and 1. By reparameterizing the beta distribution, the mean and precision parameters are modeled with a structure including fixed and random effects. In this paper, simultaneous modeling of mean and precision the augmented mixed beta regression models is presented and the model efficiency in simulation studies by Bayesian approach is investigated. Next, the application of this model to analyze the proportions of employed persons in every household based on the results of the Statistical Center of Iran is shown and at the end, conclusion and results are presented.Augmented Beta Regression models are used for modeling data such as rate, ratio or percentage. This model is made by combining the Beta distribution on the interval (0,1) and two degenerate distributions at 0 and 1. By reparameterizing the beta distribution, the mean and precision parameters are modeled with a structure including fixed and random effects. In this paper, simultaneous modeling of mean and precision the augmented mixed beta regression models is presented and the model efficiency in simulation studies by Bayesian approach is investigated. Next, the application of this model to analyze the proportions of employed persons in every household based on the results of the Statistical Center of Iran is shown and at the end, conclusion and results are presented.https://jamm.scu.ac.ir/article_17308_3d151d801fb1e055b790d2add2be6eb9.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Right (left) nearregular seminearringsRight (left) nearregular seminearrings24331731310.22055/jamm.2022.35409.1865FAZhalehShamsiDepartment of mathematics, Qazvin Branch, Islamic Azad University, Qazvin, IranShabanGhalandarzadehFaculty of Mathematics, K. N. Toosi University of Technology, Tehran, IranParastooMalakootiradDepartment of mathematics, Qazvin Branch, Islamic Azad University, Qazvin, IranJournal Article19700101In this paper, as a generalization of regular and strongly regular elements of a semi near rings, we introduce the Concept of ( left ) right near regular elements. In the following, we investigate some properties of near regular semi near rings and presents the connection between reduced and strongly reduced elements.In this paper, as a generalization of regular and strongly regular elements of a semi near rings, we introduce the Concept of ( left ) right near regular elements. In the following, we investigate some properties of near regular semi near rings and presents the connection between reduced and strongly reduced elements.https://jamm.scu.ac.ir/article_17313_e06e1256e91e525d469aeeb4456b56da.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Basic Properties of generated algebra by weighted composition operators on different $L^{p}$ of atomic spacesBasic Properties of generated algebra by weighted composition operators on different $L^{p}$ of atomic spaces34441737010.22055/jamm.2022.37301.1927FAAboalghasemAlishahiDepartment of Mathematics, Payame Noor University, P. O. Box 19395-3697, Tehran, IranSaeedehShamsigamchiDepartment of Mathematics, Payame Noor University, P. O. Box 19395-3697, Tehran, IranAliEbadianDepartment of Mathematics, Faculty of Science, Urmia University, Urmia, IranJournal Article20210501In this paper, we continue the study of finite sum of weigted composition operators betweem different L^{p}-spaces. indeed, we first obtain some necessary and sufficient conditions for the compactness of finite sum of weighted composition operators between distinct L^p of atomic measure space . We also estimate the essential norms of these operators.In this paper, we continue the study of finite sum of weigted composition operators betweem different L^{p}-spaces. indeed, we first obtain some necessary and sufficient conditions for the compactness of finite sum of weighted composition operators between distinct L^p of atomic measure space . We also estimate the essential norms of these operators.https://jamm.scu.ac.ir/article_17370_29c65b1233047af5bce45a35b30a571b.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321ξ-closed subsets and rings of fractions of C(X)ξ-closed subsets and rings of fractions of C(X)45531737110.22055/jamm.2022.38630.1963FAAlirezaSalehiDepartment Science, Petroleum University of Technology, Ahvaz, IranJournal Article20210921A kind of multiplicative closed subset of C(X) namely ξ-closed subset is introduced. Relating to each ξ-multiplicative closed subset such as S of C(X) a filter F_S of subsets of X is presented and it is shown that the rings S^(-1) C(X) and the direct limits of continuous fractions on members of F_S are isomorphic.A kind of multiplicative closed subset of C(X) namely ξ-closed subset is introduced. Relating to each ξ-multiplicative closed subset such as S of C(X) a filter F_S of subsets of X is presented and it is shown that the rings S^(-1) C(X) and the direct limits of continuous fractions on members of F_S are isomorphic.https://jamm.scu.ac.ir/article_17371_fb83b11b42e1e5bcbcab383771cb301a.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321When is C+(X) the continuous semiring?When is C+(X) the continuous semiring?54611738210.22055/jamm.2022.37999.1953FAForoughDeldarFaculty of Mathematics, K. N. Toosi University of Technology, Tehran, Iran.ShabanGhalandarzadehFaculty of Mathematics, K. N. Toosi University of Technology, Tehran, Iran.MehrdadNamdariFaculty of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran.Journal Article20210808In this paper, after proving some results in commutative semirings, we focus on the semiring:<br /><br />C(X) of all continuous nonnegative realvalued functions on a space X with the positive operations,<br /><br />and then we charactrize the space X, such that C(X) is a continuous semiring. And give some properties of the semiring.In this paper, after proving some results in commutative semirings, we focus on the semiring:<br /><br />C(X) of all continuous nonnegative realvalued functions on a space X with the positive operations,<br /><br />and then we charactrize the space X, such that C(X) is a continuous semiring. And give some properties of the semiring.https://jamm.scu.ac.ir/article_17382_a6130745e18ff147213599e2660ba960.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Secrets of Frobenius GroupSecrets of Frobenius Group62701738510.22055/jamm.2022.38966.1975FAMohammadrezaDarafshehSchool of mathematics, statistics and computer science, College of Science, University of Theran,
Tehran, IranJournal Article20211022Abstract: The class of Frobenius groups is the important class of finite<br /><br />groups. They appear in both the theory of abstract groups as<br /><br />well as permutation groups and have applications. In this paper<br /><br />we have some important properties of Frobenius groups and<br /><br />classify a class of Frobenius groups called ℚ-groups.Abstract: The class of Frobenius groups is the important class of finite<br /><br />groups. They appear in both the theory of abstract groups as<br /><br />well as permutation groups and have applications. In this paper<br /><br />we have some important properties of Frobenius groups and<br /><br />classify a class of Frobenius groups called ℚ-groups.https://jamm.scu.ac.ir/article_17385_d80b1341bb5ec07c49f855ebec896b65.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Convex polygon and integer programmingConvex polygon and integer programming71801738610.22055/jamm.2022.39205.1981FAHadiBasirzadehDepartment of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran0000-0002-0960-1860MohamadYar AhmadiDepartment of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran0000-0002-8589-2575Journal Article19700101In this work, polygons of the integer sides are introduced. Moreover, by considering some Pythagorean-like relationships on these polygons, we prove that for all n-polygons of the aforementioned relationship, Pythagorean quasi-relations are satisfied. Furthermore, it is proved that the central angle of these polygons is not more than a constant value, so these polygons are always convex. Moreover, a nonlinear integer programming model for obtaining the integer sides of these polygons is presented.In this work, polygons of the integer sides are introduced. Moreover, by considering some Pythagorean-like relationships on these polygons, we prove that for all n-polygons of the aforementioned relationship, Pythagorean quasi-relations are satisfied. Furthermore, it is proved that the central angle of these polygons is not more than a constant value, so these polygons are always convex. Moreover, a nonlinear integer programming model for obtaining the integer sides of these polygons is presented.https://jamm.scu.ac.ir/article_17386_5ad8f9a85207d518a9514093df5025cd.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Eigenvalue -1 and triangle-free graphsEigenvalue -1 and triangle-free graphs81891740610.22055/jamm.2022.38047.1947FAHosseinEsmailianDepartment of Mathematics, K. N. Toosi University of Technology, P. O. Box 16765-3381, Tehran, IranEbrahimGhorbaniDepartment of Mathematics, K. N. Toosi University of Technology, P. O. Box 16765-3381, Tehran, IranJournal Article19700101Determining the maximum order of graphs whose adjacency matrices have an eigenvalue $mu$ with multiplicity $k$, is a problem which has been studied by several authors. The situation of the problem is quite different for the eigenvalues $-1,0$. In this paper, we investigate this problem for triangle-free graphs and for the eigenvalue $mu=-1$. As the main result of the paper, we prove that the order of graphs with maximum degree $d$ and the eigenvalue $-1$ with multiplicity $k>1$ is at most $k+d+1$. We also characterize the graphs attainting the lower bound.Determining the maximum order of graphs whose adjacency matrices have an eigenvalue $mu$ with multiplicity $k$, is a problem which has been studied by several authors. The situation of the problem is quite different for the eigenvalues $-1,0$. In this paper, we investigate this problem for triangle-free graphs and for the eigenvalue $mu=-1$. As the main result of the paper, we prove that the order of graphs with maximum degree $d$ and the eigenvalue $-1$ with multiplicity $k>1$ is at most $k+d+1$. We also characterize the graphs attainting the lower bound.https://jamm.scu.ac.ir/article_17406_6552881e2aa03d13f489f41a48b95e8a.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321A Multiobjective Programming Model for University Course Timetabling ProblemA Multiobjective Programming Model for University Course Timetabling Problem901071745610.22055/jamm.2022.39456.1990FAAlirezaHosseini DehmiryDepartment of Mathematics, Faculty of Mathematic Science, Vali-e-Asr University of Rafsanjan,
Iran0000-0002-5922-3749Mohammad ArefSamadiDepartment of Mathematics, Faculty of Mathematic Science, Vali-e-Asr University of Rafsanjan,
IranJournal Article19700101The university timetabling problem is one of principal management problem in the beginning of each semester in the colleges. There are many limitations related to classes, teachers and students that increase computational complexity and put the problem in the field of ”NP-Hard” class. In this study we tried to solve this problem in terms of zero-one multiobjective programming and devise a mathematical model of the problem using a minimum number of variables. The proposed approach is based on activity in order to reduce the number of variables to modeling the problem in an acceptable level.The university timetabling problem is one of principal management problem in the beginning of each semester in the colleges. There are many limitations related to classes, teachers and students that increase computational complexity and put the problem in the field of ”NP-Hard” class. In this study we tried to solve this problem in terms of zero-one multiobjective programming and devise a mathematical model of the problem using a minimum number of variables. The proposed approach is based on activity in order to reduce the number of variables to modeling the problem in an acceptable level.https://jamm.scu.ac.ir/article_17456_514528cd51b4bc7724ad686e24728bd4.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Structure of diagonal-invariant ideals in Exel-Pardo $*$-agebrasStructure of diagonal-invariant ideals in Exel-Pardo $*$-agebras1081171746310.22055/jamm.2022.36745.1901FAHosseinLarkiDepartment of Mathematics, Faculty of Mathematics and Computer Science, Shahid Chamran University of Ahvaz, Ahvaz, IranJournal Article19700101As a unified treatment of Katsura and Nekrashevych $C^*$-algebras, Exel and Pardo introduced self-similar graph $C^*$-algebras in 2017. More recently, the algebraic version of these $C^*$-algebras (called Exel-Pardo algebras) are introduced and considered by some authors. In this note, we study the ideal structure of Exel-Pardo algebras. To do this, we first give a short proof for representing these algebras as Steinberg algebras. Then, by this result, we characterize basic, graded, and diagonal-invariant ideals of Exel-Pardo algebras by underlying graph structure. This result generalizes the graded ideal structure of Leavitt path algebras to self-similar graphs.As a unified treatment of Katsura and Nekrashevych $C^*$-algebras, Exel and Pardo introduced self-similar graph $C^*$-algebras in 2017. More recently, the algebraic version of these $C^*$-algebras (called Exel-Pardo algebras) are introduced and considered by some authors. In this note, we study the ideal structure of Exel-Pardo algebras. To do this, we first give a short proof for representing these algebras as Steinberg algebras. Then, by this result, we characterize basic, graded, and diagonal-invariant ideals of Exel-Pardo algebras by underlying graph structure. This result generalizes the graded ideal structure of Leavitt path algebras to self-similar graphs.https://jamm.scu.ac.ir/article_17463_9e3ebf312698f9430c98f77d34f57696.pdfShahid Chamran University of AhvazJournal of Advanced Mathematical Modeling2251-808812120220321Image Reconstruction and Knowledgebase Tomography MechanismImage Reconstruction and Knowledgebase Tomography Mechanism1181371747410.22055/jamm.2022.39848.2006FALayaAfzalipourDepartment of Applied Mathematics, Faculty of Mathematics, Iran University of Science & Technology, Tehtan, IranTourajNikazadDepartment of Applied Mathematics, Faculty of Mathematics, Iran University of Science & Technology, Tehtan, IranJournal Article20220124In this study, the problem of image reconstruction (Inverse Problem) and its semantic relationship<br /><br />with a large range of applied and engineering problems are explained. The mechanism of tomographic<br /><br />which is an example of the image reconstruction problem is described. The existence and uniqueness of<br /><br />solutions and also regularization techniques are discussed. In order to better imagine abstract concepts, the process of digital X-ray imaging is presented using MATLAB. Image reconstruction techniques<br /><br />are described by Radon and Fourier transforms and algebraic methods. The effects of selecting the number of angles in tomography and additive noise in the data, on the quality of the reconstructed image are investigated. The numerical results and the comparison of images reconstructed by different methods confirm the special ability of algebraic techniques in image reconstruction. In addition, it is shown that in algebraic methods, desirable features such as positivity and smoothness can be considered for the reconstructed image, which has a significant effect on reducing the approximation error.In this study, the problem of image reconstruction (Inverse Problem) and its semantic relationship<br /><br />with a large range of applied and engineering problems are explained. The mechanism of tomographic<br /><br />which is an example of the image reconstruction problem is described. The existence and uniqueness of<br /><br />solutions and also regularization techniques are discussed. In order to better imagine abstract concepts, the process of digital X-ray imaging is presented using MATLAB. Image reconstruction techniques<br /><br />are described by Radon and Fourier transforms and algebraic methods. The effects of selecting the number of angles in tomography and additive noise in the data, on the quality of the reconstructed image are investigated. The numerical results and the comparison of images reconstructed by different methods confirm the special ability of algebraic techniques in image reconstruction. In addition, it is shown that in algebraic methods, desirable features such as positivity and smoothness can be considered for the reconstructed image, which has a significant effect on reducing the approximation error.https://jamm.scu.ac.ir/article_17474_22325982c327d34e7abef680141bb056.pdf