2000 character limit reached
Combinatorial Calabi flow for ideal circle pattern
Published 3 Jan 2025 in math.DG and math.CV | (2501.01678v2)
Abstract: We study the combinatorial Calabi flow for ideal circle patterns in both hyperbolic and Euclidean background geometry. We prove that the flow exists for all time and converges exponentially fast to an ideal circle pattern metric on surfaces with prescribed attainable curvatures. As a consequence, we provide an algorithm to find the desired ideal circle patterns.
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.