Combinatorics of essential sets for positroids

DOI10.1016/J.JALGEBRA.2024.05.019MaRDI QIDQ6588200zbMATH OpenFDO

Authors Fatemeh Mohammadi, Francesca Zaffalon

Publication date 15 August 2024

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JALGEBRA.2024.05.019

zbMATH Keywords

bounded affine permutationsessential setsmatroidspositroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05)

Review text

A \textit{positroid} is a matroid \(\mathcal{M}\) which is realizable over \(\mathbb{R}\) and such that there exists a realizing matrix \(M\) for \(\mathcal{M}\) with non-negative maximal minors. Historically, \textit{A. Postnikov} [``Total positivity, Grassmannians, and networks, Preprint, \url{arXiv:math/0609764}] has identified several families of objects in bijection with positroids, such as bounded affine permutations, plabic graphs, Grassmann necklaces, and Le diagrams. In addition, \textit{W. Fulton} [Duke Math. J. 65, No. 3, 381--420 (1992; Zbl 0788.14044)] introduced essential sets as objects associated to permutations, to explore the degeneracy loci of maps of flagged vector bundles. In this work, the authors try to introduce a new combinatorial description of positroids via ranked essential sets and illustrate how to obtain information about the positroid's structure from them. Furthermore, in this paper, the authors extend Fulton's essential sets to bounded affine permutations such that the bijection of the latter with positroids permit them to probe the relationship between them. After that, the authors continue to define connected essential sets and verify that they present a facet description of the positroid polytope, as well as equations defining the positroid variety. Next, the authors focus on a subset of essential sets, called core, which contains minimal rank conditions to uniquely recover a positroid. Finally, the authors conclude this paper by establishing an algorithm to recover the positroid satisfying the rank conditions in the core or any compatible rank condition on cyclic intervals.

Recommendations

• The rank function of a positroid and non-crossing partitions
• Positroids and Schubert matroids
• The facets of the matroid polytope and the independent set polytope of a positroid
• Flats of a positroid from its decorated permutation
• Combinatorics of positroids

Cites work

• Combinatorics of Fulton's essential set
• Flags, Schubert polynomials, degeneracy loci, and determinantal formulas
• Grassmannian geometry of scattering amplitudes
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• Matching polytopes, toric geometry, and the totally non-negative Grassmannian.
• Positroid varieties: juggling and geometry
• Positroids and non-crossing partitions
• The amplituhedron
• The positive Grassmannian, the amplituhedron, and cluster algebras
• The rank function of a positroid and non-crossing partitions
• The size of Fulton's essential set
• Triangulations and canonical forms of amplituhedra: a fiber-based approach beyond polytopes

Cited in

(1)

• Progress on infinite cluster categories related to triangulations of the (punctured) disk

This page was built for publication: Combinatorics of essential sets for positroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588200)