The lattice of flats of a matroid is combinatorially well-behaved and, when is realizable, admits a geometric model in the form of a “Schubert variety of hyperplane arrangement”. In contrast, the lattice of flats of a polymatroid exhibits many combinatorial pathologies and admits no similar geometric model. We address this situation by defining the lattice of “combinatorial flats” of a polymatroid . Combinatorially, exhibits good behavior analogous to that of : it is graded, determines when is simple, and is top-heavy. When is realizable over a field of characteristic 0, we show that is modeled by “the Schubert variety of a subspace arrangement”. Our work generalizes a number of results of Ardila-Boocher and Huh-Wang on Schubert varieties of hyperplane arrangements; however, the geometry of Schubert varieties of subspace arrangements is noticeably more complicated than that of Schubert varieties of hyperplane arrangements. Many natural questions remain open.

生成讲解博客的中文版本

生成AI智能校验的中文版本