Related papers: Approximation Theorem for Principal Eigenvalue of …

The purpose of the paper is to present quantitative estimates for the principal eigenvalue of discrete p-Laplacian on the set of rooted trees. Alternatively, it is studying the optimal constant of a class of weighted Hardy inequality. Three…

In this paper we investigate homogenization results for the principal eigenvalue problem associated to $1$-homogeneous, uniformly elliptic, second-order operators. Under rather general assumptions, we prove that the principal eigenpair…

We prove that if an $n\times n$ matrix defined over ${\mathbb Q}_p$ (or more generally an arbitrary complete, discretely-valued, non-Archimedean field) satisfies a certain congruence property, then it has a strictly maximal eigenvalue in…

We consider convergence properties of the long-term behaviors with respect to the coefficient of the stochastic term for a nonautonomous stochastic $p$-Laplacian lattice equation with multiplicative noise. First, the upper semi-continuity…

We generalize to the case of the $p-$Laplacian an old result by Hersch and Protter. Namely, we show that it is possible to estimate from below the first eigenvalue of the Dirichlet $p-$Laplacian of a convex set in terms of its inradius. We…

The first nontrivial eigenfunction of the Neumann eigenvalue problem for the $p$-Laplacian, suitable normalized, converges as $p$ goes to $\infty$ to a viscosity solution of an eigenvalue problem for the $\infty$-Laplacian. We show among…

We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…

In this work, given $p\in (1,\infty)$, we prove the existence and simplicity of the first eigenvalue $\lambda_p$ and its corresponding eigenvector $(u_p,v_p)$, for the following local/nonlocal PDE system \begin{equation}\label{Eq0} \left\{…

We provide a unified strategy to show that solutions of dynamic programming principles associated to the $p$-Laplacian converge to the solution of the corresponding Dirichlet problem. Our approach includes all previously known cases for…

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…

The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…

We consider positive singular solutions (i.e. with a non-removable singularity) of a system of PDEs driven by $p$-Laplacian operators and with the additional presence of a nonlinear first order term. By a careful use of a rather new version…

We develop some properties of the $p-$Neumann derivative for the fractional $p-$Laplacian in bounded domains with general $p>1$. In particular, we prove the existence of a diverging sequence of eigenvalues and we introduce the evolution…

We improve the classical discrete Hardy inequality for $ 1<p<\infty $ for functions on the natural numbers. For integer values of $ p $ the Hardy weight is an absolutely monotonic function.

We prove a theorem that can be thought of as a common generalization of the Discrete Nodal Theorem and (one direction of) Cheeger's Inequality for graphs. special case of this result will assert that if the second and third eigenvalues of…

In this work we study the homogenization problem for nonlinear elliptic equations involving $p-$Laplacian type operators with sign changing weights. We study the asymptotic behavior of variational eigenvalues, which consist on a double…

This work is concerned with linear inverse problems where a distributed parameter is known a priori to only take on values from a given discrete set. This property can be promoted in Tikhonov regularization with the aid of a suitable convex…

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

We find discrete analogs to continuous mean value principles that are used in the numerical analysis of the normalized p-Laplacian for particular values of p, specifically when p is 4.

We establish an explicit maximum principle for the Dirichlet problem associated with the $p$-Laplacian ($p>1$), where the constant depends on both $p$ and the geometry of the domain. From this result we derive two main applications. First,…