## Journals

- Advances in Mathematics of Communications
- Big Data & Information Analytics
- Communications on Pure & Applied Analysis
- Discrete & Continuous Dynamical Systems - A
- Discrete & Continuous Dynamical Systems - B
- Discrete & Continuous Dynamical Systems - S
- Evolution Equations & Control Theory
- Inverse Problems & Imaging
- Journal of Computational Dynamics
- Journal of Dynamics & Games
- Journal of Geometric Mechanics
- Journal of Industrial & Management Optimization
- Journal of Modern Dynamics
- Kinetic & Related Models
- Mathematical Biosciences & Engineering
- Mathematical Control & Related Fields
- Mathematical Foundations of Computing
- Networks & Heterogeneous Media
- Numerical Algebra, Control & Optimization
- AIMS Mathematics
- Conference Publications
- Electronic Research Announcements
- Mathematics in Engineering

### Open Access Journals

We show that given any $C^{\infty}$ Riemannian structure $(T^{2},g)$ in the two torus, $\epsilon >0$ and $\beta \in (0,\frac{1}{3})$, there exists a $C^{\infty}$ Riemannian metric $\bar{g}$ with no continuous Lagrangian invariant graphs that is $\epsilon$-$C^{1,\beta}$ close to $g$. The main idea of the proof is inspired in the work of V. Bangert who introduced caps from smoothed cone type $C^{1}$ small perturbations of metrics with non-positive curvature to get conjugate points. Our new contribution to the subject is to show that positive curvature cone type small perturbations are ``less singular" than non-positive curvature cone type perturbations. Positive curvature geometry allows us to get better estimates for the variation of the $C^{1}$ norm of the singular cone in a neighborhood of its vertex.

We study the graph property for Lagrangian minimizing submanifolds of the geodesic flow of a Riemannian metric in the torus $ (T^{n},g) $, $ n>2 $. It is well known that the transitivity of the geodesic flow in a minimizing Lagrangian submanifold implies the graph property. We replace the transitivity by three kind of assumptions: (1) $ r $-density of the set of recurrent orbits for some $ r>0 $ depending on $ g $, (2) $ r $-density of the limit set, (3) every point is nonwandering. Then we show that a Lagrangian, minimizing torus satisfying one of such assumptions is a graph.

## Year of publication

## Related Authors

## Related Keywords

[Back to Top]