Free products, principal sums, bipartition complete matroids and the linking operation
arXiv:2610.14111
Abstract
In this paper we examine the special class of bipartition complete matroids, which includes free products and principal sums of matroids (Crapo and Schmitt, 2005; Bonin and Kung, 2015). A matroid on is said to be --complete iff whenever and are bases of we also have as a base of We use the linking operation (Theja and Narayanan, 2014) for this study. We construct the --augmentation of an arbitrary matroid and show that this augmentation is again a matroid, that the dual of the augmentation is the augmentation of the dual matroid and that the --augmentation of an --complete matroid leaves it unchanged. We also show that bipartition completeness is stable under minors in the appropriate bipartitioned sense. Finally, we show that free products and principal sums of matroids are --complete and give explicit minimal decompositions for them.