Weighted exchange distance of basis pairs
Krist\'of B\'erczi, Bence M\'atrav\"olgyi, Tam\'as Schwarcz

TL;DR
This paper introduces a weighted exchange distance concept for basis pairs in matroids, proving a conjecture for specific matroid classes and extending understanding of basis exchange sequences.
Contribution
It proposes a weighted variant of Hamidoune's conjecture and proves it for several classes of matroids, advancing the theory of basis exchanges.
Findings
Proved the weighted exchange conjecture for strongly base orderable matroids
Extended the conjecture to split and graphic matroids of wheels
Demonstrated the conjecture holds for spikes
Abstract
Two pairs of disjoint bases and of a matroid are called equivalent if can be transformed into by a series of symmetric exchanges. In 1980, White conjectured that such a sequence always exists whenever . A strengthening of the conjecture was proposed by Hamidoune, stating that minimum length of an exchange is at most the rank of the matroid. We propose a weighted variant of Hamidoune's conjecture, where the weight of an exchange depends on the weights of the exchanged elements. We prove the conjecture for several matroid classes: strongly base orderable matroids, split matroids, graphic matroids of wheels, and spikes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Computational Geometry and Mesh Generation
