Related papers: Generalized Polylogarithms in Maple
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications in algebraic geometry and beyond. We have previously reported on an implementation of CAD in Maple which offers…
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…
Based on Colombeau's theory of algebras of generalized functions we introduce the concepts of generalized functions taking values in differentiable manifolds as well as of generalized vector bundle homomorphisms. We study their basic…
We develop a practical method for computing local zeta functions of groups, algebras, and modules in fortunate cases. Using our method, we obtain a complete classification of generic local representation zeta functions associated with…
Colored multiple zeta values are special values of multiple polylogarithms evaluated at Nth roots of unity. In this paper, we define both the finite and the symmetrized versions of these values and show that they both satisfy the double…
In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
In this article, we introduce the simplicial $d$-polytopic numbers defined on generalized Fibonacci polynomials. We establish basic identities and find $q$-identities known. Furthermore, we find generating functions for the simplicial…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
In this paper, we study the multiple $L$-values and the multiple zeta values of level $N$. We set up the algebraic framework for the double shuffle relations of the multiple zeta values of level $N$. Using the regularized double shuffle…
We review recent developments in the study of multiple polylogarithms, including the Hopf algebra of the multiple polylogarithms and the symbol map, as well as the construction of single valued multiple polylogarithms and discuss an…
The aim of this paper is to describe explicitly the poles of the meromorphic continuation of the Igusa local zeta function associated to several polynomials. Using resolution of singularities is possible to express the Igusa's local zeta…
We present explicit expressions for multi-fold logarithmic integrals that are equivalent to sums over polygamma functions at integer argument. Such relations find application in perturbative quantum field theory, quantum chemistry, analytic…
On the basis of the generalized argument principle, here we develop a numerical scheme for locating zeros and poles of a meromorphic function. A subdivision-transformation-calculation scheme is proposed to ensure the algorithm stability. A…
Mahler equations relate evaluations of the same function $f$ at iterated $b$th powers of the variable. They arise in particular in the study of automatic sequences and in the complexity analysis of divide-and-conquer algorithms. Recently,…
The multiresolution analysis of Alpert is considered. Explicit formulas for the entries in the matrix coefficients of the refinement equation are given in terms of hypergeometric functions. These entries are shown to solve generalized…
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…
In this paper we present some new identities for multiple polylogarithms (abbr. MPLs) and multiple harmonic star sums (abbr. MHSSs) by using the methods of iterated integral computations of logarithm functions. Then, by applying these…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…