English

Towards the Proximity Conjecture on Group-Labeled Matroids

Combinatorics 2024-11-12 v1

Abstract

Consider a matroid MM whose ground set is equipped with a labeling to an abelian group. A basis of MM is called FF-avoiding if the sum of the labels of its elements is not in a forbidden label set FF. H\"orsch, Imolay, Mizutani, Oki, and Schwarcz (2024) conjectured that if an FF-avoiding basis exists, then any basis can be transformed into an FF-avoiding basis by exchanging at most F|F| elements. This proximity conjecture is known to hold for certain specific groups; in the case where F2|F| \le 2; or when the matroid is subsequence-interchangeably base orderable (SIBO), which is a weakening of the so-called strongly base orderable (SBO) property. In this paper, we settle the proximity conjecture for sparse paving matroids or in the case where F4|F| \le 4. Related to the latter result, we present the first known example of a non-SIBO matroid. We further address the setting of multiple group-label constraints, showing proximity results for the cases of two labelings, SIBO matroids, matroids representable over a fixed, finite field, and sparse paving matroids.

Keywords

Cite

@article{arxiv.2411.06771,
  title  = {Towards the Proximity Conjecture on Group-Labeled Matroids},
  author = {Dániel Garamvölgyi and Ryuhei Mizutani and Taihei Oki and Tamás Schwarcz and Yutaro Yamaguchi},
  journal= {arXiv preprint arXiv:2411.06771},
  year   = {2024}
}
R2 v1 2026-06-28T19:55:13.904Z