
arXiv: 1602.05487
We consider the problem among curves connecting two given wells of W≥0, and we reduce it, following a standard method, to a geodesic problem of the form with . We then prove existence of curves minimizing this new action just by proving that the distance induced by K is proper (i.e., its closed balls are compact). The assumptions on W are minimal, and the method seems robust enough to be applied in the future to some PDE problems. Copyright © 2016 John Wiley & Sons, Ltd.
Mathematics - Metric Geometry, Methods involving semicontinuity and convergence; relaxation, Metric spaces, metrizability, FOS: Mathematics, geodesic problem, Metric Geometry (math.MG), heteroclinic connections, Optimality conditions for problems involving ordinary differential equations, Variational problems in applications to the theory of geodesics (problems in one independent variable)
Mathematics - Metric Geometry, Methods involving semicontinuity and convergence; relaxation, Metric spaces, metrizability, FOS: Mathematics, geodesic problem, Metric Geometry (math.MG), heteroclinic connections, Optimality conditions for problems involving ordinary differential equations, Variational problems in applications to the theory of geodesics (problems in one independent variable)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 18 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
