Search arXivSearch

arXiv · 2606.13518

Weak order: Alternating sign matrices, monotone triangles, and bumpless pipe dreams

Abstract

In 2018, Hamaker and Reiner introduced weak order for monotone triangles, which extended the usual notion of weak order on the symmetric group. Monotone triangles on $\{1, \ldots, n\}$ are well-known to be in bijection with the set ASM$(n)$ of $n \times n$ alternating sign matrices. Hamaker and Reiner defined weak order on ASM$(n)$ to be induced from weak order on monotone triangles via the standard bijection. Recently, the present authors used an a priori different definition of weak order on ASM$(n)$ to give a combinatorial characterization of the codimension of ASM varieties and to show that the natural K-theoretic representatives of these varieties satisfy a divided difference recurrence. In the present work, we establish compatibility of these definitions of weak order on ASM$(n)$. Additionally, we give three different explicit means of computing weak order covering relations on ASM$(n)$: on ASMs themselves, on monotone triangles in a manner different from that given by Hamaker and Reiner, and on bumpless pipe dreams, which are a newer family of combinatorial objects also in correspondence with ASMs. Finally, using the language of bumpless pipe dreams, we characterize the fibers of the weak order operators, each of which forms a sublattice of the strong Bruhat order on ASM$(n)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laura Escobar, Patricia Klein, Anna Weigandt. 2026-06-11. Weak order: Alternating sign matrices, monotone triangles, and bumpless pipe dreams. https://arxiv.org/abs/2606.13518

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