Related papers: A Path Algorithm for Affine Kazhdan-Lusztig Polyno…
This paper has two main purposes. Firstly we generalise Ram's explicit construction of calibrated representations of the affine Hecke algebra to the multi-parameter case (including the non-reduced $BC_n$ case). We then derive the Plancherel…
The paper contains a generalization of known properties of Chebyshev polynomials of the second kind in one variable to polynomials of $n$ variables based on the root lattices of compact simple Lie groups $G$ of any type and of rank $n$. The…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
The Key map is an important tool in the determination of the Demazure crystals associated to Kac-Moody algebras. In finite type A, it can be computed in the tableau realization of crystals by a simple combinatorial procedure due to Lascoux…
This paper describes a fast algorithm for transforming Legendre coefficients into Chebyshev coefficients, and vice versa. The algorithm is based on the fast multipole method and is similar to the approach described by Alpert and Rokhlin…
We use Kazhdan-Lusztig tensoring to, first, describe annihilating ideals of highest weight modules over an affine Lie algebra in terms of the corresponding VOA and, second, to classify tilting functors, an affine analogue of projective…
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…
We give a detailed description of the torsors that correspond to multiloop algebras. These algebras are twisted forms of simple Lie algebras extended over Laurent polynomial rings. They play a crucial role in the construction of Extended…
We present in this paper first-order alternating linearization algorithms based on an alternating direction augmented Lagrangian approach for minimizing the sum of two convex functions. Our basic methods require at most $O(1/\epsilon)$…
We give a brief introduction to Hamiltonian optics and Lie algebraic methods. We use these methods to describe the operators governing light propagation, refraction and reflection in phase space. The method offers a systematic way to find…
We propose a new adaptive algorithm for the approximation of the Landau-Lifshitz-Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically,…
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…
We study and give a complete classification of good $\ZZ$-gradings of all simple finite-dimensional Lie algebras. This problem arose in the quantum Hamiltonian reduction for affine Lie algebras.
Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently and well before convergence has been achieved. These algorithms are typically based on recurrence relations which involve formal orthogonal…
There are several researches on Lie algebras and Lie superalgebras graded by finite root systems. In this paper, we study Leibniz algebras graded by finite root systems and obtain some results in simply-laced cases.
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities over the reals, and computing affine spans and convex hulls. As…
In this paper we present Affine.m - program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. Algorithms are based upon the properties of weights and Weyl symmetry.…
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…
Associated to the classical Weyl groups, we introduce the notion of degenerate spin affine Hecke algebras and affine Hecke-Clifford algebras. For these algebras, we establish the PBW properties, formulate the intertwiners, and describe the…