Linear Algebra and its Applications ( IF 1.0 ) Pub Date : 2021-09-10 , DOI: 10.1016/j.laa.2021.09.005 Daniel Simson 1 , Katarzyna Zając 1
One of the main aims of the paper is to develop the mesh geometry technique for corank-two edge-bipartite graphs Δ with vertices, and the mesh algorithms introduced in [30], [33] and successfully studied in our recent article [42]. We introduce and study the concept of a self-duality of mesh geometries viewed as -mesh translation quivers. We show how self-dualities of mesh geometries and the mesh geometry technique is applied to an affirmative algorithmic solution of so called Horn-Sergeichuk type problem [9, Problem 4.3] on the self-congruency of square integer matrices , for the class of non-symmetric Gram matrices of corank-two loop-free edge-bipartite graphs Δ, with vertices. More precisely, we show that each of the mesh geometries is self-dual, we construct its dual form isomorphic with , and we construct a canonical self-duality isomorphism of mesh translation quivers. Using the self-duality we construct combinatorial algorithms such that, given a square Gram matrix of Δ lying in this class, they are able to compute a -invertible matrix that coincide with its inverse and defines the congruence of A with , i.e., the equation is satisfied.
An idea of our solution is outlined in Section 8 of our recent article [42], where among others two of our 13 algorithms solving the problem are constructed. The remaining 11 algorithms are constructed in the present article. We do it by means of the structure of the standard self-dual -mesh translation quiver (called a geometry) canonically associated with Δ, consisting of -meshes of -orbits of vectors , where is the Coxeter transformation of Δ. We construct in the paper such self-dual -mesh geometry , for each of the corank-two loop-free edge-bipartite graphs Δ, with vertices.
中文翻译:
根 Coxeter 轨道的网格算法和自双网格几何在 Horn-Sergeichuk 类型问题中的应用
该论文的主要目标之一是开发用于 corank-two 边二部图 Δ 的网格几何技术,其中 顶点,以及在 [30]、[33] 中介绍并在我们最近的文章 [42] 中成功研究的网格算法。我们介绍并研究了网格几何的自对偶性概念 被视为 -mesh 翻译颤抖。我们展示了网格几何的自对偶性 并且将网格几何技术应用于所谓的 Horn-Sergeichuk 类型问题 [9, 问题 4.3] 的关于平方整数矩阵自相关性的肯定算法解决方案 , 对于非对称 Gram 矩阵类 corank-2 无环边二部图 Δ,与 顶点。更准确地说,我们展示了每个网格几何形状 是自对偶的,我们构造它的对偶形式 同构 ,我们构造了一个规范的自对偶同构 网格平移颤动。使用自我二元性 我们构造组合算法,使得,给定一个平方 Gram 矩阵 Δ 在这个类中,他们能够计算出 -可逆矩阵 与它的逆重合 并限定的一致性阿与, 即方程 很满意。
我们最近的文章 [42] 的第 8 节概述了我们的解决方案的一个想法,其中构建了我们解决问题的 13 种算法中的两种。其余 11 种算法在本文中构建。我们通过标准自对偶的结构来做-网状翻译箭袋 (称为几何)规范地与 Δ 相关联,包括 - 网格 -轨道 向量 , 在哪里 是 Δ 的 Coxeter 变换。我们在论文中构造了这样的自对偶-网格几何 ,对于每一个 corank-two 无环边二部图 Δ,有 顶点。