Hamiltonian Dynamics on Pseudodifferential Symbols
Boris Khesin (1993)
Recherche Coopérative sur Programme n°25
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Boris Khesin (1993)
Recherche Coopérative sur Programme n°25
Similarity:
E. Zenhder (1975)
Publications mathématiques et informatique de Rennes
Similarity:
Popescu, Marcela, Popescu, Paul (2002)
Balkan Journal of Geometry and its Applications (BJGA)
Similarity:
Misha Bialy, Leonid Polterovich (1992)
Mathematische Annalen
Similarity:
Henryk Żołądek (2011)
Banach Center Publications
Similarity:
The first and the second Painlevé equations are explicitly Hamiltonian with time dependent Hamilton function. By a natural extension of the phase space one gets corresponding autonomous Hamiltonian systems in ℂ⁴. We prove that the latter systems do not have any additional algebraic first integral. In the proof equations in variations with respect to a parameter are used.
Gary Chartrand, S. F. Kapoor (1974)
Colloquium Mathematicae
Similarity:
Dragt, Alex J. (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Demovič, A. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Jens-P. Bode, Anika Fricke, Arnfried Kemnitz (2015)
Discussiones Mathematicae Graph Theory
Similarity:
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity...
Jianxiang Cao, Minyong Shi, Lihua Feng (2016)
Discussiones Mathematicae Graph Theory
Similarity:
The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 ∪ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v ∈ Vi, i ∈ {0, 1}, any edge e ∈ E(G − v), there is a Hamiltonian path containing e in G − v between any two vertices of V1−i. In this paper, we prove that BHn...
Roman Golovko (2022)
Archivum Mathematicum
Similarity:
In this note we construct examples of closed connected Legendrian submanifolds in high dimensional contact vector space that admit an arbitrary finite number of topologically distinct infinite families of diffeomorphic, but not Hamiltonian isotopic exact Lagrangian fillings.
L. Polterovich, M. Bialy (1992)
Geometric and functional analysis
Similarity:
Chavchanidze, G. (2003)
Georgian Mathematical Journal
Similarity:
Simonetta Abenda, Tamara Grava (2005)
Annales de l’institut Fourier
Similarity:
We derive the modulation equations (Whitham equations) for the Camassa-Holm (CH) equation. We show that the modulation equations are hyperbolic and admit a bi-Hamiltonian structure. Furthermore they are connected by a reciprocal transformation to the modulation equations of the first negative flow of the Korteweg de Vries (KdV) equation. The reciprocal transformation is generated by the Casimir of the second Poisson bracket of the KdV averaged flow. We show that...