arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0310028math.OC
收藏

半环中矩阵乘积的可达性问题

Reachability problems for products of matrices in semirings

Stephane Gaubert, Ricardo Katz

摘要:

考虑如下矩阵可达性问题:给定元素在半环中的$r$方阵,是否存在这些矩阵的乘积可达给定的矩阵?我们以类似的方式定义向量(分别为)。标量)可达性问题,通过要求通过右乘作用于规定的行向量的矩阵乘积给出另一个规定的行向量(相应地,当在左和右乘以规定的行和列向量时,给出规定的标量)。我们表明,在任何半环,标量可达性减少到向量可达性,这是等价于矩阵可达性,并为任何这些问题,专业化的任何$r\geq 2$是等价于专业化的$r=2$。作为这个结果和Krob定理的应用,我们证明了当$r=2$时,极大加半环$(Z\cup\{-\infty\},\max,+)$上的向量和矩阵可达性问题是不可判定的.我们还表明,矩阵,向量和标量的可达性问题是可判定的半环的元素是“积极的”,像热带半环$(N\cup\{+\infty\},\min,+)$。

英文摘要:

We consider the following matrix reachability problem: given $r$ square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multiplied at left and right by prescribed row and column vectors, gives a prescribed scalar). We show that over any semiring, scalar reachability reduces to vector reachability which is equivalent to matrix reachability, and that for any of these problems, the specialization to any $r\geq 2$ is equivalent to the specialization to $r=2$. As an application of this result and of a theorem of Krob, we show that when $r=2$, the vector and matrix reachability problems are undecidable over the max-plus semiring $(Z\cup\{-\infty\},\max,+)$. We also show that the matrix, vector, and scalar reachability problems are decidable over semirings whose elements are ``positive'', like the tropical semiring $(N\cup\{+\infty\},\min,+)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑