Characteristic min-polynomial of a triangular and diagonal strictly double R-astic matrices

Q2 Pharmacology, Toxicology and Pharmaceutics
Siswanto Siswanto, Sahmura Maula Al Maghribi
{"title":"Characteristic min-polynomial of a triangular and diagonal strictly double R-astic matrices","authors":"Siswanto Siswanto, Sahmura Maula Al Maghribi","doi":"10.12688/f1000research.147931.1","DOIUrl":null,"url":null,"abstract":"Background Determinant and characteristic polynomials are important concepts related to square matrices. Due to the absence of additive inverse in max-plus algebra, the determinant of a matrix over max-plus algebra can be represented by a permanent. In addition, there are several types of square matrices over max-plus algebra, including triangular and diagonal strictly double ℝ -astic matrices. A special formula has been devised to determine the permanent and characteristic max-polynomial of those matrices. Another algebraic structure that is isomorphic with max-plus algebra is min-plus algebra. Methods Min-plus algebra is the algebraic structure of triple ( ℝ ε ′ , ⊕ ′ , ⊗ ) . Furthermore, square matrices over min plus algebra are defined by the set of matrices sized n × n , the entries of which are the elements of ℝ ε ′ . Because these two algebraic structures are isomorphic, the permanent and characteristic min-polynomial can also be determined for each square matrix over min-plus algebra, as well as the types of matrices. Results In this paper, we find out the special formulas for determining the permanent and characteristic min-polynomial of the triangular matrix and the diagonal strictly double ℝ -astic matrix. Conclusions We show that the formula for determining the characteristic min-polynomial of the two matrices is the same, for each triangular matrix and strictly double ℝ -astic matrix A , χ A ( x ) = ⨁ r = 0 , 1 , … , n ′ δ n − r ⊗ n r .","PeriodicalId":12260,"journal":{"name":"F1000Research","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"F1000Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12688/f1000research.147931.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Pharmacology, Toxicology and Pharmaceutics","Score":null,"Total":0}
引用次数: 0

Abstract

Background Determinant and characteristic polynomials are important concepts related to square matrices. Due to the absence of additive inverse in max-plus algebra, the determinant of a matrix over max-plus algebra can be represented by a permanent. In addition, there are several types of square matrices over max-plus algebra, including triangular and diagonal strictly double ℝ -astic matrices. A special formula has been devised to determine the permanent and characteristic max-polynomial of those matrices. Another algebraic structure that is isomorphic with max-plus algebra is min-plus algebra. Methods Min-plus algebra is the algebraic structure of triple ( ℝ ε ′ , ⊕ ′ , ⊗ ) . Furthermore, square matrices over min plus algebra are defined by the set of matrices sized n × n , the entries of which are the elements of ℝ ε ′ . Because these two algebraic structures are isomorphic, the permanent and characteristic min-polynomial can also be determined for each square matrix over min-plus algebra, as well as the types of matrices. Results In this paper, we find out the special formulas for determining the permanent and characteristic min-polynomial of the triangular matrix and the diagonal strictly double ℝ -astic matrix. Conclusions We show that the formula for determining the characteristic min-polynomial of the two matrices is the same, for each triangular matrix and strictly double ℝ -astic matrix A , χ A ( x ) = ⨁ r = 0 , 1 , … , n ′ δ n − r ⊗ n r .
三角形和对角线严格双 R 弹性矩阵的特征最小多项式
背景行列式和特征多项式是与方阵有关的重要概念。由于 max-plus 代数中没有加法逆,因此 max-plus 代数中矩阵的行列式可以用常数表示。此外,max-plus 代数中有几种类型的方阵,包括三角形矩阵和对角线严格双ℝ-弹性矩阵。已设计出一种特殊公式来确定这些矩阵的永久性和特征最大极值。另一种与 max-plus 代数同构的代数结构是 min-plus 代数。方法 最小加代数是三重 ( ℝ ε ′ , ⊕ ′ , ⊗ ) 的代数结构。此外,闽加代数上的平方矩阵是由大小为 n × n 的矩阵集合定义的,这些矩阵的条目是 ℝ ε ′ 的元素。由于这两种代数结构是同构的,因此也可以确定最小加代数上每个方阵的永久最小二项式和特征最小二项式,以及矩阵的类型。结果 本文找出了确定三角形矩阵和对角严格双ℝ弹性矩阵的永久最小多项式和特征最小多项式的特殊公式。结论 我们证明,对于每个三角形矩阵和严格双ℝ -弹性矩阵 A , χ A ( x ) = ⨁ r = 0 , 1 , ... , n ′ δ n - r ⊗ n r,确定这两个矩阵的特征最小多项式的公式是相同的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
F1000Research
F1000Research Pharmacology, Toxicology and Pharmaceutics-Pharmacology, Toxicology and Pharmaceutics (all)
CiteScore
5.00
自引率
0.00%
发文量
1646
审稿时长
1 weeks
期刊介绍: F1000Research publishes articles and other research outputs reporting basic scientific, scholarly, translational and clinical research across the physical and life sciences, engineering, medicine, social sciences and humanities. F1000Research is a scholarly publication platform set up for the scientific, scholarly and medical research community; each article has at least one author who is a qualified researcher, scholar or clinician actively working in their speciality and who has made a key contribution to the article. Articles must be original (not duplications). All research is suitable irrespective of the perceived level of interest or novelty; we welcome confirmatory and negative results, as well as null studies. F1000Research publishes different type of research, including clinical trials, systematic reviews, software tools, method articles, and many others. Reviews and Opinion articles providing a balanced and comprehensive overview of the latest discoveries in a particular field, or presenting a personal perspective on recent developments, are also welcome. See the full list of article types we accept for more information.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信