首页 > 最新文献

Journal of Mathematics最新文献

英文 中文
Certain Inequalities Related to the Generalized Numeric Range and Numeric Radius That Are Associated with Convex Functions 与凸函数相关的广义数值范围和数值半径有关的若干不等式
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-05-03 DOI: 10.1155/2024/4087305
Feras Bani-Ahmad, M. H. M. Rashid
In this paper, we delve into the intricate connections between the numerical ranges of specific operators and their transformations using a convex function. Furthermore, we derive inequalities related to the numerical radius. These relationships and inequalities are built upon well-established principles of convexity, which are applicable to non-negative real numbers and operator inequalities. To be more precise, our investigation yields the following outcome: consider the operators <svg height="8.68572pt" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 9.2729 8.68572" width="9.2729pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g></svg> and <span><svg height="8.68572pt" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 7.94191 8.68572" width="7.94191pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g></svg>,</span> both of which are positive and have spectra within the interval <span><svg height="11.439pt" style="vertical-align:-2.15067pt" version="1.1" viewbox="-0.0498162 -9.28833 17.706 11.439" width="17.706pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,4.485,0)"></path></g><g transform="matrix(.013,0,0,-0.013,14.742,0)"></path></g></svg><span></span><span><svg height="11.439pt" style="vertical-align:-2.15067pt" version="1.1" viewbox="19.835183800000003 -9.28833 17.521 11.439" width="17.521pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,19.885,0)"></path></g><g transform="matrix(.013,0,0,-0.013,32.693,0)"></path></g></svg>,</span></span> denoted as <svg height="11.5564pt" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 25.6752 11.5564" width="25.6752pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,7.347,0)"></path></g><g transform="matrix(.013,0,0,-0.013,11.845,0)"><use xlink:href="#g113-66"></use></g><g transform="matrix(.013,0,0,-0.013,20.98,0)"></path></g></svg> and <span><svg height="11.5564pt" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 24.3442 11.5564" width="24.3442pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-240"></use></g><g transform="matrix(.013,0,0,-0.013,7.347,0)"><use xlink:href="#g113-41"></use></g><g transform="matrix(.013,0,0,-0.013,11.845,0)"><use xlink:href="#g113-67"></use></g><g transform="matrix(.013,0,0,-0.013,19.658,0)"><use xlink:href="#g113-42"></use></g></svg>.</span> In addition, let us introduce two monotone contin
在本文中,我们深入探讨了特定算子的数值范围与利用凸函数对它们进行变换之间的复杂联系。此外,我们还推导出与数值半径相关的不等式。这些关系和不等式建立在凸性的既定原则之上,适用于非负实数和算子不等式。更确切地说,我们的研究得出以下结果:考虑算子 和 ,它们都是正数,并且在区间 内有谱,表示为 和 。 此外,让我们引入两个单调连续函数,即 ,和 ,定义在区间 上。假设 是一个正的、递增的凸函数,具有超乘法性质,即对于所有实数 和 ,我们有 。在这些特定条件下,我们建立了下面的不等式:对于所有 的 ,这个结果突出了表达式在凸函数变换时的数值范围与 的规范之间错综复杂的关系。 重要的是,这个不等式在 . 的广泛取值范围内都成立。 此外,我们还提供了支持性的例子来验证这些结果。
{"title":"Certain Inequalities Related to the Generalized Numeric Range and Numeric Radius That Are Associated with Convex Functions","authors":"Feras Bani-Ahmad, M. H. M. Rashid","doi":"10.1155/2024/4087305","DOIUrl":"https://doi.org/10.1155/2024/4087305","url":null,"abstract":"In this paper, we delve into the intricate connections between the numerical ranges of specific operators and their transformations using a convex function. Furthermore, we derive inequalities related to the numerical radius. These relationships and inequalities are built upon well-established principles of convexity, which are applicable to non-negative real numbers and operator inequalities. To be more precise, our investigation yields the following outcome: consider the operators &lt;svg height=\"8.68572pt\" style=\"vertical-align:-0.0498209pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 9.2729 8.68572\" width=\"9.2729pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt; and &lt;span&gt;&lt;svg height=\"8.68572pt\" style=\"vertical-align:-0.0498209pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 7.94191 8.68572\" width=\"7.94191pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;,&lt;/span&gt; both of which are positive and have spectra within the interval &lt;span&gt;&lt;svg height=\"11.439pt\" style=\"vertical-align:-2.15067pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 17.706 11.439\" width=\"17.706pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,4.485,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,14.742,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;span&gt;&lt;svg height=\"11.439pt\" style=\"vertical-align:-2.15067pt\" version=\"1.1\" viewbox=\"19.835183800000003 -9.28833 17.521 11.439\" width=\"17.521pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,19.885,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,32.693,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;,&lt;/span&gt;&lt;/span&gt; denoted as &lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 25.6752 11.5564\" width=\"25.6752pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,7.347,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,11.845,0)\"&gt;&lt;use xlink:href=\"#g113-66\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,20.98,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt; and &lt;span&gt;&lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 24.3442 11.5564\" width=\"24.3442pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-240\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,7.347,0)\"&gt;&lt;use xlink:href=\"#g113-41\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,11.845,0)\"&gt;&lt;use xlink:href=\"#g113-67\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,19.658,0)\"&gt;&lt;use xlink:href=\"#g113-42\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;.&lt;/span&gt; In addition, let us introduce two monotone contin","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"60 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140839548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing the -Clique Metric Dimension of Graphs via (Edge) Corona Products and Integer Linear Programming Model 通过(边)日冕乘积和整数线性规划模型计算图的-斜度量维度
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-30 DOI: 10.1155/2024/3241718
Zeinab Shahmiri, Mostafa Tavakoli
Let <svg height="8.8423pt" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 9.02496 8.8423" width="9.02496pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g></svg> be a graph with <svg height="6.1673pt" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 6.6501 6.1673" width="6.6501pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g></svg> vertices and <span><svg height="12.5794pt" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 26.71 12.5794" width="26.71pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.619,3.132)"></path></g><g transform="matrix(.013,0,0,-0.013,19.079,0)"></path></g></svg><span></span><svg height="12.5794pt" style="vertical-align:-3.29107pt" version="1.1" viewbox="30.2921838 -9.28833 20.53 12.5794" width="20.53pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,30.342,0)"></path></g><g transform="matrix(.013,0,0,-0.013,34.853,0)"></path></g><g transform="matrix(.013,0,0,-0.013,47.908,0)"></path></g></svg><span></span><svg height="12.5794pt" style="vertical-align:-3.29107pt" version="1.1" viewbox="54.454183799999996 -9.28833 10.208 12.5794" width="10.208pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,54.504,0)"><use xlink:href="#g113-89"></use></g></svg></span> is an <span><svg height="9.49473pt" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 3.60972 9.49473" width="3.60972pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-109"></use></g></svg>-</span>clique of <span><svg height="11.5564pt" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 13.5529 11.5564" width="13.5529pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-72"></use></g><g transform="matrix(.013,0,0,-0.013,8.892,0)"></path></g></svg>.</span> A vertex <span><svg height="11.5564pt" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 16.359 11.5564" width="16.359pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,9.495,0)"></path></g></svg><span></span><svg height="11.5564pt" style="vertical-align:-2.26807pt" version="1.1" viewbox="19.9411838 -9.28833 27.354 11.5564" width="27.354pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g tran
让 是一个有顶点的图,并且 是 的-clique。 如果 是 的距离函数,则称顶点解析了一对cliques。 对于一对cliques, 和 的解析邻域,用 表示,是解析了这对cliques的所有顶点的集合。对于每一对不同的 和 的-cliques,如果 的子集被称为 的-clique度量生成器,则 的-clique度量维度 ,用 ,表示,定义为 是 的-clique度量生成器。 本文计算了两个图的-clique度量维度的corona和边corona。此外,本文还提出了一个整数线性规划模型,用于计算给定图形及其-cliques 的-clique度量基础。
{"title":"Computing the -Clique Metric Dimension of Graphs via (Edge) Corona Products and Integer Linear Programming Model","authors":"Zeinab Shahmiri, Mostafa Tavakoli","doi":"10.1155/2024/3241718","DOIUrl":"https://doi.org/10.1155/2024/3241718","url":null,"abstract":"Let &lt;svg height=\"8.8423pt\" style=\"vertical-align:-0.2064009pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 9.02496 8.8423\" width=\"9.02496pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt; be a graph with &lt;svg height=\"6.1673pt\" style=\"vertical-align:-0.2063904pt\" version=\"1.1\" viewbox=\"-0.0498162 -5.96091 6.6501 6.1673\" width=\"6.6501pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt; vertices and &lt;span&gt;&lt;svg height=\"12.5794pt\" style=\"vertical-align:-3.29107pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 26.71 12.5794\" width=\"26.71pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,8.619,3.132)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,19.079,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"12.5794pt\" style=\"vertical-align:-3.29107pt\" version=\"1.1\" viewbox=\"30.2921838 -9.28833 20.53 12.5794\" width=\"20.53pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,30.342,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,34.853,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,47.908,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"12.5794pt\" style=\"vertical-align:-3.29107pt\" version=\"1.1\" viewbox=\"54.454183799999996 -9.28833 10.208 12.5794\" width=\"10.208pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,54.504,0)\"&gt;&lt;use xlink:href=\"#g113-89\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/span&gt; is an &lt;span&gt;&lt;svg height=\"9.49473pt\" style=\"vertical-align:-0.2063999pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 3.60972 9.49473\" width=\"3.60972pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-109\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;-&lt;/span&gt;clique of &lt;span&gt;&lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 13.5529 11.5564\" width=\"13.5529pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-72\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,8.892,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;.&lt;/span&gt; A vertex &lt;span&gt;&lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 16.359 11.5564\" width=\"16.359pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,9.495,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"19.9411838 -9.28833 27.354 11.5564\" width=\"27.354pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g tran","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"4 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140839540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unbounded Order Convergence in Ordered Vector Spaces 有序向量空间中的无界有序收敛
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-29 DOI: 10.1155/2024/9960246
Masoumeh Ebrahimzadeh, Kazem Haghnejad Azar
We consider an ordered vector space <span><svg height="8.68572pt" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 10.0819 8.68572" width="10.0819pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g></svg>.</span> We define the net <span><svg height="12.5794pt" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 33.301 12.5794" width="33.301pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,4.511,0)"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.713,3.132)"></path></g><g transform="matrix(.013,0,0,-0.013,17.527,0)"></path></g><g transform="matrix(.013,0,0,-0.013,25.67,0)"></path></g></svg><span></span><svg height="12.5794pt" style="vertical-align:-3.29107pt" version="1.1" viewbox="36.8831838 -9.28833 10.171 12.5794" width="10.171pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,36.933,0)"><use xlink:href="#g113-89"></use></g></svg></span> to be unbounded order convergent to <svg height="6.1673pt" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 7.39387 6.1673" width="7.39387pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-121"></use></g></svg> (denoted as <span><svg height="17.6182pt" style="vertical-align:-3.291101pt" version="1.1" viewbox="-0.0498162 -14.3271 45.956 17.6182" width="45.956pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-121"></use></g><g transform="matrix(.0091,0,0,-0.0091,7.202,3.132)"><use xlink:href="#g50-223"></use></g><g transform="matrix(.0091,0,0,-0.0091,21.021,-8.782)"></path></g><g transform="matrix(.0091,0,0,-0.0091,25.853,-8.782)"></path></g><g transform="matrix(.013,0,0,-0.013,16.648,0)"></path></g><g transform="matrix(.013,0,0,-0.013,22.424,0)"></path></g><g transform="matrix(.013,0,0,-0.013,38.535,0)"><use xlink:href="#g113-121"></use></g></svg>).</span> This means that for every <span><svg height="12.0653pt" style="vertical-align:-3.4294pt" version="1.1" viewbox="-0.0498162 -8.6359 17.503 12.0653" width="17.503pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,9.872,0)"></path></g></svg><span></span><svg height="12.0653pt" style="vertical-align:-3.4294pt" version="1.1" viewbox="21.085183800000003 -8.6359 18.025 12.0653" width="18.025pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,21.135,0)"></path></g><g transform="matrix(.013,0,0,-0.013,32.296,0)"></path></g></svg><span><
我们考虑一个有序向量空间 。我们将网定义为无界有序收敛于(表示为 )。这意味着,对于每一个 ,都存在一个网(可能在不同的索引集上),使得 ,并且对于每一个 ,都存在这样一个网,使得 。与网格向量空间相比,人们认识到更多有序向量空间,因此出现了更广泛的收敛性,这促使围绕网格的讨论不断扩展和拓宽,以涵盖更多空间。我们深入研究了这种收敛的特性,并探讨了它与其他既定有序收敛的关系。我们证明,在每个有序向量空间中,在某些条件下,每个-收敛网都意味着-考奇,反之亦然。设 是有向有序向量空间的阶密子空间。如果 是 ,那么我们证明 是 。
{"title":"Unbounded Order Convergence in Ordered Vector Spaces","authors":"Masoumeh Ebrahimzadeh, Kazem Haghnejad Azar","doi":"10.1155/2024/9960246","DOIUrl":"https://doi.org/10.1155/2024/9960246","url":null,"abstract":"We consider an ordered vector space &lt;span&gt;&lt;svg height=\"8.68572pt\" style=\"vertical-align:-0.0498209pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 10.0819 8.68572\" width=\"10.0819pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;.&lt;/span&gt; We define the net &lt;span&gt;&lt;svg height=\"12.5794pt\" style=\"vertical-align:-3.29107pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 33.301 12.5794\" width=\"33.301pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,4.511,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,11.713,3.132)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,17.527,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,25.67,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"12.5794pt\" style=\"vertical-align:-3.29107pt\" version=\"1.1\" viewbox=\"36.8831838 -9.28833 10.171 12.5794\" width=\"10.171pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,36.933,0)\"&gt;&lt;use xlink:href=\"#g113-89\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/span&gt; to be unbounded order convergent to &lt;svg height=\"6.1673pt\" style=\"vertical-align:-0.2063904pt\" version=\"1.1\" viewbox=\"-0.0498162 -5.96091 7.39387 6.1673\" width=\"7.39387pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-121\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt; (denoted as &lt;span&gt;&lt;svg height=\"17.6182pt\" style=\"vertical-align:-3.291101pt\" version=\"1.1\" viewbox=\"-0.0498162 -14.3271 45.956 17.6182\" width=\"45.956pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-121\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,7.202,3.132)\"&gt;&lt;use xlink:href=\"#g50-223\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,21.021,-8.782)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,25.853,-8.782)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,16.648,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,22.424,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,38.535,0)\"&gt;&lt;use xlink:href=\"#g113-121\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;).&lt;/span&gt; This means that for every &lt;span&gt;&lt;svg height=\"12.0653pt\" style=\"vertical-align:-3.4294pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 17.503 12.0653\" width=\"17.503pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,9.872,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"12.0653pt\" style=\"vertical-align:-3.4294pt\" version=\"1.1\" viewbox=\"21.085183800000003 -8.6359 18.025 12.0653\" width=\"18.025pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,21.135,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,32.296,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"11 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140810305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Weak (Gorenstein) Global Dimension of Coherent Rings with Finite Small Finitistic Projective Dimension 具有有限小有限投影维度的相干环的弱(戈伦斯坦)全局维度
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-17 DOI: 10.1155/2024/4896819
Khaled Alhazmy, Fuad Ali Ahmed Almahdi, Younes El Haddaoui, Najib Mahdou
The small finitistic dimension of a ring is determined as the supremum projective dimensions among modules with finite projective resolutions. This paper seeks to establish that, for a coherent ring with a finite weak (resp. Gorenstein) global dimension, the small finitistic dimension of is equal to its weak (resp. Gorenstein) global dimension. Consequently, we conclude some new characterizations for (Gorenstein) von Neumann and semihereditary rings.
环的有限小维度被确定为具有有限投影分辨率的模块之间的上投影维度。本文试图证明,对于具有有限弱全维(或戈伦斯坦全维)的相干环,其有限小维等于其弱全维(或戈伦斯坦全维)。因此,我们得出了(戈伦斯坦)冯-诺伊曼环和半遗传环的一些新特征。
{"title":"The Weak (Gorenstein) Global Dimension of Coherent Rings with Finite Small Finitistic Projective Dimension","authors":"Khaled Alhazmy, Fuad Ali Ahmed Almahdi, Younes El Haddaoui, Najib Mahdou","doi":"10.1155/2024/4896819","DOIUrl":"https://doi.org/10.1155/2024/4896819","url":null,"abstract":"The small finitistic dimension of a ring is determined as the supremum projective dimensions among modules with finite projective resolutions. This paper seeks to establish that, for a coherent ring <svg height=\"8.8423pt\" style=\"vertical-align:-0.2064009pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 8.28119 8.8423\" width=\"8.28119pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g></svg> with a finite weak (resp. Gorenstein) global dimension, the small finitistic dimension of <svg height=\"8.8423pt\" style=\"vertical-align:-0.2064009pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 8.28119 8.8423\" width=\"8.28119pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"><use xlink:href=\"#g113-83\"></use></g></svg> is equal to its weak (resp. Gorenstein) global dimension. Consequently, we conclude some new characterizations for (Gorenstein) von Neumann and semihereditary rings.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"39 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140613029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Similarity of : Operators and the Hyperinvariant Subspace Problem .算子的相似性算子与超不变子空间问题
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-17 DOI: 10.1155/2024/9943902
Abdelkader Segres, Ahmed Bachir, Sid Ahmed Ould Ahmed Mahmoud
In the present paper, we first show that the existence of the solutions of the operator equation <span><svg height="10.3089pt" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -10.1025 40.024 10.3089" width="40.024pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.136,-5.741)"></path></g><g transform="matrix(.013,0,0,-0.013,12.215,0)"></path></g><g transform="matrix(.013,0,0,-0.013,20.678,0)"></path></g><g transform="matrix(.013,0,0,-0.013,32.393,0)"></path></g></svg><span></span><svg height="10.3089pt" style="vertical-align:-0.2063999pt" version="1.1" viewbox="43.6061838 -10.1025 10.133 10.3089" width="10.133pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,43.656,0)"></path></g></svg></span> is related to the similarity of operators of class <span><svg height="11.927pt" style="vertical-align:-3.291101pt" version="1.1" viewbox="-0.0498162 -8.6359 15.8622 11.927" width="15.8622pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-68"></use></g><g transform="matrix(.0091,0,0,-0.0091,8.619,3.132)"><use xlink:href="#g50-50"></use></g><g transform="matrix(.0091,0,0,-0.0091,13.051,3.132)"></path></g></svg>,</span> and then we give a sufficient condition for the existence of nontrivial hyperinvariant subspaces. These subspaces are the closure of <svg height="12.7178pt" style="vertical-align:-3.42947pt" version="1.1" viewbox="-0.0498162 -9.28833 42.6255 12.7178" width="42.6255pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,4.823,0)"></path></g><g transform="matrix(.013,0,0,-0.013,10.413,0)"></path></g><g transform="matrix(.013,0,0,-0.013,17.59,0)"></path></g><g transform="matrix(.013,0,0,-0.013,25.157,0)"></path></g><g transform="matrix(.013,0,0,-0.013,29.655,0)"></path></g><g transform="matrix(.013,0,0,-0.013,37.94,0)"></path></g></svg> for some singular inner functions <span><svg height="9.39034pt" style="vertical-align:-3.42943pt" version="1.1" viewbox="-0.0498162 -5.96091 7.69399 9.39034" width="7.69399pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-253"></use></g></svg>.</span> As an application, we prove that every <span><svg height="11.927pt" style="vertical-align:-3.291101pt" version="1.1" viewbox="-0.0498162 -8.6359 18.1457 11.927" width="18.1457pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-68"></use></g><g transform="matrix(.0091,0,0,-0.0091,8.619,3.132)"><use xlink:href="#g50-50"></use></g><g transform="matrix(.0091,0
在本文中,我们首先证明了算子方程的解的存在性与类算子的相似性有关,然后给出了非无量超不变子空间存在的充分条件。这些子空间是一些奇异内函数的闭包。作为应用,我们证明在合适的条件下,每个-类正常算子和-中心算子都有非难超不变子空间。
{"title":"Similarity of : Operators and the Hyperinvariant Subspace Problem","authors":"Abdelkader Segres, Ahmed Bachir, Sid Ahmed Ould Ahmed Mahmoud","doi":"10.1155/2024/9943902","DOIUrl":"https://doi.org/10.1155/2024/9943902","url":null,"abstract":"In the present paper, we first show that the existence of the solutions of the operator equation &lt;span&gt;&lt;svg height=\"10.3089pt\" style=\"vertical-align:-0.2063999pt\" version=\"1.1\" viewbox=\"-0.0498162 -10.1025 40.024 10.3089\" width=\"40.024pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,6.136,-5.741)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,12.215,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,20.678,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,32.393,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"10.3089pt\" style=\"vertical-align:-0.2063999pt\" version=\"1.1\" viewbox=\"43.6061838 -10.1025 10.133 10.3089\" width=\"10.133pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,43.656,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/span&gt; is related to the similarity of operators of class &lt;span&gt;&lt;svg height=\"11.927pt\" style=\"vertical-align:-3.291101pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 15.8622 11.927\" width=\"15.8622pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-68\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,8.619,3.132)\"&gt;&lt;use xlink:href=\"#g50-50\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,13.051,3.132)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;,&lt;/span&gt; and then we give a sufficient condition for the existence of nontrivial hyperinvariant subspaces. These subspaces are the closure of &lt;svg height=\"12.7178pt\" style=\"vertical-align:-3.42947pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 42.6255 12.7178\" width=\"42.6255pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,4.823,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,10.413,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,17.59,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,25.157,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,29.655,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,37.94,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt; for some singular inner functions &lt;span&gt;&lt;svg height=\"9.39034pt\" style=\"vertical-align:-3.42943pt\" version=\"1.1\" viewbox=\"-0.0498162 -5.96091 7.69399 9.39034\" width=\"7.69399pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-253\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;.&lt;/span&gt; As an application, we prove that every &lt;span&gt;&lt;svg height=\"11.927pt\" style=\"vertical-align:-3.291101pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 18.1457 11.927\" width=\"18.1457pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-68\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,8.619,3.132)\"&gt;&lt;use xlink:href=\"#g50-50\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"17 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140613030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Leonardo Sequence via Pascal-Type Triangles 通过帕斯卡型三角形论莱昂纳多序列
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-16 DOI: 10.1155/2024/9352986
Serpil Halıcı, Sule Curuk
In this study, we discussed the Leonardo number sequence, which has been studied recently and caught more attention. We used Pascal and Hosoya-like triangles to make it easier to examine the basic properties of these numbers. With the help of the properties obtained in this study, we defined a number sequence containing the new type of Leonardo numbers created by choosing the coefficients from the bicomplex numbers. Furthermore, we gave the relationship of this newly defined sequence with the Fibonacci sequence. We also provided some important identities in the literature provided by the elements of this sequence described in this paper.
在本研究中,我们讨论了最近研究的莱昂纳多数列,它引起了更多的关注。我们使用了帕斯卡三角形和细叶三角形,以便于研究这些数的基本性质。借助本研究中获得的性质,我们定义了一个数列,其中包含通过从二复数中选择系数而创建的新型莱昂纳多数。此外,我们还给出了这个新定义数列与斐波那契数列的关系。我们还提供了本文所描述的这个数列的元素在文献中提供的一些重要标识。
{"title":"On the Leonardo Sequence via Pascal-Type Triangles","authors":"Serpil Halıcı, Sule Curuk","doi":"10.1155/2024/9352986","DOIUrl":"https://doi.org/10.1155/2024/9352986","url":null,"abstract":"In this study, we discussed the Leonardo number sequence, which has been studied recently and caught more attention. We used Pascal and Hosoya-like triangles to make it easier to examine the basic properties of these numbers. With the help of the properties obtained in this study, we defined a number sequence containing the new type of Leonardo numbers created by choosing the coefficients from the bicomplex numbers. Furthermore, we gave the relationship of this newly defined sequence with the Fibonacci sequence. We also provided some important identities in the literature provided by the elements of this sequence described in this paper.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"63 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140590587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Crude Oil Spot Price Forecasting Method Incorporating Quadratic Decomposition and Residual Forecasting 包含二次分解和残差预测的原油现货价格预测方法
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-15 DOI: 10.1155/2024/6652218
Yonghui Duan, Ziru Ming, Xiang Wang
The world economy is affected by fluctuations in the price of crude oil, making precise and effective forecasting of crude oil prices essential. In this study, we propose a combined forecasting scheme, which combines a quadratic decomposition and optimized support vector regression (SVR). In the decomposition part, the original crude oil price series are first decomposed using empirical modal decomposition (CEEMDAN), and then the residuals of the first decomposition (RES) are decomposed using variational modal decomposition (VMD). Additionally, this work proposes to optimize the support vector regression model (SVR) by the seagull optimization algorithm (SOA). Ultimately, the empirical investigation created the feature-variable system and predicted the filtered features. By computing evaluation indices like MAE, MSE, , and MAPE and validating using Brent and WTI crude oil spot, the prediction errors of the CEEMDAN -RES.-VMD -SOA-SVR combination prediction model presented in this paper are assessed and compared with those of the other twelve comparative models. The empirical evidence shows that the combination model being proposed in this paper outperforms the other related comparative models and improves the accuracy of the crude oil price forecasting model.
世界经济受到原油价格波动的影响,因此对原油价格进行精确有效的预测至关重要。在本研究中,我们提出了一种结合二次分解和优化支持向量回归(SVR)的组合预测方案。在分解部分,首先使用经验模态分解(CEEMDAN)对原始原油价格序列进行分解,然后使用变异模态分解(VMD)对第一次分解的残差(RES)进行分解。此外,本研究还提出通过海鸥优化算法(SOA)来优化支持向量回归模型(SVR)。最终,实证调查创建了特征变量系统,并预测了过滤后的特征。通过计算 MAE、MSE 和 MAPE 等评价指标,并使用布伦特和 WTI 原油现货进行验证,评估了本文提出的 CEEMDAN -RES.-VMD -SOA-SVR 组合预测模型的预测误差,并与其他 12 个比较模型的预测误差进行了比较。实证结果表明,本文提出的组合模型优于其他相关比较模型,提高了原油价格预测模型的准确性。
{"title":"A Crude Oil Spot Price Forecasting Method Incorporating Quadratic Decomposition and Residual Forecasting","authors":"Yonghui Duan, Ziru Ming, Xiang Wang","doi":"10.1155/2024/6652218","DOIUrl":"https://doi.org/10.1155/2024/6652218","url":null,"abstract":"The world economy is affected by fluctuations in the price of crude oil, making precise and effective forecasting of crude oil prices essential. In this study, we propose a combined forecasting scheme, which combines a quadratic decomposition and optimized support vector regression (SVR). In the decomposition part, the original crude oil price series are first decomposed using empirical modal decomposition (CEEMDAN), and then the residuals of the first decomposition (RES) are decomposed using variational modal decomposition (VMD). Additionally, this work proposes to optimize the support vector regression model (SVR) by the seagull optimization algorithm (SOA). Ultimately, the empirical investigation created the feature-variable system and predicted the filtered features. By computing evaluation indices like MAE, MSE, <span><svg height=\"11.7978pt\" style=\"vertical-align:-0.2063999pt\" version=\"1.1\" viewbox=\"-0.0498162 -11.5914 13.2276 11.7978\" width=\"13.2276pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,8.151,-5.741)\"></path></g></svg>,</span> and MAPE and validating using Brent and WTI crude oil spot, the prediction errors of the CEEMDAN -RES.-VMD -SOA-SVR combination prediction model presented in this paper are assessed and compared with those of the other twelve comparative models. The empirical evidence shows that the combination model being proposed in this paper outperforms the other related comparative models and improves the accuracy of the crude oil price forecasting model.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"70 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140574942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some New Identities Related to Dedekind Sums Modulo a Prime 与戴德金和模数素数有关的一些新特性
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-15 DOI: 10.1155/2024/8844153
Jiayuan Hu
The main purpose of this article is to use some identities of the classical Gauss sums, the properties of character sums, and Dedekind sums (modulo an odd prime) to study the computational problem of one-kind mean values related to Dedekind sums and give some interesting identities for them.
本文的主要目的是利用经典高斯求和的一些判据、特征和的性质以及戴德金和(模为奇素数)来研究与戴德金和有关的单种均值的计算问题,并给出它们的一些有趣的判据。
{"title":"Some New Identities Related to Dedekind Sums Modulo a Prime","authors":"Jiayuan Hu","doi":"10.1155/2024/8844153","DOIUrl":"https://doi.org/10.1155/2024/8844153","url":null,"abstract":"The main purpose of this article is to use some identities of the classical Gauss sums, the properties of character sums, and Dedekind sums (modulo an odd prime) to study the computational problem of one-kind mean values related to Dedekind sums and give some interesting identities for them.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"70 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140574951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Stability of Multi-Coefficients Pexider Additive Functional Inequalities in Banach Spaces 巴拿赫空间中多系数佩克赛德加法函数不等式的稳定性
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-12 DOI: 10.1155/2024/6931488
Yang Liu, Gang Lyu, Yuanfeng Jin, Jiangwei Yang
The Hyers–Ulam stability of multi-coefficients Pexider additive functional inequalities in Banach spaces is investigated. In order to do this, the fixed point method and the direct method are used.
研究了巴拿赫空间中多系数 Pexider 加性函数不等式的 Hyers-Ulam 稳定性。为此,采用了定点法和直接法。
{"title":"The Stability of Multi-Coefficients Pexider Additive Functional Inequalities in Banach Spaces","authors":"Yang Liu, Gang Lyu, Yuanfeng Jin, Jiangwei Yang","doi":"10.1155/2024/6931488","DOIUrl":"https://doi.org/10.1155/2024/6931488","url":null,"abstract":"The Hyers–Ulam stability of multi-coefficients Pexider additive functional inequalities in Banach spaces is investigated. In order to do this, the fixed point method and the direct method are used.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"26 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140602868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis of Prey-Predator Scheme in Conjunction with Help and Gestation Delay 结合帮助和妊娠延迟分析猎物-捕食者计划
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-04-10 DOI: 10.1155/2024/2708546
M. Mukherjee, D. Pal, S. K. Mahato, Ebenezer Bonyah, Ali Akbar Shaikh
This paper presents a three-dimensional continuous time dynamical system of three species, two of which are competing preys and one is a predator. We also assume that during predation, the members of both teams of preys help each other and the rate of predation of both teams is different. The interaction between prey and predator is assumed to be governed by a Holling type II functional response and discrete type gestation delay of the predator for consumption of the prey. In this work, we establish the local asymptotic stability of various equilibrium points to understand the dynamics of the model system. Different conditions for the coexistence of equilibrium solutions are discussed. Persistence, permanence of the system, and global stability of the positive interior equilibrium solution are discussed by constructing suitable Lyapunov functions when the gestation delay is zero, and there is no periodic orbit within the interior of the first quadrant of state space around the interior equilibrium. As we introduced time delay due to the gestation of the predator, we also discuss the stability of the delayed model. It is observed that the existence of stability switching occurs around the interior equilibrium point as the gestation delay increases through a certain critical threshold. Here, a phenomenon of Hopf bifurcation occurs, and a stable limit cycle corresponding to the periodic solution of the system is also observed. This study reveals that the delay is taken as a bifurcation parameter and also plays a significant role for the stability of the proposed model. Computer simulations of numerical examples are given to explain our proposed model. We have also addressed critically the biological implications of our analytical findings with proper numerical examples.
本文提出了一个由三个物种组成的三维连续时间动力系统,其中两个是相互竞争的猎物,一个是捕食者。我们还假设,在捕食过程中,两队猎物的成员互相帮助,两队猎物的捕食率不同。假设猎物和捕食者之间的相互作用受霍林二型功能反应和捕食者消耗猎物的离散型妊娠延迟的支配。在这项工作中,我们建立了各种平衡点的局部渐近稳定性,以理解模型系统的动力学。我们讨论了平衡解共存的不同条件。通过构建合适的 Lyapunov 函数,讨论了当妊娠延迟为零时,系统的持久性、永恒性以及正内部平衡解的全局稳定性,并且在内部平衡点周围的第一象限状态空间内部不存在周期性轨道。由于我们引入了捕食者妊娠导致的时间延迟,我们还讨论了延迟模型的稳定性。据观察,当妊娠延迟增加到某个临界阈值时,内部平衡点周围会出现稳定性切换。这里出现了霍普夫分岔现象,同时还观察到了与系统周期解相对应的稳定极限循环。这项研究揭示了将延迟作为分岔参数,对所提模型的稳定性也起着重要作用。为了解释我们提出的模型,我们给出了计算机模拟的数值示例。我们还通过适当的数值示例,批判性地探讨了我们的分析结果对生物学的影响。
{"title":"Analysis of Prey-Predator Scheme in Conjunction with Help and Gestation Delay","authors":"M. Mukherjee, D. Pal, S. K. Mahato, Ebenezer Bonyah, Ali Akbar Shaikh","doi":"10.1155/2024/2708546","DOIUrl":"https://doi.org/10.1155/2024/2708546","url":null,"abstract":"This paper presents a three-dimensional continuous time dynamical system of three species, two of which are competing preys and one is a predator. We also assume that during predation, the members of both teams of preys help each other and the rate of predation of both teams is different. The interaction between prey and predator is assumed to be governed by a Holling type II functional response and discrete type gestation delay of the predator for consumption of the prey. In this work, we establish the local asymptotic stability of various equilibrium points to understand the dynamics of the model system. Different conditions for the coexistence of equilibrium solutions are discussed. Persistence, permanence of the system, and global stability of the positive interior equilibrium solution are discussed by constructing suitable Lyapunov functions when the gestation delay is zero, and there is no periodic orbit within the interior of the first quadrant of state space around the interior equilibrium. As we introduced time delay due to the gestation of the predator, we also discuss the stability of the delayed model. It is observed that the existence of stability switching occurs around the interior equilibrium point as the gestation delay increases through a certain critical threshold. Here, a phenomenon of Hopf bifurcation occurs, and a stable limit cycle corresponding to the periodic solution of the system is also observed. This study reveals that the delay is taken as a bifurcation parameter and also plays a significant role for the stability of the proposed model. Computer simulations of numerical examples are given to explain our proposed model. We have also addressed critically the biological implications of our analytical findings with proper numerical examples.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"69 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140574877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Mathematics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1