2000 character limit reached
Wolff-Denjoy theorems in non-smooth convex domains
Published 11 Nov 2012 in math.CV and math.DS | (1211.2454v1)
Abstract: We give a short proof of Wolff-Denjoy theorem for (not necessarily smooth) strictly convex domains. With similar techniques we are also able to prove a Wolff-Denjoy theorem for weakly convex domains, again without any smoothness assumption on the boundary.
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.