ترغب بنشر مسار تعليمي؟ اضغط هنا

On Combinatorial Models for Affine Crystals

368   0   0.0 ( 0 )
 نشر من قبل Adam Schultze
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We biject two combinatorial models for tensor products of (single-column) Kirillov-Reshetikhin crystals of any classical type $A-D$: the quantum alcove model and the tableau model. This allows us to translate calculations in the former model (of the energy function, the combinatorial $R$-matrix, etc.) to the latter, which is simpler.

قيم البحث

اقرأ أيضاً

162 - Seung Jin Lee 2015
We construct the affine version of the Fomin-Kirillov algebra, called the affine FK algebra, to investigate the combinatorics of affine Schubert calculus for type $A$. We introduce Murnaghan-Nakayama elements and Dunkl elements in the affine FK algeb ra. We show that they are commutative as Bruhat operators, and the commutative algebra generated by these operators is isomorphic to the cohomology of the affine flag variety. We show that the cohomology of the affine flag variety is product of the cohomology of an affine Grassmannian and a flag variety, which are generated by MN elements and Dunkl elements respectively. The Schubert classes in cohomology of the affine Grassmannian (resp. the flag variety) can be identified with affine Schur functions (resp. Schubert polynomials) in a quotient of the polynomial ring. Affine Schubert polynomials, polynomial representatives of the Schubert class in the cohomology of the affine flag variety, can be defined in the product of two quotient rings using the Bernstein-Gelfand-Gelfand operators interpreted as divided difference operators acting on the affine Fomin-Kirillov algebra. As for other applications, we obtain Murnaghan-Nakayama rules both for the affine Schubert polynomials and affine Stanley symmetric functions. We also define $k$-strong-ribbon tableaux from Murnaghan-Nakayama elements to provide a new formula of $k$-Schur functions. This formula gives the character table of the representation of the symmetric group whose Frobenius characteristic image is the $k$-Schur function.
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial structure s and the reduction to normal form of operator polynomials in such an algebra. The connection is achieved through suitable labelled graphs, or diagrams, that are composed of elementary gates. In this way, many normal form evaluations can be systematically obtained, thanks to models that involve set partitions, permutations, increasing trees, as well as weighted lattice paths. Extensions to q-analogues, multivariate frameworks, and urn models are also briefly discussed.
We show that a tensor product of nonexceptional type Kirillov--Reshetikhin (KR) crystals is isomorphic to a direct sum of Demazure crystals; we do this in the mixed level case and without the perfectness assumption, thus generalizing a result of Naoi . We use this result to show that, given two tensor products of such KR crystals with the same maximal weight, after removing certain $0$-arrows, the two connected components containing the minimal/maximal elements are isomorphic. Based on the latter fact, we reduce a tensor product of higher level perfect KR crystals to one of single-column KR crystals, which allows us to use the uniform models available in the literature in the latter case. We also use our results to give a combinatorial interpretation of the Q-system relations. Our results are conjectured to extend to the exceptional types.
Let $Q_{n,d}$ denote the random combinatorial matrix whose rows are independent of one another and such that each row is sampled uniformly at random from the subset of vectors in ${0,1}^n$ having precisely $d$ entries equal to $1$. We present a short proof of the fact that $Pr[det(Q_{n,d})=0] = Oleft(frac{n^{1/2}log^{3/2} n}{d}right)=o(1)$, whenever $d=omega(n^{1/2}log^{3/2} n)$. In particular, our proof accommodates sparse random combinatorial matrices in the sense that $d = o(n)$ is allowed. We also consider the singularity of deterministic integer matrices $A$ randomly perturbed by a sparse combinatorial matrix. In particular, we prove that $Pr[det(A+Q_{n,d})=0]=Oleft(frac{n^{1/2}log^{3/2} n}{d}right)$, again, whenever $d=omega(n^{1/2}log^{3/2} n)$ and $A$ has the property that $(1,-d)$ is not an eigenpair of $A$.
A di-sk tree is a rooted binary tree whose nodes are labeled by $oplus$ or $ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial bijection on di -sk trees proving the two quintuples $(LMAX,LMIN,DESB,iar,comp)$ and $(LMAX,LMIN,DESB,comp,iar)$ have the same distribution over separable permutations. Here for a permutation $pi$, $LMAX(pi)/LMIN(pi)$ is the set of values of the left-to-right maxima/minima of $pi$ and $DESB(pi)$ is the set of descent bottoms of $pi$, while $comp(pi)$ and $iar(pi)$ are respectively the number of components of $pi$ and the length of initial ascending run of $pi$. Interestingly, our bijection specializes to a bijection on $312$-avoiding permutations, which provides (up to the classical {em Knuth--Richards bijection}) an alternative approach to a result of Rubey (2016) that asserts the two triples $(LMAX,iar,comp)$ and $(LMAX,comp,iar)$ are equidistributed on $321$-avoiding permutations. Rubeys result is a symmetric extension of an equidistribution due to Adin--Bagno--Roichman, which implies the class of $321$-avoiding permutations with a prescribed number of components is Schur positive. Some equidistribution results for various statistics concerning tree traversal are presented in the end.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا