Related papers: An algorithm for computing root multiplicities in …
We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…
In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction. Each multiplier…
In our quest for the design, the analysis and the implementation of a subdivision algorithm for finding the complex roots of univariate polynomials given by oracles for their evaluation, we present sub-algorithms allowing substantial…
Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…
We classify regular subalgebras of affine Kac-Moody algebras in terms of their root systems. In the process, we establish that a root system of a subalgebra is always an intersection of the root system of the algebra with a sublattice of…
String functions are important building blocks of characters of integrable highest modules over affine Kac--Moody algebras. Kac and Peterson computed string functions for affine Lie algebras of type $A_{1}^{(1)}$ in terms of Dedekind eta…
We prove that the multiplicity of an arbitrary dominant weight for an integrable highest weight representation of the affine Kac-Moody algebra $A_{r}^{(1)}$ is a polynomial in the rank $r$. In the process we show that the degree of this…
The conjugacy of split Cartan subalgebras in the finite dimensional simple case (Chevalley) and in the symmetrizable Kac-Moody case (Peterson-Kac) are fundamental results of the theory of Lie algebras. Among the Kac-Moody Lie algebras the…
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…
In this paper, we calculate the dimension of root spaces $\mathfrak{g}_{\lambda}$ of a special type rank $3$ Kac-Moody algebras $\mathfrak{g}$. We first introduce a special type of elements in $\mathfrak{g}$, which we call elements in…
We introduce an affinization of the quantum Kac-Moody algebra associated to a symmetric generalized Cartan matrix. Based on the affinization, we construct a representation of the quantum Kac-Moody algebra by vertex operators from bosonic…
Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives. This small augmentation confers upon them better local decoding,…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…