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

We give some closed formulas for certain vectors of the canonical bases of the Fock space representation of U_v(sl^_n). As a result, a combinatorial description of certain parabolic Kazhdan-Lusztig polynomials for affine type A is obtained.

We construct a bijection from permutations to some weighted Motzkin paths known as Laguerre histories. As one application of our bijection, a neat $q$-$\gamma$-positivity expansion of the $(\inv,\exc)$-$q$-Eulerian polynomials is obtained.

Let W be a Coxeter group and L be a weight function on W. Following Lusztig, we have a corresponding decomposition of W into left cells, which have important applications in representation theory. We study the case where $W$ is an affine…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

This paper is concerned with one-dimensional sums in classical affine types. We prove a conjecture of the third author and Zabrocki by showing they all decompose in terms of one-dimensional sums related to affine type A provided the rank of…

The generalized Kazhdan-Lusztig polynomials for the finite dimensional irreducible representations of the general linear superalgebra are computed explicitly. Using the result we establish a one to one correspondence between the set of…

This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…

The charge is an intricate statistic on words, due to Lascoux and Schutzenberger, which gives positive combinatorial formulas for Lusztig's q-analogue of weight multiplicities and the energy function on affine crystals, both of type A. As…

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…

A method is suggested for obtaining the Plancherel measure for Affine Hecke Algebras as a limit of integral-type formulas for inner products in the polynomial and related modules of Double Affine Hecke Algebras. The analytic continuation…

To each category C of modules of finite length over a complex simple Lie algebra g, closed under tensoring with finite dimensional modules, we associate and study a category Aff(C)_\kappa of smooth modules (in the sense of Kazhdan and…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

We propose an accelerated meta-algorithm, which allows to obtain accelerated methods for convex unconstrained minimization in different settings. As an application of the general scheme we propose nearly optimal methods for minimizing…

Traditionally, there are several polynomial algorithms for linear programming including the ellipsoid method, the interior point method and other variants. Recently, Chubanov [Chubanov, 2015] proposed a projection and rescaling algorithm,…

Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.

We establish a formalism for working with incidence algebras of posets with symmetries, and we develop equivariant Kazhdan-Lusztig-Stanley theory within this formalism. This gives a new way of thinking about the equivariant Kazhdan-Lusztig…

We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…

In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…

Let $A$ be a Dedekind domain, $K$ the fraction field, $\p$ a non-zero prime ideal of $A$, and $K_\pp$ the completion of $K$ with respect to the $\p$-adic topology. At the input of a monic irreducible separable polynomial, $f(x)\in A[x]$,…

We prove that the combinatorial concept of a special matching can be used to compute the parabolic Kazhdan-Lusztig polynomials of doubly laced Coxeter groups and of dihedral Coxeter groups. In particular, for this class of groups which…