Related papers: An algorithm for computing root multiplicities in …
The role of Kac-Moody algebras in exploiting symmetries of particle physics and string theory is described.
That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…
The weight multiplicities of finite dimensional simple Lie algebras can be computed individually using various methods. Still, it is hard to derive explicit closed formulas. Similarly, explicit closed formulas for the multiplicities of…
This paper deals with the problem of conjugacy of Cartan subalgebras for affine Kac-Moody Lie algebras. Unlike the methods used by Peterson and Kac, our approach is entirely cohomological and geometric. It is deeply rooted on the theory of…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
This paper gives the additivity and reduction formulas for mixed multiplicities of multi-graded modules $M$ and mixed multiplicities of arbitrary ideals, and establishes the recursion formulas for the sum of all the mixed multiplicities of…
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
Littlewood-Richardson, Kronecker and plethysm coefficients are fundamental multiplicities of interest in Representation Theory and Algebraic Combinatorics. Determining a combinatorial interpretation for the Kronecker and plethysm…
We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…
We propose a novel way to define imaginary root subgroups associated with (timelike) imaginary roots of hyperbolic Kac-Moody algebras. Using in an essential way the theory of unitary irreducible representation of covers of the group…
We describe several algorithms for computing $e$-th roots of elements in a number field $K$, where $e$ is an odd prime-power integer. In particular we generalize Couveignes' and Thom\'e's algorithms originally designed to compute…
We define the formal affine Demazure algebra and formal affine Hecke algebra associated to a Kac-Moody root system. We prove the structure theorems of these algebras, hence, extending several result and construction (presentation in terms…
A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…
The derived algebra of a symmetrizible Kac-Moody algebra $\lie g$ is generated (as a Lie algebra) by its root spaces corresponding to real roots. In this paper, we address the natural reverse question: given any subset of real root vectors,…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
We investigate a class of Kac-Moody algebras previously not considered. We refer to them as n-extended Lorentzian Kac-Moody algebras defined by their Dynkin diagrams through the connection of an $A_n$ Dynkin diagram to the node…