关于互补 GJ 涉及变换 skew-对称矩阵的配对
最优化与控制
2025-05-21 v2
摘要
本文描述了将 skew-对称矩阵变换为互补 Gauss-Jordan pivotings 中出现的某些比例。我们对这些比例的关注是受到动机驱动的，旨在证明最近提出的用于解决一般线性规划问题的强多项式时间算法中的一个 crucial Claim。该 Claim 在本文中得到证明，据此建议了一个紧凑的强多项式时间算法实现。
引用
@article{arxiv.2410.19350,
title = {On pairs of complementary GJ pivoting transforming skew-symmetric matrices},
author = {Samuel Awoniyi},
journal= {arXiv preprint arXiv:2410.19350},
year = {2025}
}
备注
12 pages. This is a revised version of the article wherein the main lemma's proof is a proof by induction, instead of the direct proof that was used in the previous version of the article. This proof by induction is regarded by several reviewers as being clearer than the direct proof that it replaces