Multiplication formulae for theE-functions regarded as functions of their parameters

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursion Formulae for Hypergeometric Functions

indicates the term corresponding to j = h is to be deleted. If one of the a, = 0 or a negative integer, then (1) always converges, since it terminates. Otherwise it converges for all finite x if P ^ Q and for |a;| < 1 if P = Q + 1. In this case, however, the function can be analytically continued into the cut plane |arg (1 — a;)| < x, and we shall often denote by q+iFq(x) not only the series (1...

متن کامل

Multiplication of Subharmonic Functions

We study subharmonic functions in the unit ball of R , with either a Bloch–type growth or a growth described through integral conditions involving some involutions of the ball. Considering mappings u 7→ gu between sets of functions with a prescribed growth, we study how the choice of these sets is related to the growth of the function g.

متن کامل

Reduction Formulae for Products of Theta Functions

In four cases it is already known that the product of two distinct Jacobian theta functions having the same variable z and the same nome q is a multiple of a single Jacobian theta function, with the multiple independent of z. The main purpose of the present note is to show that this property also applies in the remaining two cases.

متن کامل

Regularity Conditions for Formulae of Biconjugate Functions

When the dual of a normed space X is endowed with the weak∗ topology, the biconjugates of the proper convex lower semicontinuous functions defined on X coincide with the functions themselves. This is not the case when X∗ is endowed with the strong topology. Working in the latter framework, we give formulae for the biconjugates of some functions that appear often in convex optimization, which ho...

متن کامل

Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions

A general theory is developed for constructing the shallowest possible circuits and the shortest possible formulae for the carry save addition of n numbers using any given basic addition unit. (A carry save addition produces two numbers whose sum is equal to the sum of the n input numbers). More precisely, it is shown that if BA is a basic addition unit with occurrence matrix N then the shortes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1959

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1959.9.759