Combinatorial flats and Schubert varieties of subspace arrangements

Abstract

The lattice of flats LM of a matroid M is combinatorially well-behaved and, when M 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 LP of "combinatorial flats" of a polymatroid P. Combinatorially, LP exhibits good behavior analogous to that of LM: it is graded, determines P when P is simple, and is top-heavy. When P is realizable over a field of characteristic 0, we show that LP 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…