Kazdan-Warner equation on graph in the negative case
Huabin Ge

TL;DR
This paper investigates the solvability of the Kazdan-Warner equation on finite graphs in the negative case, establishing conditions under which solutions exist at critical parameter values and extending previous results.
Contribution
It proves the existence of solutions at the critical parameter $c=c_-(h)$, answering an open question and generalizing prior work on the negative case.
Findings
Solutions exist at $c=c_-(h)$ when $c_-(h)>- finite$.
If $c_-(h)=-inite$, then $h\
Solutions are characterized by the sign and nullity of $h$.
Abstract
Let be a connected finite graph. In this short paper, we reinvestigate the Kazdan-Warner equation with on , where defined on is a known function. Grigor'yan, Lin and Yang \cite{GLY} showed that if the Kazdan-Warner equation has a solution, then , the average value of , is negative. Conversely, if , then there exists a number , such that the Kazdan-Warner equation is solvable for every and it is not solvable for . Moreover, if and , then . Inspired by Chen and Li's work \cite{CL}, we ask naturally: \begin{center} Is the Kazdan-Warner equation solvable for ? \end{center} In this paper, we answer the question affirmatively. We show that if , then and . Moreover, if , then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
