Related papers: A Path Algorithm for Affine Kazhdan-Lusztig Polyno…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
In this paper we give a geometric construction of Cherednik's double affine Hecke algebra. We construct the algebra as the equivariant $K$-theory of the Lagrangian subvariety of the cotangent variety of the square of the flag variety of…
Let $\textbf{U}^+$ be the positive part of the quantum group $\textbf{U}$ associated with a generalized Cartan matrix. In the case of finite type, Lusztig constructed the canonical basis $\textbf{B}$ of $\textbf{U}^+$ via two approaches.…
We show that the Littlewood-Richardson coefficients are values at 1 of certain parabolic Kazhdan-Lusztig polynomials for affine symmetric groups. These q-analogues of Littlewood-Richardson multiplicities coincide with those previously…
The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…
We shall derive Kazhdan-Lusztig type character formula for the irreducible modules with arbitrary non-critical highest weights over affine Lie algebras from the rational case by using the translation functor, the Enright functor and…
We develop general results on centroids of Lie algebras and apply them to determine the centroid of extended affine Lie algebras, loop-like and Kac-Moody Lie algebras, and Lie algebras graded by finite root systems.
For any quantum group of finite ADE type, we prove a new formula for the standard bilinear form evaluated at monomials. Combining this with ideas from the Lusztig-Shoji algorithm, we obtain a new algorithm that computes the canonical basis.…
In 1980, Lusztig introduced the periodic Kazhdan-Lusztig polynomials, which are conjectured to have important information about the characters of irreducible modules of a reductive group over a field of positive characteristic, and also…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
We define and study cyclotomic quotients of affine Hecke algebras of type B. We establish an isomorphism between direct sums of blocks of these algebras and a generalisation, for type B, of cyclotomic quiver Hecke algebras which are a…
We construct a new family of irreducible modules over any basic classical affine Kac-Moody Lie superalgebra which are induced from modules over the Heisenberg subalgebra. We also obtain irreducible deformations of these modules for the…
In this paper we show that the lowest two-sided ideal of an affine Hecke algebra is affine cellular for all choices of parameters. We explicitely describe the cellular basis and we show that the basis elements have a nice decomposition when…
In this article we will be dedicated some algorithms of addition, subtraction, multiplication and division of two positive integers using Zeckendorf form. Such results find application in coding theory.
Geiss, Leclerc and Schr\"oer introduced a class of 1-Iwanaga-Gorenstein algebras $H$ associated to symmetrizable Cartan matrices with acyclic orientations, generalizing the path algebras of acyclic quivers. They also proved that…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…
This paper presents a systematic methodology based on the algebraic theory of signal processing to classify and derive fast algorithms for linear transforms. Instead of manipulating the entries of transform matrices, our approach derives…
A method of computing fusion coefficients for Lie algebras of type $A_{n-1}$ on level $k$ was recently developed by A. Feingold and M. Weiner \cite{FW} using orbits of $\mathbb{Z}_n^k$ under the permutation action of $S_k$ on $k$-tuples.…
We investigate the structure of Kazhdan-Lusztig polynomials of the symmetric group by leveraging computational approaches from big data, including exploratory and topological data analysis, applied to the polynomials for symmetric groups of…