Chains of I-Boxes in Cluster Algebras

• Chains of I-Boxes are combinatorial structures arising from colored intervals and admissible chains that effectively parameterize cluster seeds in monoidal categorification.
• They employ left–right (LR) expansion sequences to determine exchange matrices and quiver mutations, thereby encoding interval growth and mutation dynamics.
• The framework connects explicit closed formulas for exchange matrices with Demazure weaves, braid varieties, and categorification methods to reveal deep algebraic insights.

Searching arXiv for the cited papers to ground the article in recent research. (Contu et al., 8 Jul 2025) on "From i-boxes to signed words" (published 2025-07-08) (Contu et al., 8 Jul 2025, Kashiwara et al., 2024) on "Exchange matrices of I-boxes" (published 2024-09-22) (Kashiwara et al., 2024, Huh et al., 5 Jun 2026) on "A Comparison of cluster algebra structures arising from $i$-boxes and Demazure weaves" (published 2026-06-05) (Huh et al., 5 Jun 2026) Chains of $i$-boxes are combinatorial structures attached to a colored interval or time-line and used to parameterize cluster seeds arising in monoidal categorification. In the formulation of Kashiwara–Kim–Oh–Park and its subsequent extensions, one starts from a sequence of colors and records, at each stage of a one-step enlargement of an envelope interval, the largest subinterval whose endpoints have the same color. This produces a chain, or in finite $ADE$ type an admissible chain, and the resulting data can be translated into exchange matrices, quivers, signed words in the sense of Berenstein–Fomin–Zelevinsky, and Demazure-weave seeds on braid varieties (Contu et al., 8 Jul 2025, Kashiwara et al., 2024, Huh et al., 5 Jun 2026).

1. Formal setup and basic definitions

A general setup fixes a finite index set $I$ equipped with a generalized Cartan matrix $C=(c_{ij})_{i,j\in I}$, an integer time-line $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$, and a sequence $\mathbf i=(i_k)_{k\in Z}$ with $i_k\in I$. For $s\in Z$ and $j\in I$, the standard neighbor functions are

$i$0

$i$1

A finite subinterval $i$2 is an $i$3-box if $i$4. Its color is $i$5, and its order, or $i$6-cardinality, is the number of occurrences of $i$7 in the subsequence $i$8. Two associated intervals,

$i$9

are the largest $ADE$0-boxes inside $ADE$1 sharing the color of the left or right endpoint, respectively (Contu et al., 8 Jul 2025).

In the finite $ADE$2-type braid-theoretic setting, one instead fixes a Cartan matrix $ADE$3 of finite $ADE$4 type with index set $ADE$5 and an expression

$ADE$6

of a braid $ADE$7. For each $ADE$8 and $ADE$9,

$I$0

with $I$1 and $I$2. The same interval combinatorics is then used to define admissible chains and the cluster-algebra structures attached to them (Huh et al., 5 Jun 2026).

2. Admissibility, envelopes, and left–right expansion data

A chain of $I$3-boxes of length $I$4 is a sequence

$I$5

such that for each $I$6, the union $I$7 is an interval of size $I$8, and $I$9 is the largest $C=(c_{ij})_{i,j\in I}$0-box of color $C=(c_{ij})_{i,j\in I}$1 contained in $C=(c_{ij})_{i,j\in I}$2. In finite range this becomes the notion of an admissible chain: an ordered sequence

$C=(c_{ij})_{i,j\in I}$3

is admissible if, for each $C=(c_{ij})_{i,j\in I}$4,

$C=(c_{ij})_{i,j\in I}$5

is a finite interval of size $C=(c_{ij})_{i,j\in I}$6, and

$C=(c_{ij})_{i,j\in I}$7

The interval $C=(c_{ij})_{i,j\in I}$8 is called the envelope of $C=(c_{ij})_{i,j\in I}$9, and the newly added point $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$0 is its effective end (Huh et al., 5 Jun 2026).

The combinatorics of a chain is encoded by a one-sided growth history. Kashiwara–Kim–Oh–Park show that chains are in bijection with rooted expansion sequences

$Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$1

defined by

$Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$2

In the finite $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$3 formulation, the same information is recorded by an LR-sequence

$Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$4

where $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$5 or $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$6 indicates that $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$7 is obtained from $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$8 by adding one box on the left or right. The entire chain is determined by the initial singleton $Z=[a,b]\subset \mathbb Z\cup\{\pm\infty\}$9 and this LR-sequence (Contu et al., 8 Jul 2025, Huh et al., 5 Jun 2026).

This left–right encoding is significant because it converts interval growth into a linear combinatorial datum. A plausible implication is that the later identifications with signed words and weaves become possible precisely because the chain can be reconstructed from this binary expansion history.

3. Commuting families, quivers, and seed structure

Two $\mathbf i=(i_k)_{k\in Z}$0-boxes $\mathbf i=(i_k)_{k\in Z}$1 and $\mathbf i=(i_k)_{k\in Z}$2 commute if either

$\mathbf i=(i_k)_{k\in Z}$3

A family of $\mathbf i=(i_k)_{k\in Z}$4-boxes is commuting if every pair commutes, and maximal commuting if it is not properly contained in a larger commuting family. An admissible chain yields a maximal commuting family, and conversely any maximal commuting family in $\mathbf i=(i_k)_{k\in Z}$5 has exactly $\mathbf i=(i_k)_{k\in Z}$6 members and arises from some admissible chain (Kashiwara et al., 2024).

This correspondence is the bridge from interval combinatorics to seed data. In the monoidal categorification setup, either for finite-dimensional modules over a symmetric quiver Hecke algebra or for Hernandez–Leclerc subcategories of a quantum affine algebra, the determinantial or cuspidal-affine modules attached to a commuting $\mathbf i=(i_k)_{k\in Z}$7-box family strongly commute. If $\mathbf i=(i_k)_{k\in Z}$8 is a maximal commuting family, the corresponding simple modules

$\mathbf i=(i_k)_{k\in Z}$9

pairwise strongly commute, and $i_k\in I$0-tuples of such families together with an exchange matrix define seeds in the Grothendieck cluster algebra $i_k\in I$1 (Kashiwara et al., 2024).

The direct $i_k\in I$2-box exchange matrix is defined on a maximal commuting family $i_k\in I$3 with row and column labels given by boxes. Writing a row/column index as $i_k\in I$4, the entry

$i_k\in I$5

is $i_k\in I$6, $i_k\in I$7, $i_k\in I$8, or $i_k\in I$9, depending on whether the two boxes satisfy one of the horizontal-neighbor conditions, their sign-reversed versions, one of four local configurations involving colors $s\in Z$0, $s\in Z$1 with $s\in Z$2, or none of these conditions. The matrix is skew-symmetrizable with symmetrizer

$s\in Z$3

for a box of color $s\in Z$4, and Theorem 5.20 identifies it with the cluster exchange matrix of the seed $s\in Z$5 in $s\in Z$6 (Kashiwara et al., 2024).

4. Signed words and explicit closed formulas for exchange matrices

A signed word of length $s\in Z$7 is a sequence

$s\in Z$8

For such a word one defines

$s\in Z$9

and partitions the indices into

$j\in I$0

A chain $j\in I$1 with expansion operators $j\in I$2 determines a signed word

$j\in I$3

where $j\in I$4 and

$j\in I$5

This construction is a bijection from rooted expansion sequences, hence chains, to a subclass of signed words, namely those whose support fits into one interval of $j\in I$6 (Contu et al., 8 Jul 2025).

For a signed word $j\in I$7, Berenstein–Fomin–Zelevinsky attach a cluster seed

$j\in I$8

where $j\in I$9 is the $i$00-matrix with entries

$i$01

Theorem 2.1 states that if $i$02 is any chain of $i$03-boxes of finite range $i$04, then the exchange matrix produced by the Kashiwara–Kim–Oh–Park box-move or mutation procedure coincides with the combinatorial matrix from the signed word: $i$05 Consequently, the cluster seed attached to $i$06 is exactly $i$07 (Contu et al., 8 Jul 2025).

The signed-word description replaces the earlier two-step “initial chain + box-move” procedure by an explicit closed formula. The same paper states that the formula continues to work in infinite rank when $i$08, because only the first-neighbor data $i$09 and local finiteness around each index are needed, and colimit arguments show stability under truncation. It also records a degenerate case: if every expansion is one-sided so that no neighbor re-occurs, then $i$10 and the exchange matrix is vacuously zero, yielding a pure frozen seed (Contu et al., 8 Jul 2025).

A minimal example occurs in type $i$11 with $i$12, $i$13, and chain

$i$14

All expansion operators are $i$15, so

$i$16

with first neighbors $i$17, $i$18, $i$19. Hence $i$20, and the exchange matrix is the $i$21 column

$i$22

(Contu et al., 8 Jul 2025).

5. Comparison with Demazure weaves and braid varieties

For a braid expression $i$23 in finite $i$24 type, admissible chains of $i$25-boxes define one cluster-algebra structure on the localized bosonic extension $i$26, while Demazure weaves define another on the coordinate ring of a braid variety. The comparison theorem constructs, for each admissible chain $i$27, a Demazure weave $i$28 and proves the existence of a unique algebra isomorphism

$i$29

such that

$i$30

(Huh et al., 5 Jun 2026).

The weave construction is built from the same LR-data that controls admissible chains. If $i$31 is an expression of the half-twist and $i$32 has LR-sequence $i$33 and colors $i$34, one defines a double string

$i$35

where

$i$36

From this one obtains a double inductive weave $i$37, chooses a top part $i$38 built only from $i$39- and $i$40-valent vertices, and concatenates them to form $i$41. By weave-equivalence, all such choices yield the same initial seed of the braid variety (Huh et al., 5 Jun 2026).

The comparison also clarifies the status of local moves. Proposition 3.5 states that if a box-move interchanges adjacent boxes of the same color, then it is a cluster mutation; if the colors differ, the operation is only a permutation of labels. On the weave side, the analogous local move in the double string is likewise either a quiver mutation or a label-swap, with $i$42-valent vertices realizing exchange relations and $i$43-valent vertices realizing relabeling (Huh et al., 5 Jun 2026). A plausible implication is that the $i$44-box and weave formalisms encode the same mutation dynamics at different combinatorial resolutions.

6. Algebraic realizations, categorification, and representative examples

In the bosonic-extension formalism, the quantum algebra $i$45 specializes at $i$46 to a commutative algebra generated by PBW vectors

$i$47

and $i$48 is the localization obtained by inverting frozen variables. For each finite interval $i$49 one defines a minor $i$50 by the recursion

$i$51

$i$52

If $i$53 is an admissible chain, then

$i$54

is the initial cluster, and Theorem 4.4 states that $i$55 carries a cluster structure with initial seed $i$56 (Huh et al., 5 Jun 2026).

The monoidal-categorical form of the same statement appears in the Grothendieck-ring setting. For each exchangeable box $i$57 in a maximal commuting family $i$58, one constructs a new simple module

$i$59

and short exact sequences

$i$60

realizing the two cluster monomials in the exchange relation. This is the core mechanism by which the $i$61-box matrix becomes the cluster exchange matrix in Theorem 5.20 (Kashiwara et al., 2024).

A further layer is the Hernandez–Leclerc monoidal categorification. Fixing a quantum affine algebra $i$62, a Hernandez–Leclerc category $i$63, and a duality datum $i$64, the classes of affine cuspidal modules $i$65 categorify the PBW vectors $i$66, while determinantial modules $i$67 categorify the minors $i$68. Proposition 8.8 yields an isomorphism

$i$69

under which $i$70 and $i$71. Under the composed isomorphisms to $i$72, the simple module $i$73 corresponds to the coordinate function $i$74, and $i$75 corresponds to the cluster variable $i$76 arising from the weave seed (Huh et al., 5 Jun 2026).

Two representative examples show the range of the formalism. In the rank-$i$77 case

$i$78

an admissible chain

$i$79

produces a maximal commuting family with exchangeable boxes $i$80 and $i$81, principal part

$i$82

and after mutation at $i$83, the new principal part

$i$84

together with the short exact $i$85-system

$i$86

(Kashiwara et al., 2024). In type $i$87, with

$i$88

the right chain $i$89 has boxes

$i$90

and the corresponding minors satisfy

$i$91

Under $i$92, these become

$i$93

and the associated quivers are opposite: $i$94 (Huh et al., 5 Jun 2026).

Taken together, these results place chains of $i$95-boxes at the intersection of interval combinatorics, explicit exchange-matrix formulas, braid-variety geometry, and monoidal categorification. The established equivalences do not collapse the distinctions among these languages; rather, they identify the same cluster-theoretic data under different realizations.