[Paper Review] The crossing model for regular $A_n$-crystals

В. И. Данилов, Alexander V. Karzanov+1 more|arXiv (Cornell University)|Dec 13, 2006

Algebraic structures and combinatorial models14 references4 citations

TL;DR

This paper introduces the crossing model, a combinatorial construction that generates all regular $A_n$-crystals—crystal graphs of irreducible highest weight modules over $U_q(sl_{n+1})$—using a supporting graph, feasible functions, and color-specific edge operations. The key result is that this model precisely realizes all such crystals and reveals deep structural properties, including the existence of a principal lattice isomorphic to $K({\bf b} - {\bf a})$ between any two principal vertices.

ABSTRACT

A regular $A_n$-crystal is an edge-colored directed graph, with $n$ colors, related to an irreducible highest weight integrable module over $U_q(sl_{n+1})$. Based on Stembridge's local axioms for regular simply-laced crystals and a structural characterization of regular $A_2$-crystals in \cite{DKK-07}, we present a new combinatorial construction, the so-called {\em crossing model}, and prove that this model generates precisely the set of regular $A_n$-crystals. Using the model, we obtain a series of results on the combinatorial structure of such crystals and properties of their subcrystals.

Motivation & Objective

• To provide a new combinatorial construction for regular $A_n$-crystals based on Stembridge’s local axioms.
• To characterize the full combinatorial structure of these crystals beyond the $A_2$ case.
• To identify and analyze the principal lattice within $A_n$-crystals and its role in subcrystal isomorphisms.
• To establish that all finite $A_n$-crystals have a unique source, confirming their realization via the model.

Proposed method

• Define a supporting graph $G$ composed of $n$ disjoint subgraphs $G^1, \dots, G^n$, each associated with a color.
• Introduce a set $\mathcal{F}$ of integer-valued feasible functions on $G$'s vertices, parameterized by $\mathbf{c} \in \mathbb{Z}_+^n$, with values bounded by $c_i$ on $G^i$.
• Define $n$ edge sets $\mathcal{E}_1, \dots, \mathcal{E}_n$ as transformations of feasible functions, corresponding to color-specific moves.
• Show that the graph formed by $\mathcal{F}$ and $\mathcal{E}_i$ is isomorphic to the regular $A_n$-crystal $K(\mathbf{c})$ via combinatorial verification.
• Use the model to analyze the principal lattice $\Pi$, consisting of functions constant on each $G^i$, and prove its structural properties.
• Apply the model to prove that intervals between principal vertices $v[\mathbf{a}]$ and $v[\mathbf{b}]$ are isomorphic to $K(\mathbf{b} - \mathbf{a})$.

Experimental results

Research questions

• RQ1 How can regular $A_n$-crystals be systematically constructed using only local combinatorial rules and graph-theoretic structures?
• RQ2 What is the role of the principal lattice in the internal structure of $A_n$-crystals, and how do its intervals relate to smaller crystals?
• RQ3 Do all finite $A_n$-crystals admit a unique source, and can this be derived from Stembridge’s axioms alone?
• RQ4 What is the structure of maximal subcrystals with colors $1,\dots,n-1$ or $2,\dots,n$, and how are they related to principal vertices?
• RQ5 Can the intersection of upper and lower subcrystals in $K(\mathbf{c})$ be characterized, and does it yield recursive assembly of the full crystal?

Key findings

• The crossing model constructs all regular $A_n$-crystals via a finite supporting graph, feasible functions, and color-specific edge operations, and proves isomorphism to $K(\mathbf{c})$.
• Every finite $A_n$-crystal has a unique source, confirming that all such crystals are of the form $K(\mathbf{c})$ for some $\mathbf{c} \in \mathbb{Z}_+^n$.
• The principal lattice $\Pi$ consists of $(c_1+1)\cdots(c_n+1)$ vertices $v[\mathbf{a}]$, each corresponding to $\mathbf{a} \leq \mathbf{c}$, and forms a distributive lattice.
• The interval between any two principal vertices $v[\mathbf{a}]$ and $v[\mathbf{b}]$ with $\mathbf{a} \leq \mathbf{b} \leq \mathbf{c}$ is isomorphic to the crystal $K(\mathbf{b} - \mathbf{a})$.
• For any $1 \leq r \leq \lceil n/2 \rceil$, all $(n-2r+2)$-colored subcrystals of $K(\mathbf{c})$ with colors $r, \dots, n-r+1$ that intersect the principal lattice are isomorphic to $K(c_r, \dots, c_{n-r+1})$.
• The model enables recursive construction of $K(\mathbf{c})$ by analyzing intersections of upper and lower subcrystals, with applications to $B_n$ and $C_n$ crystals via symmetric embeddings in $A_{2n-1}$ and $A_{2n}$.