scholarly journals A Closed Character Formula for Symmetric Powers of Irreducible Representations

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Stavros Kousidis

International audience We prove a closed character formula for the symmetric powers $S^N V(λ )$ of a fixed irreducible representation $V(λ )$ of a complex semi-simple Lie algebra $\mathfrak{g}$ by means of partial fraction decomposition. The formula involves rational functions in rank of $\mathfrak{g}$ many variables which are easier to determine than the weight multiplicities of $S^N V(λ )$ themselves. We compute those rational functions in some interesting cases. Furthermore, we introduce a residue-type generating function for the weight multiplicities of $S^N V(λ )$ and explain the connections between our character formula, vector partition functions and iterated partial fraction decomposition. Nous établissons une formule fermée pour le caractère de la puissance symétrique $S^N V(λ )$ d'une représentation irréductible $V(λ )$ d'une algèbre de Lie semi-simple complexe$\mathfrak{g}$, en utilisant des décompositions en fractions partielles. Cette formule exprime ce caractère en termes de fractions rationnelles en $r$ variables, où $r$ est le rang de $\mathfrak{g}$. Ces fractions sont plus faciles à déterminer que les multiplicités de la décomposition de $S^N V(λ )$ elles-mêmes. Nous calculons ces fonctions rationnelles dans quelques cas intéressants. Nous introduisons par ailleurs une fonction génératrice de type résidu pour les multiplicités de $S^N V(λ )$ et relions notre formule aux fonctions de partitions vectorielles et aux décompositions itérées en fractions partielles.

Author(s):  
Kwang Hyun Kim ◽  
Xin Zhang

The partial fraction decomposition technique is very useful in many areas including mathematics and engineering. In this paper we present a new and simple method on the partial fraction decomposition of proper rational functions which have completely factored denominators over R or C. The method is based on a recursive computation of the h-adic polynomial in commutative algebra which is a generalization of the Taylor polynomial. Since its computation requires only simple algebraic operations, it does not require a computer algebra system to be programmed.


10.37236/1811 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Guoce Xin

This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immediately from its partial fraction decomposition. We combine the theory of iterated Laurent series and a new algorithm for partial fraction decompositions to obtain a fast algorithm for MacMahon's Omega calculus, which (partially) avoids the "run-time explosion" problem when eliminating several variables. We discuss the efficiency of our algorithm by investigating problems studied by Andrews and his coauthors; our running time is much less than that of their Omega package.


1987 ◽  
Vol 107 ◽  
pp. 63-68 ◽  
Author(s):  
George Kempf

Let H be the Levi subgroup of a parabolic subgroup of a split reductive group G. In characteristic zero, an irreducible representation V of G decomposes when restricted to H into a sum V = ⊕mαWα where the Wα’s are distinct irreducible representations of H. We will give a formula for the multiplicities mα. When H is the maximal torus, this formula is Weyl’s character formula. In theory one may deduce the general formula from Weyl’s result but I do not know how to do this.


2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Bakul Agarwal ◽  
Federico Buccioni ◽  
Andreas von Manteuffel ◽  
Lorenzo Tancredi

Abstract We present the leading colour and light fermionic planar two-loop corrections for the production of two photons and a jet in the quark-antiquark and quark-gluon channels. In particular, we compute the interference of the two-loop amplitudes with the corresponding tree level ones, summed over colours and polarisations. Our calculation uses the latest advancements in the algorithms for integration-by-parts reduction and multivariate partial fraction decomposition to produce compact and easy-to-use results. We have implemented our results in an efficient C++ numerical code. We also provide their analytic expressions in Mathematica format.


2021 ◽  
Vol 25 (21) ◽  
pp. 606-643
Author(s):  
Yury Neretin

We classify irreducible unitary representations of the group of all infinite matrices over a p p -adic field ( p ≠ 2 p\ne 2 ) with integer elements equipped with a natural topology. Any irreducible representation passes through a group G L GL of infinite matrices over a residue ring modulo p k p^k . Irreducible representations of the latter group are induced from finite-dimensional representations of certain open subgroups.


2013 ◽  
Vol Vol. 15 no. 2 (Combinatorics) ◽  
Author(s):  
Adrien Boussicault

Combinatorics International audience We consider the family of rational functions ψw= ∏( xwi - xwi+1 )-1 indexed by words with no repetition. We study the combinatorics of the sums ΨP of the functions ψw when w describes the linear extensions of a given poset P. In particular, we point out the connexions between some transformations on posets and elementary operations on the fraction ΨP. We prove that the denominator of ΨP has a closed expression in terms of the Hasse diagram of P, and we compute its numerator in some special cases. We show that the computation of ΨP can be reduced to the case of bipartite posets. Finally, we compute the numerators associated to some special bipartite graphs as Schubert polynomials.


Sign in / Sign up

Export Citation Format

Share Document