Papers
Topics
Authors
Recent
Search
2000 character limit reached

Total positivity for the Lagrangian Grassmannian

Published 15 Oct 2015 in math.CO | (1510.04386v4)

Abstract: The stratification of the Grassmannian by positroid varieties has been the subject of extensive research. Positroid varieties are in bijection with a number of combinatorial objects, including $k$-Bruhat intervals and bounded affine permutations. In addition, Postnikov's boundary measurement map gives a family of parametrizations of each positroid variety; the domain of each parametrization is the space of edge weights of a weighted planar network. In this paper, we generalize the combinatorics of positroid varieties to the Lagrangian Grassmannian $\Lambda(2n)$, which is the type $C$ analog of the ordinary, or type $A$, Grassmannian. The Lagrangian Grassmannian has a stratification by projected Richardson varieties, which are the type $C$ analogs of positroid varieties. We define type $C$ generalizations of bounded affine permutations and $k$-Bruhat intervals, as well as several other combinatorial posets which index positroid varieties. In addition, we generalize Postnikov's network parametrizations to projected Richardson varieties in $\Lambda(2n)$. In particular, we show that restricting the edge weights of our networks to $\mathbb{R}+$ yields a family of parametrizations for totally nonnegative cells in $\Lambda(2n)$. In the process, we obtain a set of linear relations among the Pl\"ucker coordinates on $\text{Gr}(n,2n)$ which cut out the Lagrangian Grassmannian set-theoretically.

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 (1)

Collections

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