English

p-th Kazdan-Warner equation on graph

Differential Geometry 2016-11-16 v1 Combinatorics

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\Delta_p be the discrete pp-Laplacian on GG with p>1p>1 and L=ΔpkL=\Delta_p-k, where kC(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 fC(V)f\in C(V). We also prove that the equation Δpu=ff\Delta_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=cheu\Delta_pu=c-he^u has a solution on VV for given hC(V)h\in C(V) and c\mathdsRc\in \mathds{R}. Thus we generalize Grigor'yan, Lin and Yang's work \cite{GLY} for p=2p=2 to any p>1p>1.

Cite

@article{arxiv.1611.04902,
  title  = {p-th Kazdan-Warner equation on graph},
  author = {Huabin Ge},
  journal= {arXiv preprint arXiv:1611.04902},
  year   = {2016}
}

Comments

17 pages. Any comments are welcome

R2 v1 2026-06-22T16:53:09.718Z