相关论文: Approximations to -, di- and tri- logarithms

We provide lower bounds for p-adic valuations of multisums of factorial ratios which satisfy an Ap\'ery-like recurrence relation: these include Ap\'ery, Domb, Franel numbers, the numbers of abelian squares over a finite alphabet, and…

Matrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited-memory methods for the approximation of the action of…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

We give direct and inverse theorems for the weighted approximation of functions with inner singularities by combinations of Bernstein polynomials.

The two-dimensional harmonic polylogarithms $\G(\vec{a}(z);y)$, a generalization of the harmonic polylogarithms, themselves a generalization of Nielsen's polylogarithms, appear in analytic calculations of multi-loop radiative corrections in…

We introduce a new class of division algebras, the hyperpolyadic algebras, which correspond to the binary division algebras $\mathbb{R}$, $\mathbb{C}$, $\mathbb{H}$, $\mathbb{O}$ without considering new elements. First, we use the matrix…

We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…

Relations among integrals of logarithms, polylogarithms and Euler sums are presented. A unifying element being the introduction of Nielsen's generalized polylogarithms.

This is a short exposition--mostly by way of the toy models ``double logarithm'' and ``triple logarithm''--which should serve as an introduction to a forthcoming article in which we establish a connection between multiple polylogarithms,…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…

Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…

We set the scene with known values and functional relations for dilogarithms, trilogarithms and polylogarithms of various orders, along with more recent Euler sum values and multidimensional computations paying homage to the three late…

Hypergeometric function method is proposed to calculate the scalar integrals of Feynman diagrams. For the scalar integral of three-loop vacuum diagram with four-propagator, we verify the equivalency of Feynman parametrization and the…

We present a polylogarithmic local computation matching algorithm which guarantees a $(1-\eps)$-approximation to the maximum matching in graphs of bounded degree.

Let F be a holomorphic map whose components satisfy some polynomial relations. We present an algorithm for constructing Nash maps locally approximating F, whose components satisfy the same relations.

We introduce an ${\rm S}_d$-analogue of the hypergeometric Bernoulli polynomials and study their properties. To achieve this goal, we introduce a calculus defined on the simplicial $d$-polytopic numbers. Two definitions of the ${\rm…

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

For a general number $p\geq 2$ of measures, we provide explicit expressions for the Jacobi-Pi\~neiro and Laguerre of the first kind multiple orthogonal polynomials of type I, presented in terms of multiple hypergeometric functions.

We give new explicit formulas for Grassmannian and Aomoto polylogarithms in terms of iterated integrals, for arbitrary weight. We also explicitly reduce the Grassmannian polylogarithm in weight 4 and in weight 5 each to depth 2.…