Sticky matroids and convolution
Combinatorics
2019-10-03 v3 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.1909.02353,
title = {Sticky matroids and convolution},
author = {Laszlo Csirmaz},
journal= {arXiv preprint arXiv:1909.02353},
year = {2019}
}