Search arXivSearch

arXiv · 0809.0871

$\LE$-diagrams and totally positive bases inside the nonnegative Grassmannian

Abstract

There is a cell decomposition of the nonnegative Grassmannian. For each cell, totally positive bases(TP-bases) is defined as the minimal set of Plücker variables such that all other nonzero Plücker variables in the cell can be expressed in those variables in a subtraction-free rational function. This is the generalization of the TP-bases defined for nonnegative part of $GL_k$ defined in \cite{FZ5}. For each cell, we have a $\LE$-diagram and a natural way to label the dots inside the diagram with Plücker variables. Those set of Plücker variables form a TP-bases of the cell. Using mutations coming from 3-term Plücker relation, we conjecture that they can be mutated to a special set of Plücker variable $§$. All other nonzero Plücker variables in the cell will be expressed as a subtraction-free Laurent polynomial in variables of $§$. We define TP-diagrams to express the transformation procedure in terms of moves on a diagram. We will prove the conjecture for certain class of cells called weakly-connected cells. Then we will study the connection with cluster algebras through lattice-path-matroid cells.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Suho OH. 2008-09-04. $\LE$-diagrams and totally positive bases inside the nonnegative Grassmannian. https://arxiv.org/abs/0809.0871

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