Related papers: Clean Single-Valued Polylogarithms
We consider quasi-polynomial spaces of differential forms defined as weighted (with a positive weight) spaces of differential forms with polynomial coefficients. We show that the unisolvent set of functionals for such spaces on a simplex in…
We present a new Fortran library to evaluate all harmonic polylogarithms up to weight four numerically for any complex argument. The algorithm is based on a reduction of harmonic polylogarithms up to weight four to a minimal set of basis…
The present author recently proposed and proved a relationship theorem between nonlinear polynomial equations and the corresponding Jacobian matrix. By using this theorem, this paper derives a Newton iterative formula without requiring the…
We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…
We study a single-valued integration pairing between differential forms and dual differential forms which subsumes some classical constructions in mathematics and physics. It can be interpreted as a $p$-adic period pairing at the infinite…
Let $s_0,s_1,s_2,\ldots$ be a sequence of rational numbers whose $m$th divided difference is integer-valued. We prove that $s_n$ is a polynomial function in $n$ if $s_n \ll \theta^n$ for some positive number $\theta$ satisfying $\theta <…
Consider the algebra Q<<x_1,x_2,...>> of formal power series in countably many noncommuting variables over the rationals. The subalgebra Pi(x_1,x_2,...) of symmetric functions in noncommuting variables consists of all elements invariant…
In this paper we study some fundamental algebraic properties of slice functions and slice regular functions over an alternative $^*$-algebra $A$ over $\mathbb{R}$. These recently introduced function theories generalize to higher dimensions…
In this paper, we propose a new method for evaluating scalar one-loop Feynman integrals in generalized D-dimension. The calculations play an important building block for two-loop and higher-loop corrections to the processes at future…
We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…
Let $\cp:=(P_1,...,P_s)$ be a given family of $n$-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by $d$ and $h$, respectively. Suppose furthermore that for…
We consider a certain definite integral involving the product of two classical hypergeometric functions having complicated arguments. We show in this paper the surprising fact that this integral does not depend on the parameters of the…
We construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…
A new type of combinations of Bernstein operators is given in [1]. Here, we introduce another one, which can be used to approximate the functions with singularities. The direct and inverse results of the weighted approximation of this new…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
We associate a weight function to pairs consisting of a smooth and proper variety X over a complete discretely valued field and a differential form on X of maximal degree. This weight function is a real-valued function on the…
We present a simple geometric construction for smoothing polyhedral utility functions. Keywords: Afriat- Varian theorem, the utility function, the economic indices theory, convex analysis.
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
We evaluate multiple polylogarithm values at sixth roots of unity up to weight six, i.e. of the form $G(a_1,\ldots,a_w;1)$ where the indices $a_i$ are equal to zero or a sixth root of unity, with $a_1\neq 1$. For $w\leq 6$, we present bases…