相关论文: Multiplicities and tensor product coefficients for…
We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…
The multiplicity of a weight $\mu$ in an irreducible representation of a simple Lie algebra $\mathfrak{g}$ with highest weight $\lambda$ can be computed via the use of Kostant's weight multiplicity formula. This formula is an alternating…
Starting from Jacobi-Trudi's type determinental expressions for the Schur functions corresponding to types $B,C$ and $D,$ we define a natural $q$-analogue of the multiplicity $[V(\lambda):M(\mu)]$ when $M(\mu)$ is a tensor product of row or…
We study the Kronecker coefficients $g_{\lambda, \mu, \nu}$ via a formula that was described by Mishna, Rosas, and Sundaram, in which the coefficients are expressed as a signed sum of vector partition function evaluations. In particular, we…
The multiplicity of a weight in a finite-dimensional irreducible representation of a simple Lie algebra g can be computed via Kostant's weight multiplicity formula. This formula consists of an alternating sum over the Weyl group (a finite…
In combinatorial representation theory, Kostant's weight multiplicity formula $m(\lambda,\mu)$ is a tool that provides a means of determining the multiplicity of a weight $\mu$ in the adjoint representation of a simple Lie algebra…
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…
Given a simple Lie algebra $\mathfrak{g}$, Kostant's weight $q$-multiplicity formula is an alternating sum over the Weyl group whose terms involve the $q$-analog of Kostant's partition function. For $\xi$ (a weight of $\mathfrak{g}$), the…
The multiplicities a_{lambda,mu} of simple modules L(mu) in the composition series of Kac modules V(lambda) for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In…
We derive a general result about commuting actions on certain objects in braided rigid monoidal categories. This enables us to define an action of the Brauer algebra on the tensor space $V^{\otimes k}$ which commutes with the action of the…
If $[\lambda(j)]$ is a multipartition of the positive integer $n$ (a sequence of partitions with total size $n$), and $\mu$ is a partition of $n$, we study the number $K_{[\lambda(j)]\mu}$ of sequences of semistandard Young tableaux of…
We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and…
We present a polynomiality property of the Littlewood-Richardson coefficients c_{\lambda\mu}^{\nu}. The coefficients are shown to be given by polynomials in \lambda, \mu and \nu on the cones of the chamber complex of a vector partition…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
Given dominant integral weights $\lambda, \mu, \nu$ of a finite-dimensional simple Lie algebra $\mathfrak{g}$ and an element $w$ of its Weyl group, the refined tensor product multiplicity $c_{\lambda \mu}^\nu(w)$ is the multiplicity of the…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
We present a program that allows for the computation of tensor products of irreducible representations of Lie algebras A-G based on the explicit construction of weight states. This straightforward approach (which is slower and more…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
Let $\mathfrak{g}$ be a semisimple Lie algebra over $\mathbb{C}$ having rank $l$ and let $V=L(\lambda)$ be an irreducible finite-dimensional $\mathfrak{g}$-module having highest weight $\lambda.$ Computations of weight multiplicities in…