Related papers: Demazure Formulas for Weight Polytopes

We study the structure of the finite-dimensional representations of $\mathfrak{sl}_2[t]$, the current Lie algebra type of $A_1$, which are obtained by taking tensor products of special Demazure modules. We show that these representations…

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of…

We show how to compute the Ehrhart polynomial of the free sum of two lattice polytopes containing the origin $P$ and $Q$ in terms of the enumerative combinatorics of $P$ and $Q$. This generalizes work of Beck, Jayawant, McAllister, and…

We use statistical mechanics -- variants of the six-vertex model in the plane studied by means of the Yang-Baxter equation -- to give new deformations of Weyl's character formula for classical groups of Cartan type B, C, and D, and a…

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 study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…

We establish the existence of Demazure flags for graded local Weyl modules for hyper current algebras in positive characteristic. If the underlying simple Lie algebra is simply laced, the flag has length one, i.e., the graded local Weyl…

The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…

Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. We…

In our previous paper math.QA/0409261, we defined a deformation of the group algebra of the group of even elements of a Coxeter group W, and showed that it is flat for all values of parameters if and only if all the rank 3 parabolic…

We propose a regular way to construct lattice versions of $W$-algebras, both for quantum and classical cases. In the classical case we write the algebra explicitly and derive the lattice analogue of Boussinesq equation from the Hamiltonian…

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…

A classical result of Dirichlet shows that certain elementary character sums compute class numbers of quadratic imaginary number fields. We obtain analogous relations between class numbers and a weighted character sum associated to a…

The Weyl-Kac character formula gives a beautiful closed-form expression for the characters of integrable highest-weight modules of Kac-Moody algebras. It is not, however, a formula that is combinatorial in nature, obscuring positivity. In…

An algorithm to compute a good basis of the Brieskorn lattice of a cohomologically tame polynomial is described. This algorithm is based on the results of C. Sabbah and generalizes the algorithm by A. Douai for convenient Newton…

We construct and study SUSY lattice vertex algebras. As a simple example, we obtain the simple vertex algebra associated to the vertex algebra $V_c(N3)$ of central charge $c=3/2$, as the SUSY lattice vertex algebra associated to…

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear…