First steps in stable Hamiltonian topology

Kai Cieliebak; Evgeny Volkov

Displaying similar documents to “First steps in stable Hamiltonian topology”

Perturbation results for a class of singular Hamiltonian systems

Antonio Ambrosetti, Ivar Ekeland (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

The existence of solutions with prescribed period $T$ for a class of Hamiltonian systems with a Keplerian singularity is discussed.

Problems remaining NP-complete for sparse or dense graphs

Ingo Schiermeyer (1995)

Discussiones Mathematicae Graph Theory

Similarity:

For each fixed pair α,c > 0 let INDEPENDENT SET ( $m \leq c n^{α}$ ) and INDEPENDENT SET ( $m \geq (ⁿ ₂) - c n^{α}$ ) be the problem INDEPENDENT SET restricted to graphs on n vertices with $m \leq c n^{α}$ or $m \geq (ⁿ ₂) - c n^{α}$ edges, respectively. Analogously, HAMILTONIAN CIRCUIT ( $m \leq n + c n^{α}$ ) and HAMILTONIAN PATH ( $m \leq n + c n^{α}$ ) are the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted to graphs with $m \leq n + c n^{α}$ edges. For each ϵ > 0 let HAMILTONIAN CIRCUIT (m ≥ (1 - ϵ)(ⁿ₂)) and HAMILTONIAN PATH (m ≥ (1 - ϵ)(ⁿ₂)) be the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH...

On some completions of the space of hamiltonian maps

Vincent Humilière (2008)

Bulletin de la Société Mathématique de France

Similarity:

In one of his papers, C. Viterbo defined a distance on the set of Hamiltonian diffeomorphisms of $ℝ^{2 n}$ endowed with the standard symplectic form $ω_{0} = d p \land d q$ . We study the completions of this space for the topology induced by Viterbo’s distance and some others derived from it, we study their different inclusions and give some of their properties. In particular, we give a convergence criterion for these distances that allows us to prove that the completions contain non-ordinary elements, as for example,...

Pancyclism and small cycles in graphs

Ralph Faudree, Odile Favaron, Evelyne Flandrin, Hao Li (1996)

Discussiones Mathematicae Graph Theory

Similarity:

We first show that if a graph G of order n contains a hamiltonian path connecting two nonadjacent vertices u and v such that d(u)+d(v) ≥ n, then G is pancyclic. By using this result, we prove that if G is hamiltonian with order n ≥ 20 and if G has two nonadjacent vertices u and v such that d(u)+d(v) ≥ n+z, where z = 0 when n is odd and z = 1 otherwise, then G contains a cycle of length m for each 3 ≤ m ≤ max (dC(u,v)+1, [(n+19)/13]), $d_{C} (u, v)$ being the distance of u and v on a hamiltonian cycle...

Perturbation results for a class of singular Hamiltonian systems

Antonio Ambrosetti, Ivar Ekeland (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

The existence of solutions with prescribed period $T$ for a class of Hamiltonian systems with a Keplerian singularity is discussed.

A note on a new condition implying pancyclism

Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Woźniak (2001)

Discussiones Mathematicae Graph Theory

Similarity:

We first show that if a 2-connected graph G of order n is such that for each two vertices u and v such that δ = d(u) and d(v) < n/2 the edge uv belongs to E(G), then G is hamiltonian. Next, by using this result, we prove that a graph G satysfying the above condition is either pancyclic or isomorphic to $K_{n / 2, n / 2}$ .

Factors and circuits in $K_{1, 3}$ -free graphs

Zdeněk Ryjáček (1989)

Banach Center Publications

Similarity:

The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs

Ladislav Nebeský (2006)

Czechoslovak Mathematical Journal

Similarity:

If $G$ is a connected graph of order $n \geq 1$ , then by a hamiltonian coloring of $G$ we mean a mapping $c$ of $V (G)$ into the set of all positive integers such that $| c (x) - c (y) | \geq n - 1 - D_{G} (x, y)$ (where $D_{G} (x, y)$ denotes the length of a longest $x - y$ path in $G$ ) for all distinct $x, y \in V (G)$ . Let $G$ be a connected graph. By the hamiltonian chromatic number of $G$ we mean $min (max (c (z); z \in V (G))),$ where the minimum is taken over all hamiltonian colorings $c$ of $G$ . The main result of this paper can be formulated as follows: Let $G$ be a connected graph of order $n \geq 3$ . Assume that there exists...

Families of whiskered tori for a-priori stable/unstable Hamiltonian systems and construction of unstable orbits.

Valdinoci, Enrico (2000)

Mathematical Physics Electronic Journal [electronic only]

Similarity:

Hamiltonian Dynamics on Pseudodifferential Symbols

Boris Khesin (1993)

Recherche Coopérative sur Programme n°25

Similarity:

Hamiltonian Systems Close to Integrable Systems

E. Zenhder (1975)

Publications mathématiques et informatique de Rennes

Similarity:

Hofer’s metrics and boundary depth

Michael Usher (2013)

Annales scientifiques de l'École Normale Supérieure

Similarity:

We show that if $(M, ω)$ is a closed symplectic manifold which admits a nontrivial Hamiltonian vector field all of whose contractible closed orbits are constant, then Hofer’s metric on the group of Hamiltonian diffeomorphisms of $(M, ω)$ has infinite diameter, and indeed admits infinite-dimensional quasi-isometrically embedded normed vector spaces. A similar conclusion applies to Hofer’s metric on various spaces of Lagrangian submanifolds, including those Hamiltonian-isotopic to the diagonal in $M \times M$ ...

Rigidity and gluing for Morse and Novikov complexes

Octav Cornea, Andrew Ranicki (2003)

Journal of the European Mathematical Society

Similarity:

We obtain rigidity and gluing results for the Morse complex of a real-valued Morse function as well as for the Novikov complex of a circle-valued Morse function. A rigidity result is also proved for the Floer complex of a hamiltonian defined on a closed symplectic manifold $(M, ω)$ with $c_{1} {|_{π_{2} (M)} = [ω] |}_{π_{2} (M)} = 0$ . The rigidity results for these complexes show that the complex of a fixed generic function/hamiltonian is a retract of the Morse (respectively Novikov or Floer) complex of any other sufficiently $C^{0}$ close generic...

Hamiltonian colorings of graphs with long cycles

Ladislav Nebeský (2003)

Mathematica Bohemica

Similarity:

By a hamiltonian coloring of a connected graph $G$ of order $n \geq 1$ we mean a mapping $c$ of $V (G)$ into the set of all positive integers such that $| c (x) - c (y) | \geq n - 1 - D_{G} (x, y)$ (where $D_{G} (x, y)$ denotes the length of a longest $x - y$ path in $G$ ) for all distinct $x, y \in G$ . In this paper we study hamiltonian colorings of non-hamiltonian connected graphs with long cycles, mainly of connected graphs of order $n \geq 5$ with circumference $n - 2$ .

Forbidden triples implying Hamiltonicity: for all graphs

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2004)

Discussiones Mathematicae Graph Theory

Similarity:

In [2], Brousek characterizes all triples of graphs, G₁, G₂, G₃, with $G_{i} = K_{1, 3}$ for some i = 1, 2, or 3, such that all G₁G₂G₃-free graphs contain a hamiltonian cycle. In [6], Faudree, Gould, Jacobson and Lesniak consider the problem of finding triples of graphs G₁, G₂, G₃, none of which is a $K_{1, s}$ , s ≥ 3 such that G₁, G₂, G₃-free graphs of sufficiently large order contain a hamiltonian cycle. In this paper, a characterization will be given of all triples G₁, G₂, G₃ with none being $K_{1, 3}$ , such that all...

The cubic Szegő equation

Patrick Gérard, Sandrine Grellier (2010)

Annales scientifiques de l'École Normale Supérieure

Similarity:

We consider the following Hamiltonian equation on the $L^{2}$ Hardy space on the circle, $i \partial_{t} u = {Π (| u |}^{2} u),$ where $Π$ is the Szegő projector. This equation can be seen as a toy model for totally non dispersive evolution equations. We display a Lax pair structure for this equation. We prove that it admits an infinite sequence of conservation laws in involution, and that it can be approximated by a sequence of finite dimensional completely integrable Hamiltonian systems. We establish several...

Potential forbidden triples implying hamiltonicity: for sufficiently large graphs

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2005)

Discussiones Mathematicae Graph Theory

Similarity:

In [1], Brousek characterizes all triples of connected graphs, G₁,G₂,G₃, with $G_{i} = K_{1, 3}$ for some i = 1,2, or 3, such that all G₁G₂ G₃-free graphs contain a hamiltonian cycle. In [8], Faudree, Gould, Jacobson and Lesniak consider the problem of finding triples of graphs G₁,G₂,G₃, none of which is a $K_{1, s}$ , s ≥ 3 such that G₁G₂G₃-free graphs of sufficiently large order contain a hamiltonian cycle. In [6], a characterization was given of all triples G₁,G₂,G₃ with none being $K_{1, 3}$ , such that all G₁G₂G₃-free...