Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 170 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Combinatorics of Essential Sets for Positroids (2403.09453v3)

Published 14 Mar 2024 in math.CO

Abstract: Positroids are a family of matroids introduced by Postnikov in the study of non-negative Grassmannians. Postnikov identified several combinatorial objects in bijections with positroids, among which are bounded affine permutations. On the other hand, the notion of essential sets, introduced for permutations by Fulton, was used by Knutson in the study of the special family of interval rank positroids. We generalize Fulton's essential sets to bounded affine permutations. The bijection of the latter with positroids, allows study of the relationship between them. From the point of view of positroids, essential sets are maximally dependent cyclic interval. We define connected essential sets and prove that they give a facet description of the positroid polytope, as well as equations defining the positroid variety. We define a subset of essential sets, called core, which contains minimal rank conditions to uniquely recover a positroid. We provide an algorithm to retrieve the positroid satisfying the rank conditions in the core or any compatible rank condition on cyclic intervals.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. Positroids and non-crossing partitions. Transactions of the American Mathematical Society, 368(1):337–363, 2016.
  2. Grassmannian Geometry of Scattering Amplitudes. Cambridge University Press, 4 2016.
  3. J. E. Bonin. A characterization of positroids, with applications to amalgams and excluded minors. arXiv preprint arXiv:2306.06694, 2023.
  4. K. Eriksson and S. Linusson. The size of Fulton’s essential set. The Electronic Journal of Combinatorics, 2, 1995.
  5. K. Eriksson and S. Linusson. Combinatorics of Fulton’s essential set. Duke Mathematical Journal, 85(1):61–76, 1996.
  6. Cluster algebras and tilings for the m= 4 amplituhedron. arXiv preprint arXiv:2310.17727, 2023.
  7. W. Fulton. Flags, Schubert polynomials, degeneracy loci, and determinantal formulas. Duke Mathematical Journal, 65(3):381–420, 1992.
  8. A. Knutson. Puzzles, positroid varieties, and equivariant k-theory of Grassmannians. arXiv preprint arXiv:1008.4302, 2010.
  9. Positroid varieties: juggling and geometry. Compositio Mathematica, 149(10):1710–1752, 2013.
  10. R. Mcalmon and S. Oh. The rank function of a positroid and non-crossing partitions. The Electronic Journal of Combinatorics, 27(1), 2020.
  11. Triangulations and canonical forms of amplituhedra: a fiber-based approach beyond polytopes. Communications in Mathematical Physics, 387(2):927–972, 2021.
  12. F. Mohammadi and F. Zaffalon. Computing positroid cells in the Grassmannian of lines, their boundaries and their intersections. arXiv preprint arXiv:2206.14001, 2022.
  13. A. Postnikov. Total positivity, Grassmannians, and networks. arXiv preprint math/0609764, 2006.
  14. Matching polytopes, toric geometry, and the totally non-negative Grassmannian. Journal of Algebraic Combinatorics, 30(2):173–191, 2009.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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