Related papers: On invariant sets in Lagrangian graphs

An equation is obtained to find the Lagrangian for a one-dimensional autonomous system. The continuity of the first derivative of its constant of motion is assumed. This equation is solved for a generic nonconservative autonomous system…

In this short note we show that any action for $N$ interacting particles can be made invariant under gauged Galilean transformations. While resulting Lagrangian is generally very complicated its Hamiltonian has simple form with first class…

An $n$-vertex graph $G$ is a $C$-expander if $|N(X)|\geq C|X|$ for every $X\subseteq V(G)$ with $|X|< n/2C$ and there is an edge between every two disjoint sets of at least $n/2C$ vertices. We show that there is some constant $C>0$ for…

It is shown that a given non-autonomous system of two first-order ordinary differential equations can be expressed in Hamiltonian form. The derivation presented here allow us to obtain previously known results such as the infinite number of…

We show that for each \eta>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d^+_1\le ... \le d^+_n and d^- _1 \le ... \le d^-_n satisfy (i) d^+_i \geq i+ \eta n or d^-_{n-i- \eta n} \geq n-i…

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

We consider integrable Hamiltonian systems in a general setting of invariant submanifolds which need not be compact. For instance, this is the case a global Kepler system, non-autonomous integrable Hamiltonian systems and integrable systems…

We use a new variational method --based on the theory of anti-selfdual Lagrangians developed in [2] and [3]-- to establish the existence of solutions of convex Hamiltonian systems that connect two given Lagrangian submanifolds in $\R^{2N}$.…

A fundamental result of Banyaga states that the Hamiltonian diffeomorphism group of a closed symplectic manifold is perfect. We refine this result by proving that, locally in the $C^\infty$ topology, the number of commutators needed to…

A graph $ G $ is called $ t $-tough if $ \left|S\right|\geq t\cdot w\left(G-S\right)$ for every cutset $ S $ of $G$. Chv\'atal conjectured that there exists a constant $ t_{0} $ such that every $ t_{0} $-tough graph has a hamiltonian cycle.…

Let G be a locally compact group, and let U be its unitary representation on a Hilbert space H. Endow the space L(H) of linear bounded operators on H with weak operator topology. We prove that if U is a measurable map from G to L(H) then it…

Let $G$ be a graph on $n\geq 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ is called 1-heavy if at least one end vertex of each induced…

We prove the existence of at least $cl(M)$ periodic orbits for certain time dependant Hamiltonian systems on the cotangent bundle of an arbitrary compact manifold $M$. These Hamiltonians are not necessarily convex but they satisfy a certain…

We give a simple proof of Kolmogorov's theorem on the persistence of a quasiperiodic invariant torus in Hamiltonian systems. The theorem is first reduced to a well-posed inversion problem (Herman's normal form) by switching the frequency…

Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. For a positive real number $t$, a non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the…

In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…

We consider a Hamiltonian torus action on a compact connected symplectic manifold M. For a certain class of Lagrangian submanifolds Q of M we show that the image of Q under the momentum map is convex. As an application we complete the…

In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph…

We show that for sufficiently large $d$, every balanced bipartite, connected biclaw-free graph with minimum degree $\geq d$ is Hamiltonian. This confirms a conjecture of Flandrin, Fouquet, and Li.

We state a sufficient condition for the square of a locally finite graph to contain a Hamilton circle, extending a result of Harary and Schwenk about finite graphs. We also give an alternative proof of an extension to locally finite graphs…