Nodal Domains for the p-Laplacian

نویسندگان

  • Aomar Anane
  • Omar Chakrone
  • Mohamed Filali
چکیده

In this paper we consider the eigenvalue problem − pu = λ(m)|u|p−2u, u ∈ W 1,p 0 ( ) where p > 1, p is the p-Laplacian operator, λ > 0, is a bounded domain in R(N ≥ 1) and m is a given positive function in L( ) (r depending on p and N ). We prove that the second positive eigenvalue admits exactly two nodal domains. AMS subject classification: 35J20, 35J70, 35P05, 35P30.

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

ثبت نام

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

منابع مشابه

Inverse nodal problem for p-Laplacian with two potential functions

In this study, inverse nodal problem is solved for the p-Laplacian operator with two potential functions. We present some asymptotic formulas which have been proved in [17,18] for the eigenvalues, nodal points and nodal lengths, provided that a potential function is unknown. Then, using the nodal points we reconstruct the potential function and its derivatives. We also introduce a solution of i...

متن کامل

Nodal domain theorem for the graph p-Laplacian

In this work we consider the nonlinear graph p-Laplacian and the set of eigenvalues and associated eigenvectors of this operator defined by a variational principle. We prove a unifying nodal domain theorem for the graph p-Laplacian for any p ≥ 1. While for p > 1 the bounds on the number of weak and strong nodal domains are the same as for the linear graph Laplacian (p = 2), the behavior changes...

متن کامل

für Mathematik in den Naturwissenschaften Leipzig Nodal Domain Theorems and Bipartite Subgraphs ( revised

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by th...

متن کامل

On the Generalization of the Courant Nodal Domain Theorem

In this paper we consider the analogue of the Courant nodal domain theorem for the nonlinear eigenvalue problem for the p-Laplacian. In particular we prove that if uln is an eigenfunction associated with the nth variational eigenvalue, ln, then uln has at most 2n−2 nodal domains. Also, if uln has n+k nodal domains, then there is another eigenfunction with at most n−k nodal domains. © 2002 Elsev...

متن کامل

Unbounded Planar Domains Whose Second Nodal Line Does Not Touch the Boundary

We show the existence of simply-connected unbounded planar domains for which the second nodal line of the Dirichlet Laplacian does not touch the boundary.

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007