On bounding Hecke–Siegel eigenvalues

نویسندگان

چکیده

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

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

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

منابع مشابه

On Bounding Hecke-siegel Eigenvalues

We use the action of the Hecke operators T̃j(p 2) (1 ≤ j ≤ n) on the Fourier coefficients of Siegel modular forms to bound the eigenvalues of these Hecke operators. This extends work of Duke-Howe-Li and of Kohnen, who provided bounds on the eigenvalues of the operator T (p).

متن کامل

An interval-matrix branch-and-bound algorithm for bounding eigenvalues

We present and explore the behaviour of a branch-and-bound algorithm for calculating valid bounds on the k-th largest eigenvalue of a symmetric interval matrix. Branching on the interval elements of the matrix takes place in conjunction with the application of Rohn’s method (an interval extension of Weyl’s theorem) in order to obtain valid outer bounds on the eigenvalues. Inner bounds are obtai...

متن کامل

Bounding the eigenvalues of the Laplace-Beltrami operator on compact submanifolds

We give upper bounds for the eigenvalues of the Laplace-Beltrami operator of a compact m-dimensional submanifold M of R. Besides the dimension and the volume of the submanifold and the order of the eigenvalue, these bounds depend on either the maximal number of intersection points of M with a pplane in a generic position (transverse to M), or an invariant which measures the concentration of the...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices

In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2006

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2005.06.013