It is proved that the Laurent expansion of the following Gauss hypergeometric functions, are an arbitrary integer nonnegative numbers, a, b, c are an arbitrary numbers and ε is an arbitrary small parameters, are expressible in terms of the harmonic polylogarithms of Remiddi and Vermaseren with polynomial coefficients. An efficient algorithm for the calculation of the higher-order coefficients o...

It is proved that the Laurent expansion of the following Gauss hypergeometric functions, are an arbitrary integer nonnegative numbers, a, b, c are an arbitrary numbers and ε is an arbitrary small parameters, are expressible in terms of the harmonic polylogarithms of Remiddi and Vermaseren with polynomial coefficients. An efficient algorithm for the calculation of the higher-order coefficients o...

We prove that a pair of integral quadratic forms in 5 or more variables will simultaneously represent “almost all” pairs of integers that satisfy the necessary local conditions, provided that the forms satisfy a suitable nonsingularity condition. In particular such forms simultaneously attain prime values if the obvious local conditions hold. The proof uses the circle method, and in particular ...

We characterize all stationary time-reversible Markov processes whose finite-dimensional marginal distributions (of all orders) are infinitely divisible. Aside from two trivial cases (iid and constant), every such process with full support in both discrete and continuous time is a branching process with Poisson or Negative Binomial marginal distributions and a specific bivariate distribution at...

Constraint logic programming is a framework for modeling constraint satisfaction and optimization problems. To use the techniques of constraint programming eeciently in applications software some knowledge and experience of the problem domain is demanded. In order to get some of the problem domain knowledge we investigated usage of some machine learning methods in the eld of constraint logic pr...

For fixed ` ≥ 2, fixed positive integers m1 > m2 with gcd(m1,m2) = 1 and n1 > n2 > · · · > n` with gcd(n1, . . . , n`) = 1, and fixed rationals a1, a2, . . . , a`+1, b1, b2 which are all nonzero except for possibly a`+1, we show the finiteness of integral solutions x, y of the equation a1x n1 + · · ·+ a`x` + a`+1 = b1y + b2y , when n1 ≥ 3, m1 ≥ 2`(` − 1), and (n1, n2) 6= (m1,m2). In relation to...

Using a function algebra characterization of exponential time due to Monien 5], in the style of Bellantoni-Cook 2], we characterize exponential time functions of linear growth via a safe course-of-values recursion scheme.