Related papers: Approximations to -, di- and tri- logarithms
A hypercomplex manifold is a manifold equipped with a triple of complex structures $I, J, K$ satisfying the quaternionic relations. We define a quaternionic analogue of plurisubharmonic functions on hypercomplex manifolds, and interpret…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
An adaptive algorithm, based on residual type a posteriori indicators of errors measured in $L^{\infty}(L^2)$ and $L^2(L^2)$ norms, for a numerical scheme consisting of implicit Euler method in time and discontinuous Galerkin method in…
The satisfactory development of Quaternionic Analysis has indicated new solutions for physical and mathematical problems. It is worth mentioning the fact that quaternions possess four dimensions, and in this way they may be considered as…
Positive semidefinite programs are an important subclass of semidefinite programs in which all matrices involved in the specification of the problem are positive semidefinite and all scalars involved are non-negative. We present a parallel…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…
This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…
We review the hypergeometric function approach to Feynman diagrams. Special consideration is given to the construction of the Laurent expansion. As an illustration, we describe a collection of physically important one-loop vertex diagrams…
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
When studying boundary value problems for some partial differential equations arising in applied mathematics, we often have to study the solution of a system of partial differential equations satisfied by hypergeometric functions and find…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
The suitable basis functions for approximating periodic function are periodic, trigonometric functions. When the function is not periodic, a viable alternative is to consider polynomials as basis functions. In this paper we will point out…
Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…
In this work, generalized hypergeometric functions for bicomplex argument is introduced and its convergence criteria is derived. Furthermore, integral representation of this function has been established. Moreover, quadratic transformation,…
We present results on co-recursive associated Laguerre and Jacobi polynomials which are of interest for the solution of the Chapman-Kolmogorov equations of some birth and death processes with or without absorption. Explicit forms,…
This paper gives a rather arbitrary choice of formulas for ($q$-)hypergeometric orthogonal polynomials which the author missed while consulting Chapters 9 and 14 in the book "Hypergeometric orthogonal polynomials and their $q$-analogues" by…
In this paper, we propose a general method to express explicitly the inversion and the connection coefficients between two basic hypergeometric polynomial sets. As application, we consider some $d$-orthogonal basic hypergeometric…
We establish supercongruences for two kinds of Ap\'ery-like numbers, which involve Bernoulli numbers and Bernoulli polynomials. Conjectural supercongruences of the same type for another four kinds of Ap\'ery-like numbers are also proposed.
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…