2000 character limit reached
Projectively related complex Finsler metrics
Published 5 Jun 2011 in math.DG | (1106.0893v1)
Abstract: In this paper we introduce in study the projectively related complex Finsler metrics. We prove the complex versions of the Rapcs\'{a}k's theorem and characterize the weakly K\"{a}hler and generalized Berwald projectively related complex Finsler metrics. The complex version of Hilbert's Fourth Problem is also pointed out. As an application, the projectiveness of a complex Randers metric is described.
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.