On pairs of complementary GJ pivoting transforming skew-symmetric matrices

2024/10/25 by Samuel Awoniyi, Awoniyi, Samuel
Agricultural and Biological Sciences · Engineering · #Advanced Scientific Research Methods #FOS: Mathematics #Math OC #Optimization and Control (math.OC) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2410.19350

openalex publication_date 2024/10/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This article describes certain ratios that attend pairs of complementary Gauss-Jordan pivotings transforming skew-symmetric matrices. Our interest in those ratios was motivated by a need to prove a crucial Claim stated in a recently proposed strongly polynomial-time algorithm for the general LP problem. That Claim is proved in this article and, as a consequence of this proof, a compact implementation of the strongly polynomial-time algorithm is suggested.

Related

• A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem
• Generalized Principal Pivot Transform and its Inheritance Properties
• A transformation that preserves principal minors of skew-symmetric matrices
• Matrix Factorizations with Uniformly Random Pivoting
• Matrix monotonicity and concavity of the principal pivot transform