2000 character limit reached
Sticky matroids and convolution (1909.02353v3)
Published 5 Sep 2019 in math.CO, cs.IT, and 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.