Kazdan-Warner equation on graph in the negative case
Abstract
Let G=(V,E) be a connected finite graph. In this short paper, we reinvestigate the Kazdan-Warner equation u=c-heu with c<0 on G, where h defined on V is a known function. Grigor'yan, Lin and Yang GLY showed that if the Kazdan-Warner equation has a solution, then h, the average value of h, is negative. Conversely, if h<0, then there exists a number c-(h)<0, such that the Kazdan-Warner equation is solvable for every 0>c>c-(h) and it is not solvable for c<c-(h). Moreover, if h≤0 and h0, then c-(h)=-∞. Inspired by Chen and Li's work CL, we ask naturally: center Is the Kazdan-Warner equation solvable for c=c-(h)? center In this paper, we answer the question affirmatively. We show that if c-(h)=-∞, then h≤0 and h0. Moreover, if c-(h)>-∞, then there exists at least one solution to the Kazdan-Warner equation with c=c-(h).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.