English

Kazdan-Warner equation on graph in the negative case

Differential Geometry 2017-07-19 v1 Analysis of PDEs Combinatorics

Abstract

Let G=(V,E)G=(V,E) be a connected finite graph. In this short paper, we reinvestigate the Kazdan-Warner equation Δu=cheu\Delta u=c-he^u with c<0c<0 on GG, where hh defined on VV is a known function. Grigor'yan, Lin and Yang \cite{GLY} showed that if the Kazdan-Warner equation has a solution, then h\overline{h}, the average value of hh, is negative. Conversely, if h<0\overline{h}<0, then there exists a number c(h)<0c_-(h)<0, such that the Kazdan-Warner equation is solvable for every 0>c>c(h)0>c>c_-(h) and it is not solvable for c<c(h)c<c_-(h). Moreover, if h0h\leq0 and h≢0h\not\equiv0, then c(h)=c_-(h)=-\infty. Inspired by Chen and Li's work \cite{CL}, we ask naturally: \begin{center} Is the Kazdan-Warner equation solvable for c=c(h)c=c_-(h)? \end{center} In this paper, we answer the question affirmatively. We show that if c(h)=c_-(h)=-\infty, then h0h\leq0 and h≢0h\not\equiv0. Moreover, if c(h)>c_-(h)>-\infty, then there exists at least one solution to the Kazdan-Warner equation with c=c(h)c=c_-(h).

Cite

@article{arxiv.1611.09184,
  title  = {Kazdan-Warner equation on graph in the negative case},
  author = {Huabin Ge},
  journal= {arXiv preprint arXiv:1611.09184},
  year   = {2017}
}

Comments

7 pages

R2 v1 2026-06-22T17:06:37.511Z