Related papers: A Path Algorithm for Affine Kazhdan-Lusztig Polyno…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
In this short note, we show that the Ginzburg-Vasserot map between the quantum affine algebra of type A_(n-1) and the equivariant K-theory group of the Steinberg Variety (of n-step flags in C^d) restricts and remains surjective at the level…
The study of affine Deligne-Lusztig varieties originally arose from arithmetic geometry, but many problems on affine Deligne-Lusztig varieties are purely Lie-theoretic in nature. This survey deals with recent progress on several important…
This paper investigates the Jordan--Kronecker invariant of finite dimensional complex Lie algebras. We present an explicit algorithm for determining the type of a given Lie algebra from its Jordan--Kronecker invariant. The algorithm is…
In this paper we prove the Kazhdan-Lusztig type character formula for irreducible highest weight modules with positive rational highest weights over symmetrizable Kac-Moody Lie algebras.
In this paper, we present an infinite dimensional associative diagram algebra that satisfies the relations of the generalized Temperley--Lieb algebra having a basis indexed by the fully commutative elements (in the sense of Stembridge) of…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We present algorithms used in the computational part of the article "Special homogeneous linear systems on Hirzebruch surfaces".
We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…
New geometric methods for fast evaluation of derivatives of polynomial and rational B\'{e}zier curves are proposed. They apply an algorithm for evaluating polynomial or rational B\'{e}zier curves, which was recently given by the authors.…
Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…
Hecke algebras are usually defined algebraically, via generators and relations. We give a new algebro-geometric construction of affine and double-affine Hecke algebras (the former is known as the Iwahori-Hecke algebra, and the latter was…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
We obtain explicit branching rules for graded cell modules and graded simple modules over the endomorphism algebra of a Bott-Samelson bimodule. These rules allow us to categorify a well-known recursive formula for Kazhdan-Lusztig…
For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail. There is also a natural…
We define and study cyclotomic quotients of affine Hecke algebras of type D. We establish an isomorphism between (direct sums of blocks of) these cyclotomic quotients and a generalisation of cyclotomic quiver Hecke algebras which are a…
We define the pattern fragment for higher-order unification problems in linear and affine type theory and give a deterministic unification algorithm that computes most general unifiers.
Frenkel-Reshetikhin introduced $q$-characters of finite dimensional representations of quantum affine algebras. We give a combinatorial algorithm to compute them for all simple modules. Our tool is $t$-analogue of the $q$-characters, which…
We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one…