Search arXivSearch

arXiv · 1510.04386

Total positivity for the Lagrangian Grassmannian

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 $Λ(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 $Λ(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 $Λ(2n)$. In the process, we obtain a set of linear relations among the Plücker coordinates on $\text{Gr}(n,2n)$ which cut out the Lagrangian Grassmannian set-theoretically.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rachel Karpman. 2016-10-16. Total positivity for the Lagrangian Grassmannian. https://arxiv.org/abs/1510.04386

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO