Related papers: Polylogarithmic functions with prescribed branchin…
Polylogarithmic functions (polylogs) in $n$ variables can be viewed as elements of $(U\mathfrak{p}_{m})^*$, the dual of the universal enveloping algebra of the Lie algebra $\mathfrak{p}_{m}$ of infinitesimal spherical pure braids with…
In this paper we develop an algorithm for obtaining some new linear relations among the Lauricella $F_D$ functions. Relations we obtain, generalize those hinted in the work of B. C. Carlson. The coefficients of these relations are contained…
We show that the function Li_s(e^x) extends to an entire function of the complex variable s, taking values in tempered distributions in x on the whole real line. That the classical polylogarithm extends similarly, as an entire function…
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…
We consider composition orderings for linear functions of one variable. Given $n$ linear functions $f_1,\dots,f_n$ and a constant $c$, the objective is to find a permutation $\sigma$ that minimizes/maximizes $f_{\sigma(n)}\circ\dots\circ…
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…
We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…
By using Cauchy integral formula in the theory of complex functions, the authors establish some integral representations for the principal branches of several complex functions involving the logarithmic function, find some properties, such…
In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time…
In this paper we introduce the new notion of complex isoparametric functions on Riemannian manifolds. These are then employed to devise a general method for constructing proper $p$-harmonic functions. We then apply this to construct the…
The paper revisits the robust $s$-$t$ path problem, one of the most fundamental problems in robust optimization. In the problem, we are given a directed graph with $n$ vertices and $k$ distinct cost functions (scenarios) defined over edges,…
We consider the locus of irreducible nonsingular rational curves of degree d Pn, n>2, meeting a generic collection of linear subspaces. When this locus is 0 (resp 1)- dimensional, we compute (recursively) its degree (resp. geometric genus).…
The RPC calculus is a simple semantic foundation for multi-tier programming languages such as Links in which located functions can be written for the client-server model. Subsequently, the typed RPC calculus is designed to capture the…
In this paper, we establish a complete Liouville--type hierarchy for polyharmonic functions on Riemannian manifolds with nonnegative Ricci curvature. Extending Yau's classical result for harmonic functions and our recent biharmonic…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
Boolean functions can be represented in many ways including logical forms, truth tables, and polynomials. Additionally, Boolean functions have different canonical representations such as minimal disjunctive normal forms. Other canonical…
We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…
We obtain some Liouville type theorems for positive harmonic functions on compact Riemannian manifolds with nonnegative Ricci curvature and strictly convex boundary and partially verifies Wang's conjecture (J. Geom. Anal. 31 (2021)). For…
We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical optimisation problems. Our condition is based on the notion of biased graphs known from matroid theory.…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…