Papers
Topics
Authors
Recent
Search
2000 character limit reached

On strongly convex projectively flat and dually flat complex Finsler metrics

Published 3 Oct 2017 in math.DG and math.CV | (1710.01024v1)

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.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.