2000 character limit reached
Cut time in the sub-Riemannian problem on the Cartan group (2107.06730v1)
Published 14 Jul 2021 in math.OC and math.DG
Abstract: We study the sub-Riemannian structure determined by a left-invariant distribution of rank 2 on a step 3 Carnot group of dimension 5. We prove the conjectured cut times of Y. Sachkov for the sub-Riemannian Cartan problem. Along the proof, we obtain a comparison with the known cut times in the sub-Riemannian Engel group, and a sufficient (generic) condition for the uniqueness of the length minimizer between two points. Hence we reduce the optimal synthesis to solving a certain system of equations in elliptic functions.
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.