Serial Exchanges in Random Bases
Combinatorics
2023-05-03 v1
Abstract
It was conjectured by Kotlar and Ziv that for any two bases and in a matroid and any subset , there is a subset and orderings and of and , respectively, such that for , and are bases; that is, is serially exchangeable with . Let be a rank- matroid which is representable over We show that for if bases and are chosen randomly amongst all bases of , and if a subset of size is chosen randomly in , then with probability tending to one as , there exists a subset such that is serially exchangeable with
Cite
@article{arxiv.2305.01085,
title = {Serial Exchanges in Random Bases},
author = {Sean McGuinness},
journal= {arXiv preprint arXiv:2305.01085},
year = {2023}
}