Related papers: On invariant sets in Lagrangian graphs

A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this…

We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.

Consider a holomorphic automorphism which acts hyperbolically on some invariant compact set. Then for every point in the compact set there exists a stable manifold, which is a complex manifold diffeomorphic to real Euclidean space. If the…

In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…

A graph $G$ is called a $2K_2$-free graph if it does not contain $2K_2$ as an induced subgraph. In 2014, Broersma, Patel and Pyatkin showed that every 25-tough $2K_2$-free graph on at least three vertices is Hamiltonian. Recently, Shan…

For a sequence of immersed connected closed Hamiltonian stationary Lagrangian submaniolds in $\mathbb{C}^{n}$ with uniform bounds on their volumes and the total extrinsic curvatures, we prove that a subsequence converges either to a point…

Starting from the concept of involution of field equations, a universal method is proposed for constructing consistent interactions between the fields. The method equally well applies to the Lagrangian and non-Lagrangian equations and it is…

The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-stab}(n, k)$ is obtained from the Kneser graph by deleting vertices with…

We show that a discrete harmonic function which is bounded on a large portion of a periodic planar graph is constant. A key ingredient is a new unique continuation result for the weighted graph Laplacian. The proof relies on the structure…

We consider an integrable Hamiltonian system with n-degrees of freedom whose first integrals are invariant under the symplectic action of a compact Lie group G. We prove that the singular Lagrangian foliation associated to this Hamiltonian…

Let $\text{Ham(M,L)}$ denote the group of Hamiltonian diffeomorphisms on a symplectic manifold $M$, leaving a Lagrangian submanifold $L\subset M$ invariant. In this paper, we show that $\text{Ham(M,L)}$ has the fragmentation property, using…

A circle of an infinite locally finite graph $G$ is the imagine of a homeomorphic mapping of the unit circle $S^1$ in $|G|$, the Freudenthal compactification of $G$. A circle of $G$ is Hamiltonian if it meets every vertex (and then every…

In this paper, first, we establish a sufficient condition for a bipartite graph to be Hamilton-connected. Furthermore, we also give two sufficient conditions on distance signless Laplacian spectral radius for a graph to be…

We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…

In 1973, Chv\'atal conjectured that there exists a constant $t_0$ such that every $t_0$-tough graph on at least three vertices is Hamiltonian. This conjecture has inspired extensive research and has been verified for several special classes…

In this paper, we investigate the Hamiltonian-stability of Lagrangian tori in the complex hyperbolic space $\mathbb{C}H^n$. We consider a standard Hamiltonian $T^n$-action on $\mathbb{C}H^n$, and show that every Lagrangian $T^n$-orbits in…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…

In this paper we establish some spectral conditions for a graph to be Hamilton-connected in terms of the spectral radius of the adjacency matrix or the signless Laplacian of the graph or its complement. For the existence of Hamiltonian…

Given a smooth Tonelli Hamiltonian on the torus $\mathbb{T}^{n}$ and a $C^{2}$ Lagrangian graph $W \subset T^{*}\mathbb{T}^{n}$ that is invariant under the Hamiltonian flow and contained within a Ma\~n\'e supercritical energy level, we…