On Some Conjectures by Morriset al.about Zeros of an Entire Function

نویسندگان

چکیده

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

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

منابع مشابه

Asymptotics of Zeros for Some Entire Functions

We study the asymptotics of zeros for entire functions of the form sin z+ ∫ 1 −1 f(t)e dt with f belonging to a space X →֒ L1(−1, 1) possessing some minimal regularity properties.

متن کامل

Some conjectures on the zeros of approximates to the Riemann Ξ-function and incomplete gamma functions

Riemann conjectured that all the zeros of the Riemann Ξ-function are real, which is now known as the Riemann Hypothesis (RH). In this article we introduce the study of the zeros of the truncated sums ΞN (z) in Riemann’s uniformly convergent infinite series expansion of Ξ(z) involving incomplete gamma functions. We conjecture that when the zeros of ΞN (z) in the first quadrant of the complex pla...

متن کامل

On Relations among Some Constants of an Entire Function

If Piz) is an entire function of order p, it is known that (1) M, m are its type and co-type, in case/ happens to be the rank (or position) function of the maximum term of the Maclaurin series of P (see Chapter II of [l] and Chapter II of [2]) and that (2) M and m are the logarithmic type and co-type of P, if fix) is the number of zeroes z of Piz) such that \z\ ^x (see Jensen's Theorem, Chapter...

متن کامل

Some conjectures on codes

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations with factorizations of cyclic groups.

متن کامل

Some conjectures on congruences

1. Notation. Let Z and N be the sets of integers and positive integers respectively. For b, c ∈ Z the Lucas sequences {U n (b, c)} and {V n (b, c)} are defined by (1.1) U 0 (b, c) = 0, U 1 (b, c) = 1, U n+1 (b, c) = bU n (b, c) − cU n−1 (b, c) (n ≥ 1) and (1.2) V 0 (b, c) = 2, V 1 (b, c) = b, V n+1 (b, c) = bV n (b, c) − cV n−1 (b, c) (n ≥ 1). Let d = b 2 − 4c. It is well known that for n ∈ N, ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1998

ISSN: 0022-247X

DOI: 10.1006/jmaa.1998.6054