Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 157 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 35 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 97 tok/s Pro
Kimi K2 218 tok/s Pro
GPT OSS 120B 450 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Orbits and attainable Hamiltonian diffeomorphisms of mechanical Liouville equations (2509.24960v1)

Published 29 Sep 2025 in math.SG and math.OC

Abstract: We study the approximate controllability problem for Liouville transport equations along a mechanical Hamiltonian vector field. Such PDEs evolve inside the orbit $$\mathcal{O}(\rho_0):=\left{\rho_0\circ \Phi\mid \Phi\in {\rm DHam}(T*M)\right},\quad \rho_0\in Lr(T*M,\R), \quad r\in[1,\infty),$$ where $\rho_0$ is the initial density and ${\rm DHam}(T*M)$ is the group of Hamiltonian diffeomorphisms of the cotangent bundle manifold $T*M$. The approximately reachable densities from $\rho_0$ are thus contained in $\ov{\mathcal{O}(\rho_0)}$, where the closure is taken with respect to the $Lr$-topology. Our first result is a characterization of $\ov{\mathcal{O}(\rho_0)}$ when the manifold $M$ is the Euclidean space $\Rd$ or the torus $\Td$ of arbitrary dimension: $\ov{\mathcal{O}(\rho_0)}$ is the set of all the densities whose sub- and super-level sets have the same measure as those of $\rho_0$. This result is an approximate version, in the case of ${\rm DHam}(T*M)$, of a theorem by J.~Moser (Trans. Am. Math. Soc. 120: 286-294, 1965) on the group of diffeomorphisms. We then present two examples of systems, respectively on $M=\Rd$ and $\Td$, where the small-time approximately attainable diffeomorphisms coincide with ${\rm DHam}(T*M)$, respectively at the level of the group and at the level of the densities. The proofs are based on the construction of Hamiltonian diffeomorphisms that approximate suitable permutations of finite grids, and Poisson bracket techniques.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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