p-th Kazdan-Warner equation on graph

preprint2016arXivOpen access

Abstract

Let G=(V,E)G=(V,E) be a connected finite graph and C(V)C(V) be the set of functions defined on VV. Let ΔpΔ_p be the discrete pp-Laplacian on GG with p>1p>1 and L=Δp−kL=Δ_p-k, where k∈C(V)k\in C(V) is positive everywhere. Consider the operator L:C(V)→C(V)L:C(V)\rightarrow C(V). We prove that −L-L is one to one, onto and preserves order. So it implies that there exists a unique solution to the equation Lu=fLu=f for any given f∈C(V)f\in C(V). We also prove that the equation Δpu=f‾−fΔ_pu=\overline{f}-f has a solution which is unique up to a constant, where f‾\overline{f} is the average of ff. With the help of these results, we finally give various conditions such that the pp-th Kazdan-Warner equation Δpu=c−heuΔ_pu=c-he^u has a solution on VV for given h∈C(V)h\in C(V) and $c\in \mathds{R}$. Thus we generalize Grigor'yan, Lin and Yang's work \cite{GLY} for p=2p=2 to any p>1p>1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.