Search arXivSearch

arXiv · 2206.05806

On two notions of total positivity for partial flag varieties

Abstract

Given integers $1 \le k_1 < \cdots < k_l \le n-1$, let $\text{Fl}_{k_1,\dots,k_l;n}$ denote the type $A$ partial flag variety consisting of all chains of subspaces $(V_{k_1}\subset\cdots\subset V_{k_l})$ inside $\mathbb{R}^n$, where each $V_k$ has dimension $k$. Lusztig (1994, 1998) introduced the totally positive part $\text{Fl}_{k_1,\dots,k_l;n}^{>0}$ as the subset of partial flags which can be represented by a totally positive $n\times n$ matrix, and defined the totally nonnegative part $\text{Fl}_{k_1,\dots,k_l;n}^{\ge 0}$ as the closure of $\text{Fl}_{k_1,\dots,k_l;n}^{>0}$. On the other hand, following Postnikov (2007), we define $\text{Fl}_{k_1,\dots,k_l;n}^{Δ>0}$ and $\text{Fl}_{k_1,\dots,k_l;n}^{Δ\ge 0}$ as the subsets of $\text{Fl}_{k_1,\dots,k_l;n}$ where all Plücker coordinates are positive and nonnegative, respectively. It follows from the definitions that Lusztig's total positivity implies Plücker positivity, and it is natural to ask when these two notions of positivity agree. Rietsch (2009) proved that they agree in the case of the Grassmannian $\text{Fl}_{k;n}$, and Chevalier (2011) showed that the two notions are distinct for $\text{Fl}_{1,3;4}$. We show that in general, the two notions agree if and only if $k_1, \dots, k_l$ are consecutive integers. We give an elementary proof of this result (including for the case of Grassmannians) based on classical results in linear algebra and the theory of total positivity. We also show that the cell decomposition of $\text{Fl}_{k_1,\dots,k_l;n}^{\ge 0}$ coincides with its matroid decomposition if and only if $k_1,\dots,k_l$ are consecutive integers, which was previously only known for complete flag varieties, Grassmannians, and $\text{Fl}_{1,3;4}$. Finally, we determine which notions of positivity are compatible with a natural action of the cyclic group of order $n$ that rotates the index set.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anthony M. Bloch, Steven N. Karp. 2022-10-10. On two notions of total positivity for partial flag varieties. https://doi.org/10.1016/j.aim.2022.108855

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO