2000 character limit reached
On strongly convex projectively flat and dually flat complex Finsler metrics (1710.01024v1)
Published 3 Oct 2017 in math.DG and math.CV
Abstract: In this paper, we prove that a strongly convex complex Finsler metric $F$ on a domain $D\subset\mathbb{C}n$ is projectively flat (resp. dually flat) if and only if $F$ comes from a strongly convex complex Minkowski metric.
Sponsor
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.