Related papers: Perforated Tableaux: A Combinatorial Model for Cry…
The affine Dynkin diagram of type $A_n^{(1)}$ has a cyclic symmetry. The analogue of this Dynkin diagram automorphism on the level of crystals is called a promotion operator. In this paper we show that the only irreducible type $A_n$…
We introduce coplactic raising and lowering operators $E'_i$, $F'_i$, $E_i$, and $F_i$ on shifted skew semistandard tableaux. We show that the primed operators and unprimed operators each independently form type A Kashiwara crystals (but…
We calculate the image of the combinatorial R-matrix for any classical highest weight element in the tensor product of Kirillov--Reshetikhin crystals $B^{r,k}\otimes B^{1,l}$ of type $D^{(1)}_n, B^{(1)}_n, A^{(2)}_{2n-1}$. The notion of…
We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type A_{n-1}, we rederive the description of the generalized exponents in terms…
For simply-laced Kac-Moody algebras $\frak g$, Stembridge (2003) proposed a `local' axiomatization of crystal graphs of representations of $U_q(\frak g)$. In this paper we propose axioms for edge-2-colored graphs which characterize the…
The alcove model of the first author and A. Postnikov uniformly describes highest weight crystals of semisimple Lie algebras. We construct a generalization, called the quantum alcove model. In joint work of the first author with S. Naito,…
In their study of the equivariant K-theory of the generalized flag varieties $G/P$, where $G$ is a complex semisimple Lie group, and $P$ is a parabolic subgroup of $G$, Lenart and Postnikov introduced a combinatorial tool, called the alcove…
Kirillov-Reshetikhin crystals are colored directed graphs encoding the structure of certain finite-dimensional representations of affine Lie algebras. A tensor products of column shape Kirillov-Reshetikhin crystals has recently been…
Consider Kashiwara's crystal associated to a highest weight representation of a symmetric Kac-Moody algebra. There is a geometric realization of this object using Nakajima's quiver varieties, but in many particular cases it can also be…
Kang et al. provided a path realization of the crystal graph of a highest weight module over a quantum affine algebra, as certain semi-infinite tensor products of a single perfect crystal. In this paper, this result is generalized to give a…
Crystal structures are characterized by atomic bases within a primitive unit cell that repeats along a regular lattice throughout 3D space. The periodic and infinite nature of crystals poses unique challenges for geometric graph…
We give a simple characterization of the highest weight vertices in the crystal graph of the level l Fock spaces. This characterization is based on the notion of totally periodic symbols viewed as affine analogues of reverse lattice words…
Modern E(3)-Equivariant networks may be used to predict rotationally equivariant properties, including tensorial quantities. Three such quantities: the dielectric, piezoelectric, and elasticity tensors, are computationally expensive to…
We initiate a new approach to the study of the combinatorics of several parametrizations of canonical bases. In this work we deal with Lie algebras of type $A$. Using geometric objects called Rhombic tilings we derive a "crossing formula"…
We define three combinatorial models for \hat{sl(n)} crystals, parametrized by partitions, configurations of beads on an `abacus', and cylindric plane partitions, respectively. These are reducible, but we can identify an irreducible…
For coherent families of crystals of affine Lie algebras of type B^{(1)}_n, D^{(1)}_n, A^{(2)}_{2n} and D^{(2)}_{n+1} we describe the combinatorial R matrix using column insertion algorithms for B,C,D Young tableaux.
The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This…
Rigged configurations are combinatorial objects prominent in the study of solvable lattice models. Marginally large tableaux are semi-standard Young tableaux of special form that give a realization of the crystals ${\cal B}(\infty)$. We…
Kerov, Kirillov, and Reshetikhin defined a bijection between highest weight vectors in the crystal graph of a tensor power of the vector representation, and combinatorial objects called rigged configurations, for type $A^{(1)}_n$. We define…
Supervised learning with deep models has tremendous potential for applications in materials science. Recently, graph neural networks have been used in this context, drawing direct inspiration from models for molecules. However, materials…