Connectivity gaps among matroids with the same enumerative invariants
Combinatorics
2024-08-07 v1
Abstract
Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the -invariant and the configuration of the matroid. We show that the same is not true of the most basic connectivity invariants. Specifically, we show that for any positive integer , there are pairs of matroids that have the same configuration (and so the same -invariant and the same Tutte polynomial) but the difference between their Tutte connectivities exceeds , and likewise for vertical connectivity and branch-width. The examples that we use to show this, which we construct using an operation that we introduce, are transversal matroids that are also positroids.
Cite
@article{arxiv.2308.02302,
title = {Connectivity gaps among matroids with the same enumerative invariants},
author = {Joseph E. Bonin and Kevin Long},
journal= {arXiv preprint arXiv:2308.02302},
year = {2024}
}