Related papers: A Path Algorithm for Affine Kazhdan-Lusztig Polyno…
Invariant affine reflection algebras are the last and the most general known extension of affine Kac-Moody Lie algebras, introduced in recent years. We develop a method known as "affinization" to the class of invariant affine reflection…
We propose a combinatorial interpretation of the coefficient of $q$ in Kazhdan- Lusztig polynomials and we prove it for finite simply-laced Weyl groups.
This paper provides a realization of all classical and most exceptional finite groups of Lie type as Galois groups over function fields over F_q and derives explicit additive polynomials for the extensions. Our unified approach is based on…
A general procedure of affinization of linear algebra structures is illustrated by the case of Leibniz algebras. Specifically, the definition of an affine Leibniz bracket, that is, a bi-affine operation on an affine space that at each…
We establish ring isomorphisms between quantum Grothendieck rings of certain remarkable monoidal categories of finite-dimensional representations of quantum affine algebras of types $A_{2n-1}^{(1)}$ and $B_n^{(1)}$. Our proof relies in part…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
We refine an idea of Deodhar, whose goal is a counting formula for Kazhdan-Lusztig polynomials. This is a consequence of a simple observation that one can use the solution of Soergel's conjecture to make ambiguities involved in defining…
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…
We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.
We compare the canonical basis for a generalized Temperley-Lieb algebra of type A or B with the Kazhdan-Lusztig basis for the corresponding Hecke algebra.
In this paper we show that the leading coefficient $\mu(y,w)$ of some Kazhdan-Lusztig polynomials $P_{y,w}$ with $y,w$ in an affine Weyl group of type $\tilde B_n$ (resp. $\tilde C_n$ or $\tilde D_n$) is $n$ (resp. $n+1$).
We introduce certain raising and lowering operators for Macdonald polynomials (of type $A_{n-1}$) by means of Dunkl operators. The raising operators we discuss are a natural $q$-analogue of raising operators for Jack polynomials introduced…
We use the Kazhdan-Lusztig tensoring to define affine translation functors, describe annihilating ideals of highest weight modules over an affine Lie algebra in terms of the corresponding VOA, and to sketch a functorial approach to ``affine…
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and…
A new purely algebraic algorithm is presented for computation of invariants (generalized Casimir operators) of Lie algebras. It uses the Cartan's method of moving frames and the knowledge of the group of inner automorphisms of each Lie…
We prove a tamely ramified version of the Kazhdan-Lusztig equivalence using factorization algebras. More precisely, we establish an equivalence between the DG category of Iwahori-integrable affine Lie algebra representations and the DG…
The purpose of this work is to provide a common combinatorial framework for some of the analogues and generalizations of Kazhdan-Lusztig R-polynomials that have appeared since the introduction of these remarkable polynomials (e.g.,…
We give a presentation of localized affine and degenerate affine Hecke algebras of arbitrary type in terms of weights of the polynomial subalgebra and varied Demazure-BGG type operators. We offer a definition of a graded algebra…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…