The polytope of all $q$-rank functions
Combinatorics
2025-05-27 v2
Abstract
A -rank function is a real-valued function defined on the subspace lattice that is non-negative, upper bounded by the dimension function, non-drecreasing, and satisfies the submodularity law. Each such function corresponds to the rank function of a -polymatroid. In this paper, we identify these functions with points in a polytope. We show that this polytope contains no interior lattice points, implying that the points corresponding to -matroids are among its vertices. We investigate several properties of convex combinations of two lattice points in this polytope, particularly in terms of independence, flats, and cyclic flats. Special attention is given to the convex combinations of paving and uniform -matroids.
Cite
@article{arxiv.2505.08018,
title = {The polytope of all $q$-rank functions},
author = {Gianira N. Alfarano and Sebastian Degen},
journal= {arXiv preprint arXiv:2505.08018},
year = {2025}
}