相关论文: A Path Algorithm for Affine Kazhdan-Lusztig Polyno…

An algorithm for embedding finite dimensional Lie algebras into Lie algebras of vector fields (and Lie superalgebras into Lie superalgebras of vector fields) is offered in a way applicable over ground fields of any characteristic. The…

Affine Lusztig varieties encode the orbital integrals of Iwahori--Hecke functions and serve as building blocks for the (conjectural) theory of affine character sheaves. We establish a close relationship between affine Lusztig varieties and…

We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…

The Z-grading determined by a long simple root of an affine or finite type Lie algebra arises from an adjoint or cominuscule representation of a lower rank semi-simple complex Lie algebra. Analysis of the relationship between the grading…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

We introduce deformations of Kazhdan-Lusztig elements and specialised nonsymmetric Macdonald polynomials, both of which form a distinguished basis of the polynomial representation of a maximal parabolic subalgebra of the Hecke algebra. We…

In the article we develop Euler-Lagrange method and calculate all the roots of an arbitrary complex polynomial $P(z)$ on the base of calculation (similar to the Bernoulli-Aitken-Nikiporets methods) of the limits of ratios of Hadamard…

Locally affine Lie algebras are generalizations of affine Kac--Moody algebras with Cartan subalgebras of infinite rank whose root system is locally affine. In this note we study a class of representations of locally affine algebras…

We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature…

Casimir invariants for quantized affine Lie algebras are constructed and their eigenvalues computed in any irreducible highest weight representation.

We give a purely combinatorial algorithm for the computation of the decomposition matrices for Ariki-Koike algebras when the parameters are powers of the same root of unity. It generalizes the LLT algorithm.

We prove that certain parabolic Kazhdan-Lusztig polynomials calculate the graded decomposition matrices of v-Schur algebras given by the Jantzen filtration of Weyl modules, confirming a conjecture of Leclerc and Thibon.

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied to face lattices of polyhedra and to various generalizations…

We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the…

In this paper, we propose a carefully optimized "half-gcd" algorithm for polynomials. We achieve a constant speed-up with respect to previous work for the asymptotic time complexity. We also discuss special optimizations that are possible…

We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…

In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.

In this paper we classify and give Kazhdan-Lusztig type character formulas for equivariantly irreducible representations of Lie algebras of reductive algebraic groups over a field of large positive characteristic. The equivariance is with…

We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…