This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding expansion for the Taylor coefficients of the function.Expand

The subset sum problem is to decide whether or not the 0-1 integer programming problem Σi=1n aixi = M; all xi = 0 or 1; has a solution, where the ai and M are given positive integers.Expand

Cellular automata are discrete dynamical systems, of simple construction but complex and varied behaviour. Algebraic techniques are used to give an extensive analysis of the global properties of a… Expand

This paper introduces a general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out: These parameters are studied systematically through the use of generating functions and singularity analysis.Expand

as x --, oc. In [7] two versions of the Chebotarev density theorem were proved, one unconditional and the other on the assumption of the Generalized Riemann Hypothesis (GRH), each of which expressed… Expand

New upper bounds are given for the maximum number, τ n , of nonoverlapping unit spheres that can touch a unit sphere in n -dimensional Euclidean space, for n ⩽24.Expand

A simple approach, called PMP (Paris Metro Pricing), is suggested for providing differentiated services in packet networks, each of which would treat all packets equally on a best effort basis.Expand