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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.