On Poly(ana)logs I

We investigate a connection between the differential of polylogarithms (as considered by Cathelineau) and a finite variant of them. This allows to answer a question raised by Kontsevich concerning the construction of functional equations for the finite analogs, using in part the p-adic version of polylogarithms and recent work of Besser. Kontsevich's original unpublished note is supplied (with his kind permission) in an Appendix at the end of the paper.     

Computation of equilibria in an economy with increasing returns to scale technologies

The purpose of this paper is to show that equilibria in an economy with increasing returns to scale technologies are computable.     

On Some Integrals Involving the Hurwitz Zeta Function: Part 2

We establish a series of indefinite integral formulae involving the Hurwitz zeta function and other elementary and special functions related to it, such as the Bernoulli polynomials, ln sin(q), ln (q) and the polygamma functions. Many of the results are most conveniently formulated in terms of a family of functions A _k(q) := k(1 – k, q), k , and a family of polygamma functions of negative order, whose properties we study in some detail.     

On Some Integrals Involving the Hurwitz Zeta Function: Part 1

We establish a series of integral formulae involving the Hurwitz zeta function. Applications are given to integrals of Bernoulli polynomials, ln (q) and ln sin(q).     

Sum of multiple zeta values of fixed weight,depth and <Emphasis Type=Italic>i</Emphasis>-height

Let r be a positive integer. An explicit formula of the generating function of the sums of multiple zeta values of fixed weights, depths and 1-heights, 2-heights, ..., r-heights is given in terms of generalized hypergeometric functions.      

On the series ∑ k=1 ∞ ( k 3k )−1 k −n x k

In this paper we investigate the series ∑ _k=1 ^∞ ( _k ^3k )⁻¹ k ⁻ⁿ x ^k . Obtaining some integral representations of them, we evaluated the sum of them explicitly forn = 0, 1, 2.     

Preliminary Analysis on the Probabilistic Feature of a Dark Cave of Digits

ＰｒｅｌｉｍｉｎａｒｙＡｎａｌｙｓｉｓｏｎｔｈｅＰｒｏｂａｂｉｌｉｓｔｉｃＦｅａｔｕｒｅｏｆａＤａｒｋＣａｖｅｏｆＤｉｇｉｔｓ￥ＦａｎＺｉｌｉａｎｇ（范子亮）(ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓＳｏｕｔｈｗｅｓｔＪｉａｏｔｏ?..     

Resolution of Some Open Problems Concerning Multiple Zeta Evaluations of Arbitrary Depth

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst–Zagier formula. Other results we provide settle three of the remaining outstanding conjectures of Borwein, Bradley, and Broadhurst. A complete treatment of a certain arbitrary depth class of periodic alternating unit Euler sums is also given.     

Reporting computational experiments in mathematical programming

This paper presents a set of recommended standards for the presentation of computational experiments in mathematical programming.The authors are members of the Committee on Algorithms of the Mathematical Programming Society.     

Sur les entiers dont la somme des chiffres est moyenne

The goal of this paper is to study sets of integers with an average sum of digits. More precisely, let g be a fixed integer, s(n) be the sum of the digits of n in basis g. Let f:N→N such that, in any interval [g^ν,g^ν+1[, f(n) is constant and near from (g-1)ν/2. We give an asymptotic for the number of integers n<x such that s(n)=f(n) and we prove that for every irrational α the sequence (αn) is equidistributed mod 1, for n satisfying s(n)=f(n).     

On the Number of Sparse RSA Exponents

An RSA modulus is a product M=pl of two primes p and l. We show that for almost all RSA moduli M, the number of sparse exponents e (which allow for fast RSA encryption) with the property that gcd(e,?(M))=1 (hence RSA decryption can also be performed) is very close to the expected value.     

Finite and p-adic Polylogarithms

The finite nth polylogarithm li _n (z) /p(z) is defined as _k=1 ^p–1 z ^k /k ⁿ . We state and prove the following theorem. Let Li _k : _{p p} be the p-adic polylogarithms defined by Coleman. Then a certain linear combination F _n of products of polylogarithms and logarithms, with coefficients which are independent of p, has the property that p ^1–n DF _n (z) reduces modulo p>n+1 to li _n–1((z)), where D is the Cathelineau operator z(1–z)d/dz and is the inverse of the p-power map. A slightly modified version of this theorem was conjectured by Kontsevich. This theorem is used by Elbaz-Vincent and Gangl to deduce functional equations of finite polylogarithms from those of complex polylogarithms.     

Decomposition of Log Crepant Birational Morphisms between Log Terminal Surfaces

We prove that every log crepant birational morphism between log terminal surfaces can be decomposed into log flopping type divisorial contraction morphisms and log blowdowns. Repeating these two kinds of contractions, we reach a minimal log minimal surface from any log minimal surface.