一般分块多项式矩阵最大次子式整列的组合算法
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with $2 \times 2$ submatrices
摘要:
本文考虑块结构符号矩阵(一般分块多项式矩阵)$A = (A_{αβ} x_{αβ} t^{d_{αβ}})$的最大次子式的整列计算问题,其中$A_{αβ}$是域$\mathbf{F}$上的$2 \times 2$矩阵,$x_{αβ}$是不定式,$d_{αβ}$是$α= 1,2,\dots, μ$和$β= 1,2,\dots,ν$的整数,$t$是附加不定式.这个问题可以看作是最大权二部匹配问题的代数推广。本文的主要结果是一个组合的$O(μν\min\{μ, ν\}^2)$时间算法计算整个序列的最大程度的未成年人的$(2 \times 2)$型一般分块多项式矩阵的大小$2μ\times 2ν$。我们还提出了一个极大极小定理,它可以被用来作为一个很好的表征(NP $\cap$ co-NP表征)的顺序$k$的未成年人的最大程度的计算。我们的结果推广了经典的原始-对偶算法(匈牙利方法)和极大极小公式(Egerváry定理)的最大重量二部匹配问题。
英文摘要:
In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matrix) $A = (A_{αβ} x_{αβ} t^{d_{αβ}})$, where $A_{αβ}$ is a $2 \times 2$ matrix over a field $\mathbf{F}$, $x_{αβ}$ is an indeterminate, and $d_{αβ}$ is an integer for $α= 1,2,\dots, μ$ and $β= 1,2,\dots,ν$, and $t$ is an additional indeterminate. This problem can be viewed as an algebraic generalization of the maximum weight bipartite matching problem. The main result of this paper is a combinatorial $O(μν\min\{μ, ν\}^2)$-time algorithm for computing the entire sequence of the maximum degree of minors of a $(2 \times 2)$-type generic partitioned polynomial matrix of size $2μ\times 2ν$. We also present a minimax theorem, which can be used as a good characterization (NP $\cap$ co-NP characterization) for the computation of the maximum degree of minors of order $k$. Our results generalize the classical primal-dual algorithm (the Hungarian method) and minimax formula (Egerváry's theorem) for the maximum weight bipartite matching problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。