A lower bound for eigenvalues of the poly-Laplacian with arbitrary order

نویسندگان
چکیده

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

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

منابع مشابه

A lower bound for the Laplacian eigenvalues of a graph—proof of a conjecture by Guo

We show that if μj is the j-th largest Laplacian eigenvalue, and dj is the j-th largest degree (1 ≤ j ≤ n) of a connected graph Γ on n vertices, then μj ≥ dj − j + 2 (1 ≤ j ≤ n− 1). This settles a conjecture due to Guo.

متن کامل

LOWER BOUNDS FOR EIGENVALUES OF THE ONE-DIMENSIONAL p-LAPLACIAN

We also prove that the lower bound is sharp. Eigenvalue problems for quasilinear operators of p-Laplace type like (1.1) have received considerable attention in the last years (see, e.g., [1, 2, 3, 5, 8, 13]). The asymptotic behavior of eigenvalues was obtained in [6, 7]. Lyapunov inequalities have proved to be useful tools in the study of qualitative nature of solutions of ordinary linear diffe...

متن کامل

Lower order eigenvalues of the biharmonic operator

Abstract In this paper we consider the lower order eigenvalues of biharmonic operator on compact Riemannian manifolds with boundary (possibly empty) and prove a type of general inequalities for them. In particular, we study the lower order eigenvalues of biharmonic operator on compact submanifolds of Euclidean spaces, of spheres, and of projective spaces. We obtain some estimates for lower orde...

متن کامل

An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian

The authors give a new upper bound for the diameter D(G) of a graph G in terms of the eigenvalues of the Laplacian of G. The bound is

متن کامل

A lower bound on the independence number of arbitrary hypergraphs

We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d(v) = (d 1 (v); d 2 (v); : : :) where d m (v) is the number of edges of size m containing v. We deene a function f with the property that any hypergraph H = (V; E) satisses (H) P v2V f(d(v)). This lower bound is sharp when H is a matching, and...

متن کامل

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


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

ژورنال

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

سال: 2013

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.2013.262.35