Papers
Topics
Authors
Recent
Search
2000 character limit reached

Brouwer degree for Kazdan-Warner equations on a connected finite graph

Published 20 Apr 2021 in math.DG, math.AP, math.CO, and math.FA | (2104.09881v1)

Abstract: We study Kazdan-Warner equations on a connected finite graph via the method of the degree theory. Firstly, we prove that all solutions to the Kazdan-Warner equation with nonzero prescribed function are uniformly bounded and the Brouwer degree is well defined. Secondly, we compute the Brouwer degree case by case. As consequences, we give new proofs of some known existence results for the Kazdan-Warner equation on a connected finite graph.

Authors (2)
Citations (25)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.