Sticky matroids and convolution
From MaRDI portal
Publication:6324733
arXiv1909.02353MaRDI QIDQ6324733FDOQ6324733
Authors: László Csirmaz 
Publication date: 5 September 2019
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.
Combinatorial aspects of matroids and geometric lattices (05B35) Logical aspects of lattices and related structures (03G10) Semimodular lattices, geometric lattices (06C10)
This page was built for publication: Sticky matroids and convolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324733)
