Papers
Topics
Authors
Recent
Search
2000 character limit reached

Positroid envelopes and graphic positroids

Published 27 Feb 2024 in math.CO | (2402.17841v2)

Abstract: Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope classes, by their Grassmann necklaces. We give an explicit graph construction that shows that every positroid envelope class contains a graphic matroid. We prove that a graphic positroid is the unique matroid in its positroid envelope class. Finally, we show that every graphic positroid has an oriented graph representable by a signed incidence matrix with all nonnegative minors.

Citations (1)

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.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.