arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.01779math.COcs.DM
收藏

分裂拟阵中基对的交换距离

Exchange distance of basis pairs in split matroids

Kristóf Bérczi, Tamás Schwarcz

摘要:

基交换公理一直是拟阵理论发展的推动力。然而,该公理只给出了一个局部表征的关系的基地,这是一个主要的绊脚石,进一步的进展,并提供一个全球性的理解的结构拟阵基地是一个基本目标,在拟阵优化。在研究对称交换的结构时,Gabow提出了任何一对基都存在一个对称交换序列的问题。交换公理的另一种扩展是由怀特提出的,他研究了相容基序列的等价性。这些图表明拟阵的基族具有比我们所知道的更强的结构性质。本文利用对称交换研究拟阵基对的距离。特别是,我们给出了一个多项式时间算法,确定一个最短的可能的交换序列,将一个基对到另一个分裂拟阵,一类是出于研究拟阵多面体从热带几何的角度来看。作为一个推论,我们验证了这个大类的上述长期存在的假设。作为分裂拟阵的一个子类,我们的结果也解决了铺路拟阵的问题。

英文摘要:

The basis exchange axiom has been a driving force in the development of matroid theory. However, the axiom gives only a local characterization of the relation of bases, which is a major stumbling block to further progress, and providing a global understanding of the structure of matroid bases is a fundamental goal in matroid optimization. While studying the structure of symmetric exchanges, Gabow proposed the problem that any pair of bases admits a sequence of symmetric exchanges. A different extension of the exchange axiom was proposed by White, who investigated the equivalence of compatible basis sequences. These conjectures suggest that the family of bases of a matroid possesses much stronger structural properties than we are aware of. In the present paper, we study the distance of basis pairs of a matroid in terms of symmetric exchanges. In particular, we give a polynomial-time algorithm that determines a shortest possible exchange sequence that transforms a basis pair into another for split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. As a corollary, we verify the above mentioned long-standing conjectures for this large class. Being a subclass of split matroids, our result settles the conjectures for paving matroids as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑