Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polymatroid Schubert varieties

Published 14 Oct 2024 in math.AG and math.CO | (2410.10552v1)

Abstract: The lattice of flats LM\mathcal L_M of a matroid MM is combinatorially well-behaved and, when MM is realizable, admits a geometric model in the form of a "matroid Schubert variety". 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\mathcal L_P of "combinatorial flats" of a polymatroid PP. Combinatorially, LP\mathcal L_P exhibits good behavior analogous to that of LM\mathcal L_M: it is graded, determines PP when PP is simple, and is top-heavy. When PP is realizable over a field of characteristic 0, we show that LP\mathcal L_P is modelled by a "polymatroid Schubert variety". Our work generalizes a number of results of Ardila-Boocher and Huh-Wang on matroid Schubert varieties; however, the geometry of polymatroid Schubert varieties is noticeably more complicated than that of matroid Schubert varieties. Many natural questions remain open.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.