MoNIG Rule in Schubert Calculus

• MoNIG Rule is a combinatorial method that uses tower diagrams to explicitly implement Monk’s Rule in Schubert polynomial multiplication.
• The method employs a hook sliding algorithm that identifies critical cells and performs insertion and deletion operations to generate valid covers in the Bruhat order.
• Its bijective, diagrammatic approach provides both computational efficiency and geometric transparency in describing one-cell intersections in the cohomology of flag varieties.

The MoNIG Rule, as developed in the context of Schubert polynomial multiplication, refers to the explicit combinatorial implementation and analysis of Monk's Rule via tower diagrams. It provides a method for describing the product of a Schubert polynomial associated to a permutation $w \in S_n$ with that of an adjacent transposition, utilizing tower diagrams as both input and output objects. The process yields a bijective and diagrammatic approach to Monk's Rule, which is pivotal in the theory of Schubert calculus, particularly for computations in the cohomology ring of flag varieties (Coşkun et al., 2018).

1. Classical Monk’s Rule and Schubert Polynomials

Monk’s Rule governs the multiplication of Schubert polynomials, which are indexed by permutations $w \in S_n$ and denoted $\mathfrak{S}_w(x_1, x_2, \ldots)$. The rule characterizes the product with the Schubert polynomial of a simple transposition $s_k$:

$$\mathfrak{S}_{s_k} \cdot \mathfrak{S}_{w} = \sum_{w'} \mathfrak{S}_{w'},$$

where the sum is over all $w'$ that cover $w$ in the $k$–Bruhat order; explicitly, $w' = w \cdot t_{i,j}$ for $i \leq k < j$ and $\ell(w') = \ell(w) + 1$. This provides the multiplicative structure constants for the cohomology ring $H^*(Flags)$, with the cover relations corresponding to the combinatorics of adjacent transpositions. The MoNIG Rule encapsulates an explicit computational procedure for this multiplication through the mechanics of tower diagrams (Coşkun et al., 2018).

2. Tower Diagrams: Definitions and Core Operations

A tower diagram $T$ is defined as a finite sequence of non-negative integers $T = (T_1, T_2, ..., T_n)$, which is visualized as a set of vertical towers. The $i$th tower $T_i$ consists of $T_i$ cells, with the construction corresponding to grid points in the first quadrant. Sliding a word of positive integers $a_1 \ldots a_k$ into a diagram $T$—denoted $a_k \backslash \cdots \backslash a_1 \backslash T$—applies stepwise combinatorial operations: "direct-pass," "addition," "deletion," and "zigzag." These local rules adjust the diagram, facilitating a constructive or destructive update of its columns.

The unique tower diagram $T_w$ associated to a permutation $w$ is constructed by sliding a reduced word of $w$ into the empty diagram. Conversely, a "flight-path" algorithm extracts the permutation from a tower diagram, peeling off top "corner" cells in descending order of their generalized flight numbers $(fn, hn)$. The permutation is further determined by the vector of "flight-numbers" $f_i$ of the lowest empty cells in each tower, such that $w(f_1, f_2, ..., f_n) \mapsto (1,2,...,n)$. This bijection anchors the role of tower diagrams as combinatorial models for permutations in Schubert calculus (Coşkun et al., 2018).

3. MoNIG (Monk’s) Algorithm on Tower Diagrams

Given a tower diagram $T$ for $w \in S_n$ and a fixed $k$, the MoNIG Rule algorithm produces all possible diagrams $T'$ resulting from the action of an adjacent transposition $s_k$ that increases the permutation length by one. The key steps are:

1. Schubert-path Construction: Define the Schubert-path $P(k,T) \subset \mathbb{N}^2$ as the maximal path starting at $(1, k-1)$, proceeding east within occupied cells and southeast through unoccupied positions above the axis.
2. Identification of Critical Cells: On $P(k,T)$, mark “critical cells” as either those at the path's bottom or those where the next path cell in the same column has at least as many filled below it as empty below the critical position.
3. Cell Insertion and Hook Sliding: For each critical cell $c$ above tower $T_i$, compute the number $t$ of empty cells below $c$ in $T_i$ and $s$ as the count of occupied cells to the right along the path. For each $r$ with $0 \leq r \leq s$, append a run of cells $e_0, ..., e_{t+r}$ (with $e_t = c$) to $T_i$. Successively slide $e_{t+r}, ..., e_1$ into remaining towers $T_{>i}$, deleting one top cell per slide from subsequent towers. If this sequence produces the correct net change, the resulting diagram $U$ is recorded.

This procedure, applied to all critical cells, enumerates exactly the diagrams representing the multiplication outcomes specified by Monk’s Rule, i.e., all $T' = T_{w'}$ for $w' = w s_k$, $\ell(w') = \ell(w) + 1$, and $i \leq k < j$ (Coşkun et al., 2018).

4. Hook Insertion, Combinatorics, and Bijection Properties

A hook $h_{i,j}$—with reduced word $s_{j} \cdots s_{i+1} s_{i} s_{i+1} \cdots s_{j}$—plays a central role. Sliding $h_{i,j}$ into $T$ increases the cell count by one if and only if $\ell(w \cdot t_{i, j+1}) = \ell(w) + 1$, with the insertion precisely into tower $i$ at a position determined by the corresponding flight number. Hooks may delete zero or more cells from towers to their right. Different critical cells index disjoint insertions: within each family (fixed critical cell), the parameter $r$ tracks the permissible sliding range, ensuring that deletion always targets a fixed tower. The bijection guarantees that all and only the covers in the appropriate $k$–Bruhat order are obtained, with no repeated diagrams (Coşkun et al., 2018).

5. Schubert-Polynomial Reformulation and Geometric Implications

When $T = T_w$, the MoNIG algorithm as described operates at the level of Schubert polynomials. The resulting list of tower diagrams corresponds bijectively to the terms of

$$\mathfrak S_{s_k} \,\mathfrak S_w = \sum_{\substack{w':\,\ell(w') = \ell(w) + 1\ w' = w s_k}} \mathfrak S_{w'}$$

recovering Monk’s Rule precisely in the language of tower diagrams. This formulation generalizes and replaces other diagrammatic approaches (e.g., RC-graphs, localization), providing a self-contained and bijective hook-sliding framework.

Geometrically, Monk’s Rule expresses the cup product of the Schubert divisor class $\sigma_{s_k}$ with an arbitrary Schubert class $\sigma_{w}$ in $H^*(Flags)$. The tower-diagram hook-sliding construction provides a direct combinatorial model for the corresponding one-dimensional intersections in the equivariant cellular chain model. This offers both combinatorial transparency and computational efficiency (Coşkun et al., 2018).

6. Worked Example and Structural Insights

Consider $w = [1,2,5,6,4,10,3,8,7,11,9] \in S_{11}$ and $k=5$, with tower diagram $T = T_w$ constructed as previously described. The Schubert path $P(5,T)$ and the critical cells above towers $i=4,6,7$ are identified. Applying the MoNIG algorithm at each critical cell produces exactly seven new tower diagrams, matching the structure constants predicted by Monk’s Rule and the 5–Bruhat graph. The combinatorial framework provided by the path $P(k,T)$ determines which hooks can be slid in, and the "critical cell" mechanism encapsulates the possible insertion points and resulting diagrams.

A central theorem verifies that this critical-cell criterion and hook insertion precisely characterize the one-cell enlargements of tower diagrams corresponding to length-increasing covers in the $k$–Bruhat order. Disjointness and bijectivity are achieved by the construction, ensuring no duplication and exhaustive coverage of valid outcomes (Coşkun et al., 2018).

7. Context within Schubert Calculus and Related Approaches

The approach via tower diagrams and the MoNIG Rule provides an alternative to previous descriptions and proofs of Schubert polynomial multiplication, such as those by Bergeron–Billey, Kogan–Kumar, and Sottile’s version of Pieri’s Rule. The tower-diagram method emphasizes combinatorial locality and bijectivity, unifying insertion and deletion rules in a visual, algorithmic procedure, while remaining independent of RC-graph insertions and localization techniques. The geometric and algebraic transparency it offers positions it as a significant development in the algorithmic understanding of Schubert calculus (Coşkun et al., 2018).