Sticky matroids and convolution
Abstract
Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a matroid has a non-principal modular cut then it is not sticky. A similar statement for matroids has been proved in [8] using different technique.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2019
- DOI:
- arXiv:
- arXiv:1909.02353
- Bibcode:
- 2019arXiv190902353C
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Information Theory;
- 03G10;
- 05B35;
- 06C10