Serial Exchanges in Random Bases

Abstract

It was conjectured by Kotlar and Ziv that for any two bases B1 and B2 in a matroid M and any subset X ⊂ B1, there is a subset Y and orderings x1 x2 ·s xk and y1 y2 ·s yk of X and Y, respectively, such that for i = 1, … ,k, B1 - \ x1, … ,xi\ + \y1, … ,yk \ and B2 - \ y1, … ,yi\ + \x1, … ,xk \ are bases; that is, X is serially exchangeable with Y. Let M be a rank-n matroid which is representable over Fq. We show that for q>2, if bases B1 and B2 are chosen randomly amongst all bases of M, and if a subset X of size k (n) is chosen randomly in B1, then with probability tending to one as n → ∞, there exists a subset Y⊂ B2 such that X is serially exchangeable with Y.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…