The cyclic flats of $\mathcal{L}$-polymatroids
Eimear Byrne, Andrew Fulcher
TL;DR
The paper generalizes cyclic-flat theory to $\\mathcal{L}$-polymatroids on finite complemented modular lattices, introducing cover-weight axioms and establishing cryptomorphisms with rank functions. It defines cyclic flats and shows that the rank on the ambient lattice is recoverable from the weighted lattice of cyclic flats together with atom weights, via $r(X)=\\min\\{ r(Z)+\\mu_r(Z^c\\wedge X): Z\\in\\mathcal{Z}, Z^c\\in \\mathbf{C}(Z;X)\\}$. The core contribution is a six-axiom characterization that precisely describes when a weighted lattice $(\\mathcal{Z},\\lambda)$ embeds as the cyclic-flat lattice of some $\\mathcal{L}$-polymatroid, thereby extending cryptomorphisms known for matroids and $q$-matroids to this broader setting. This framework enables compact representations and structural analysis of polymatroids on complex lattice types and connects lattice-theoretic properties with rank-convolution constructions. The results have potential implications for generalized matroid-like structures in combinatorics and coding theory where the ambient lattice is a product of Boolean and projective-geometric components.
Abstract
We consider structural properties of $\mathcal{L}$-polymatroids, especially those defined on a finite complemented modular lattice $\mathcal{L}$. We introduce a set of cover-weight axioms and establish a cryptomorphism between these axioms and the rank axioms of an $\mathcal{L}$-polymatroid. We introduce the notion of a cyclic flat of an $\mathcal{L}$-polymatroid and study properties of its lattice of cyclic flats. We show that the weighted lattice of cyclic flats of an $\mathcal{L}$-polymatroid $\mathcal{P}$, along with the atomic weights of $\mathcal{P}$, is sufficient to define its rank function on $\mathcal{L}$. In our main result, we characterize those weighted lattices $(\mathcal{Z},λ)$ such that $\mathcal{Z}\subseteq\mathcal{L}$ is the collection of cyclic flats of an $\mathcal{L}$-polymatroid.
