[Paper Review] On the combinatorial structure of crystals of types A,B,C

В. И. Данилов, Alexander V. Karzanov+1 more|arXiv (Cornell University)|Jan 22, 2012

Algebraic structures and combinatorial models11 references3 citations

TL;DR

This paper develops combinatorial methods to analyze the structure of regular crystals of types A, B, and C using local graph-theoretic axioms and recursive constructions. It establishes a precise relationship between B_n- and C_n-crystals and symmetric A_{2n-1}- and A_{2n}-crystals, respectively, by characterizing subcrystal intersections and providing an efficient recursive assembly procedure for A_n-crystals through maximal subcrystals with adjacent color sets.

ABSTRACT

Regular $A_n$-, $B_n$- and $C_n$-crystals are edge-colored directed graphs, with ordered colors $1,2,...,n$, which are related to representations of quantized algebras $U_q(\mathfrak{sl}_{n+1})$, $U_q(\mathfrak{sp}_{2n})$ and $U_q(\mathfrak{so}_{2n+1})$, respectively. We develop combinatorial methods to reveal refined structural properties of such objects. Firstly, we study subcrystals of a regular $A_n$-crystal $K$ and characterize pairwise intersections of maximal subcrystals with colors $1,...,n-1$ and colors $2,...,n$. This leads to a recursive description of the structure of $K$ and provides an efficient procedure of assembling $K$. Secondly, using merely combinatorial means, we demonstrate a relationship between regular $B_n$-crystals (resp. $C_n$-crystals) and regular symmetric $A_{2n-1}$-crystals (resp. $A_{2n}$-crystals).

Motivation & Objective

• To develop combinatorial tools for analyzing the internal structure of regular A_n-, B_n-, and C_n-crystals.
• To characterize pairwise intersections of maximal subcrystals in A_n-crystals, specifically those with colors {1,…,n−1} and {2,…,n}.
• To establish a structural correspondence between B_n- and C_n-crystals and symmetric A-type crystals (A_{2n-1} and A_{2n}), respectively, using purely combinatorial means.
• To provide a recursive procedure for assembling A_n-crystals based on their subcrystal decomposition.

Proposed method

• Uses local graph-theoretic axioms to define and analyze A_2- and B_2-crystals, avoiding reliance on global models like Lusztig’s canonical bases.
• Applies the worm model for B_2-crystals as a foundational combinatorial construction, extending it to higher-rank crystals.
• Employs coordinate systems and deviation parameters (Δ, ℏ, ρ, δ, φ, ψ) to track vertex positions and relative displacements across subcrystals.
• Derives recursive formulas for loci and deviations (e.g., Δ′↑, a′↑) through algebraic manipulation of coordinate relations in subcrystals.
• Uses the Cartesian product structure of two-colored subcrystals (A_1×A_1 or A_2) as a base case for higher-rank crystal construction.
• Applies the concept of maximal subcrystals with consecutive color sets to recursively reconstruct the full A_n-crystal structure.

Experimental results

Research questions

• RQ1 How do maximal subcrystals of an A_n-crystal with colors {1,…,n−1} and {2,…,n} intersect, and what does this imply for the overall crystal structure?
• RQ2 Can B_n- and C_n-crystals be systematically related to symmetric A-type crystals (A_{2n-1} and A_{2n}) via combinatorial constructions?
• RQ3 What recursive procedure allows for the efficient assembly of an A_n-crystal from its subcrystal components?
• RQ4 How do deviation parameters (Δ, φ, ψ, δ) encode the relative positions of vertices across subcrystals in the recursive construction?

Key findings

• The intersection of maximal subcrystals with colors {1,…,n−1} and {2,…,n} in an A_n-crystal is characterized by a recursive decomposition that enables full reconstruction of the crystal from its subcomponents.
• A B_n-crystal is combinatorially equivalent to a symmetric A_{2n-1}-crystal, and a C_n-crystal is equivalent to a symmetric A_{2n}-crystal, via a structure-preserving mapping.
• The recursive construction of A_n-crystals is fully determined by the intersection pattern of its maximal subcrystals, enabling an efficient algorithmic assembly process.
• The deviation parameter ω′ = c₁ − a₁ − δ + (ρ − a₂ − δ)^+ + ((ρ − a₂ − δ)^− + (ρ − a₂ − δ^−)^+)^+ determines the relative position of vertices in the upper subcrystal and is key to verifying structural consistency.
• For V-worms, ω′ = c₁ − a₄, and ω′ > 0 if and only if c₁ > q₂, providing a combinatorial criterion for vertex position in the crystal.
• For H-worms and HV-worms, ω′ > 0 or ω′ = c₁ − q₂, respectively, confirming consistency with the crystal’s structural axioms and validating the recursive framework.