Search arXivSearch

arXiv · 2203.14133

Cluster-permutohedra and submanifolds of flag varieties with torus actions

Abstract

In this paper we describe a relation between the notion of graphicahedron, introduced by Araujo-Pardo, Del R\'ıo-Francos, López-Dudet, Oliveros, and Schulte in 2010, and toric topology of manifolds of sparse isospectral Hermitian matrices. More precisely, we recall the notion of a cluster-permutohedron, a certain finite poset defined for a simple graph $Γ$. This poset is build as a combination of cosets of the symmetric group, and the geometric lattice of the graphical matroid of $Γ$. This poset is similar to the graphicahedron of $Γ$, in particular, 1-skeleta of both posets are isomorphic to Cayley graphs of the symmetric group. We describe the relation between cluster-permutohedron and graphicahedron using Galois connection and the notion of a core of a finite topology. We further prove that the face poset of the natural torus action on the manifold of isospectral $Γ$-shaped Hermitian matrices is isomorphic to the cluster-permutohedron. Using recent results in toric topology, we show that homotopy properties of graphicahedra may serve an obstruction to equivariant formality of isospectral matrix manifolds. We introduce a generalization of a cluster-permutohedron and describe the combinatorial structure of a large family of manifolds with torus actions, including Grassmann manifolds and partial flag manifolds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Ayzenberg, Victor Buchstaber. 2023-04-27. Cluster-permutohedra and submanifolds of flag varieties with torus actions. https://doi.org/10.1093/imrn%2Frnad076

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