当前位置: X-MOL 学术Linear Algebra its Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem
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
Affiliation  

One of the main aims of the paper is to develop the mesh geometry technique for corank-two edge-bipartite graphs Δ with n+23 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 Γ(RˆΔ,ΦΔ) viewed as ΦΔ-mesh translation quivers. We show how self-dualities of mesh geometries Γ(RˆΔ,ΦΔ) 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 AMn+2(Z), for the class of non-symmetric Gram matrices A=GˇΔ of corank-two loop-free edge-bipartite graphs Δ, with n+26 vertices. More precisely, we show that each of the mesh geometries Γ(RˆΔ,ΦΔ) is self-dual, we construct its dual form Γ(RˆΔ,ΦΔ)op=Γ(RˆΔ,ΦΔ1) isomorphic with Γ(RˆΔ,ΦΔ), and we construct a canonical self-duality isomorphism fΔ:Γ(RˆΔ,ΦΔ)Γ(RˆΔ,ΦΔ)op of mesh translation quivers. Using the self-duality fΔ we construct combinatorial algorithms such that, given a square Gram matrix A=GˇΔMn+2(Z) of Δ lying in this class, they are able to compute a Z-invertible matrix BMn+2(Z) that coincide with its inverse B1 and defines the congruence of A with Atr, i.e., the equation Atr=BtrAB 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 Γ(RˆΔ,ΦΔ) (called a geometry) canonically associated with Δ, consisting of ΦΔ-meshes of ΦΔ-orbits OΔ(w) of vectors wRˆΔZn+2, where ΦΔ:Zn+2Zn+2 is the Coxeter transformation of Δ. We construct in the paper such self-dual ΦΔ-mesh geometry Γ(RˆΔ,ΦΔ), for each of the corank-two loop-free edge-bipartite graphs Δ, with n+26 vertices.



中文翻译:

根 Coxeter 轨道的网格算法和自双网格几何在 Horn-Sergeichuk 类型问题中的应用

该论文的主要目标之一是开发用于 corank-two 边二部图 Δ 的网格几何技术,其中 n+23顶点,以及在 [30]、[33] 中介绍并在我们最近的文章 [42] 中成功研究的网格算法。我们介绍并研究了网格几何的自对偶性概念Γ(电阻^Δ,ΦΔ) 被视为 ΦΔ-mesh 翻译颤抖。我们展示了网格几何的自对偶性Γ(电阻^Δ,ΦΔ) 并且将网格几何技术应用于所谓的 Horn-Sergeichuk 类型问题 [9, 问题 4.3] 的关于平方整数矩阵自相关性的肯定算法解决方案 一种n+2(Z), 对于非对称 Gram 矩阵类 一种=GˇΔ corank-2 无环边二部图 Δ,与 n+26顶点。更准确地说,我们展示了每个网格几何形状Γ(电阻^Δ,ΦΔ) 是自对偶的,我们构造它的对偶形式 Γ(电阻^Δ,ΦΔ)=Γ(电阻^Δ,ΦΔ-1) 同构 Γ(电阻^Δ,ΦΔ),我们构造了一个规范的自对偶同构 FΔΓ(电阻^Δ,ΦΔ)Γ(电阻^Δ,ΦΔ)网格平移颤动。使用自我二元性FΔ 我们构造组合算法,使得,给定一个平方 Gram 矩阵 一种=GˇΔn+2(Z) Δ 在这个类中,他们能够计算出 Z-可逆矩阵 n+2(Z) 与它的逆重合 -1并限定的一致性一种r, 即方程 一种r=r一种 很满意。

我们最近的文章 [42] 的第 8 节概述了我们的解决方案的一个想法,其中构建了我们解决问题的 13 种算法中的两种。其余 11 种算法在本文中构建。我们通过标准自对偶的结构来做ΦΔ-网状翻译箭袋 Γ(电阻^Δ,ΦΔ) (称为几何)规范地与 Δ 相关联,包括 ΦΔ- 网格 ΦΔ-轨道 Δ() 向量 电阻^ΔZn+2, 在哪里 ΦΔZn+2Zn+2是 Δ 的 Coxeter 变换。我们在论文中构造了这样的自对偶ΦΔ-网格几何 Γ(电阻^Δ,ΦΔ),对于每一个 corank-two 无环边二部图 Δ,有 n+26 顶点。

更新日期:2021-09-30
down
wechat
bug