Related papers: Combinatorics of canonical bases revisited: String…
We define combinatorial counterparts to the geometric string vertices of Sen-Zwiebach and Costello-Zwiebach, which are certain closed subsets of the moduli spaces of curves. Our combinatorial vertices contain the same information as the…
In an earlier work, we proved that MV polytopes parameterize both Lusztig's canonical basis and the Mirkovic-Vilonen cycles on the Affine Grassmannian. Each of these sets has a crystal structure (due to Kashiwara-Lusztig on the canonical…
Lusztig's theory of PBW bases gives a way to realize the infinity crystal for any simple complex Lie algebra where the underlying set consists of Kostant partitions. In fact, there are many different such realizations, one for each reduced…
We provide an explicit combinatorial description of the embedding of the crystal of Kashiwara-Nakashima tableaux in types $B$ and $C$ into that of $\bi$-Lusztig data associated to a family of reduced expressions $\bi$ of the longest element…
Although information content is invariant up to an additive constant, the range of possible additive constants applicable to programming languages is so large that in practice it plays a major role in the actual evaluation of K(s), the…
Let G be a connected reductive algebraic group. We prove that the string parametrization of a crystal basis for a finite dimensional irreducible representation of G extends to a natural valuation on the field of rational functions on the…
The Ram-Yip formula for Macdonald polynomials (at t=0) provides a statistic which we call charge. In types A and C it can be defined on tensor products of Kashiwara-Nakashima single column crystals. In this paper we prove that the charge is…
We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…
We use Kashiwara-Nakashima's combinatorics of crystal graphs associated to the roots sytems $B_{n}$ and $D_{n}$ to extend the results of \QCITE{cite}{}{lec3} and \QCITE{cite}{}{Mor} by showing that Morris type recurrence formulas also exist…
A reconstruction problem of words from scattered factors asks for the minimal information, like multisets of scattered factors of a given length or the number of occurrences of scattered factors from a given set, necessary to uniquely…
Answering a question of Kuniba, Misra, Okado, Takagi, and Uchiyama, it is shown that certain Demazure characters of affine type A, coincide with the graded characters of coordinate rings of closures of conjugacy classes of nilpotent…
Let U be the quantum group associated to a Lie algebra g of rank n. The negative part U^- of U has a canonical basis B with favourable properties, introduced by Kashiwara and Lusztig. The approaches of Kashiwara and Lusztig lead to a set of…
We study the polytope model for the affine type $A$ Kirillov-Reshetikhin crystals and prove that the action of the affine Kashiwara operators can be described in a remarkable simple way. Moreover, we investigate the combinatorial $R$-matrix…
We investigate recent claims concerning a new class of cosmic string solutions in the Weinberg-Salam model. They have the general form of previously discussed semi-local and electroweak strings, but are modified by the presence of a…
We consider the problem of binary string reconstruction from the multiset of its substring compositions, i.e., referred to as the substring composition multiset, first introduced and studied by Acharya et al. We introduce a new algorithm…
Motivated by studies of data retrieval in polymer-based storage systems, we consider the problem of reconstructing a multiset of binary strings that have the same length and the same weight from the compositions of their prefixes and…
We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…
We present a combinatorial model, called \emph{perforated tableaux}, to study $A_{n-1}$ crystals, unifying several previously studied combinatorial models. We identify nodes in the $k$-fold tensor product of the standard crystal with length…
We present a functional programming language for specifying constraints over tree-shaped data. The language allows for Haskell-like algebraic data types and pattern matching. Our constraint compiler CO4 translates these programs into…
The tableau model for Kirillov-Reshetikhin (KR) crystals, which are finite dimensional crystals corresponding to certain affine Lie algebras, is commonly used for its ease of crystal operator calculations. However, its simplicity makes…