Search arXivSearch

arXiv · 2502.19266

Algebra and geometry of ASM weak order

Abstract

Much of modern Schubert calculus is centered on Schubert varieties in the complete flag variety and on their classes in its integral cohomology ring. Under the Borel isomorphism, these classes are represented by distinguished polynomials called Schubert polynomials, introduced by Lascoux and Schützenberger. Knutson and Miller showed that Schubert polynomials are multidegrees of matrix Schubert varieties, affine varieties introduced by Fulton, which are closely related to Schubert varieties. Many roads to studying Schubert polynomials pass through unions and intersections of matrix Schubert varieties. The third author showed that the natural indexing objects of arbitrary intersections of matrix Schubert varieties are alternating sign matrices (ASMs). Every ASM variety is expressible as a union of matrix Schubert varieties. Many fundamental algebro-geometric invariants (e.g., codimension, degree, and Castelnuovo--Mumford regularity) are well understood combinatorially for matrix Schubert varieties, substantially via the combinatorics of strong Bruhat order on $S_n$. The extension of strong order to ASM(n), the set of $n \times n$ ASMs, has so far not borne as much algebro-geometric fruit for ASM varieties. Hamaker and Reiner proposed an extension of weak Bruhat order from $S_n$ to ASM(n), which they studied from a combinatorial perspective. In the present paper, we place this work on algebro-geometric footing. We use weak order on ASMs to give a characterization of codimension of ASM varieties. We also show that weak order operators commute with K-theoretic divided difference operators and that they satisfy the same derivative formula that facilitated the first general combinatorial computation of Castelnuovo--Mumford regularity of matrix Schubert varieties. Finally, we build from these results to generalizations that apply to arbitrary unions of matrix Schubert varieties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laura Escobar, Patricia Klein, Anna Weigandt. 2025-09-04. Algebra and geometry of ASM weak order. https://arxiv.org/abs/2502.19266

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