Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-12T06:43:37.019Z Has data issue: false hasContentIssue false

AN ALGORITHM TO CONSTRUCT THE LE DIAGRAM ASSOCIATED TO A GRASSMANN NECKLACE

Published online by Cambridge University Press:  18 January 2019

SUSAMA AGARWALA
Affiliation:
Johns Hopkins Applied Physics Lab, Laurel, MD 20723, USA e-mail: susama.agarwala@jhuapl.edu
SIÂN FRYER*
Affiliation:
Department of Mathematics, University of California, Santa Barbara, CA 93106-3080, USA e-mail: fryer@ucsb.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Le diagrams and Grassmann necklaces both index the collection of positroids in the nonnegative Grassmannian Gr≥0(k, n), but they excel at very different tasks: for example, the dimension of a positroid is easily extracted from its Le diagram, while the list of bases of a positroid is far more easily obtained from its Grassmann necklace. Explicit bijections between the two are, therefore, desirable. An algorithm for turning a Le diagram into a Grassmann necklace already exists; in this note, we give the reverse algorithm.

Information

Type
Research Article
Creative Commons
This is a work of the U.S. Government and is not subject to copyright protection in the United States
Copyright
Copyright © Glasgow Mathematical Journal Trust 2019