Sticky matroids and convolution

09/05/2019

∙

by   Laszlo Csirmaz, et al.

∙

0

∙

share

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. The proof of a similar statement in [8] has flaws, thus our construction rescues their main result.