跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.23624 · v1

Matroid Connectedness and Component Decomposition: Breaking the Quadratic Barrier

首次提交 2026-11-18 07:37
版本更新 2026-11-18 07:37
雷达观测 2026-11-19 19:08
arXiv ↗PDF ↗

摘要

Deciding whether a matroid is connected and computing its connected components are two fundamental algorithmic problems in matroid theory. Since the 1970s, the best known algorithms for both problems have used O(n2)O(n^2) independence queries on an nn-element ground set. Our main contribution is to break this quadratic barrier: we give a deterministic algorithm that computes all connected components of a matroid on nn elements with O(nlog⁡n)O(n \log{n}) independence queries. Our algorithm for component decomposition combines fundamental basis exchanges with a disjoint-set union data structure, avoiding the explicit construction of the fundamental graph. Moreover, we show that our algorithm is asymptotically optimal by giving a lower bound based on a simple information-theoretic argument: any (deterministic or bounded-error randomized) algorithm to compute connected components needs Ω(nlog⁡n)Ω(n \log{n}) independence queries. Then, we turn to the query complexity of deciding whether a matroid is connected. For this problem, we present an algorithm that uses O(nh)O(nh) independence queries, where h≥1h \ge 1 bounds the size of any chain of nonempty proper cyclic flats. The algorithm achieves asymptotically optimal linear query complexity on elementary split matroids, that include all paving matroids, and on arbitrary direct sums of uniform matroids.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 07:37 · 最新观测版本

Matroid Connectedness and Component Decomposition: Breaking the Quadratic Barrier

Deciding whether a matroid is connected and computing its connected components are two fundamental algorithmic problems in matroid theory. Since the 1970s, the best known algorithms for both problems have used O(n2)O(n^2) independence queries on an nn-element ground set. Our main contribution is to break this quadratic barrier: we give a deterministic algorithm that computes all connected components of a matroid on nn elements with O(nlog⁡n)O(n \log{n}) independence queries. Our algorithm for component decomposition combines fundamental basis exchanges with a disjoint-set union data structure, avoiding the explicit construction of the fundamental graph. Moreover, we show that our algorithm is asymptotically optimal by giving a lower bound based on a simple information-theoretic argument: any (deterministic or bounded-error randomized) algorithm to compute connected components needs Ω(nlog⁡n)Ω(n \log{n}) independence queries. Then, we turn to the query complexity of deciding whether a matroid is connected. For this problem, we present an algorithm that uses O(nh)O(nh) independence queries, where h≥1h \ge 1 bounds the size of any chain of nonempty proper cyclic flats. The algorithm achieves asymptotically optimal linear query complexity on elementary split matroids, that include all paving matroids, and on arbitrary direct sums of uniform matroids.

查看此版本解读 →查看此版本原文 ↗