Inverse Problems for the Return Map in the Class ( OC ): Reconstruction and Identifiability

Abstract

We analyze the inverse problem of recovering geometric information from the return map induced by a round-trip between a convex core C and an admissible domain. This process defines a discrete dynamical system on the boundary of C governed by a thickness function d. We prove that the return map determines the gradient structure of d, including its critical points, Morse indices, and basin decomposition. At second order, the geometry is encoded indirectly through a curvature-dependent operator acting on the Hessian of d, revealing a coupling between thickness and curvature. This leads to intrinsic non-uniqueness in the inverse problem, due to scaling and dynamical equivalences. However, uniqueness (up to these ambiguities) can be recovered under additional geometric constraints such as symmetry or isotropy.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…