Related papers: A Path Algorithm for Affine Kazhdan-Lusztig Polyno…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

We study the Jacobi-Trudi-type determinant which is conjectured to be the q-character of a certain, in many cases irreducible, finite-dimensional representation of the quantum affine algebra of type C_n. Like the D_n case studied by the…

We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…

Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

We develop the Akhiezer iteration, a generalization of the classical Chebyshev iteration, for the inner product-free, iterative solution of indefinite linear systems using orthogonal polynomials for measures supported on multiple, disjoint…

We address two fundamental questions in the representation theory of affine Hecke algebras of classical types. One is an inductive algorithm to compute characters of tempered modules, and the other is the determination of the constants in…

Affine matrix-ball construction (abbreviated AMBC) was developed by Chmutov, Lewis, Pylyavskyy, and Yudovina as an affine generalization of Robinson-Schensted correspondence. We show that AMBC gives a simple way to compute a distinguished…

Kazhdan--Lusztig polynomials arise in the context of Hecke algebras associated to Coxeter groups. The computation of these polynomials is very difficult for examples of even moderate rank. In type $A$ it is known that the leading…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

We give an easy diagrammatical description of the parabolic Kazhdan-Lusztig polynomials for the Weyl group $W_n$ of type $D_n$ with parabolic subgroup of type $A_n$ and consequently an explicit counting formula for the dimension of the…

We report on recent work concerning a new type of generalised Kac-Moody algebras based on the spaces of differentiable mappings from compact manifolds or homogeneous spaces onto compact Lie groups.

Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…

We prove a bosonic formula for the generating function of level-restricted paths for the infinite families of affine Kac-Moody algebras. In affine type A this yields an expression for the level-restricted generalized Kostka polynomials.

We use Kazhdan-Lusztig bases of representations of the symmetric group to express Pfaffians with entries $(a_i-a_j) h_{i+j}$. In the case where the parameters $a_i$ are specialized to successive powers of $q$, and the $h_i$ are complete…

We describe new algorithms to compute Whitney stratifications of real algebraic varieties. Using either conormal or polar techniques, these algorithms stratify a complexification of a given real variety. We then show that the resulting…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

We develop a new way of writing the Lame Hamiltonian in Lie-algebraic form. This yields, in a natural way, an explicit formula for both the Lame polynomials and the classical non-meromorphic Lame functions in terms of Chebyshev polynomials…