A note on a connection between the Poincaré-Arnold-Melnikov integral and the Picard-Vessiot theory

Juan J. Morales-Ruiz

The search session has expired. Please query the service again.

Displaying similar documents to “A note on a connection between the Poincaré-Arnold-Melnikov integral and the Picard-Vessiot theory”

A simple proof of the non-integrability of the first and the second Painlevé equations

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.

A new hierarchy of integrable system of $1 + 2$ dimensions: from Newton's law to generalized Hamiltonian system. II.

Huang, Xuncheng, Tu, Guizhang (2006)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Generalized Hamiltonian dynamics after Dirac and Tulczyjew

Fiorella Barone, Renato Grassini (2003)

Banach Center Publications

Similarity:

Dirac's generalized Hamiltonian dynamics is given an accurate geometric formulation as an implicit differential equation and is compared with Tulczyjew's formulation of dynamics. From the comparison it follows that Dirac's equation-unlike Tulczyjew's-fails to give a complete picture of the real laws of classical and relativistic dynamics.

Hamiltonian Dynamics on Pseudodifferential Symbols

Boris Khesin (1993)

Recherche Coopérative sur Programme n°25

Similarity:

Andrew Lenard: a mystery unraveled.

Praught, Jeffery, Smirnov, Roman G. (2005)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

By Magri's theorem, self-dual gravity is completely integrable.

Nutku, Yavuz (2007)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

Hamiltonian Systems Close to Integrable Systems

E. Zenhder (1975)

Publications mathématiques et informatique de Rennes

Similarity:

A note on the Hamiltonian genus of a complete bipartite graph.

Demovič, A. (1995)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Splitting of separatrices in Hamiltonian systems with one and a half degrees of freedom.

Delshams, Amadeu, Seara, Tere M. (1997)

Mathematical Physics Electronic Journal [electronic only]

Similarity:

Improved Sufficient Conditions for Hamiltonian Properties

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...

Chvátal-Erdös type theorems

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant (2010)

Discussiones Mathematicae Graph Theory

Similarity:

The Chvátal-Erdös theorems imply that if G is a graph of order n ≥ 3 with κ(G) ≥ α(G), then G is hamiltonian, and if κ(G) > α(G), then G is hamiltonian-connected. We generalize these results by replacing the connectivity and independence number conditions with a weaker minimum degree and independence number condition in the presence of sufficient connectivity. More specifically, it is noted that if G is a graph of order n and k ≥ 2 is a positive integer such that κ(G) ≥ k, δ(G) >...

A note on the Song-Zhang theorem for Hamiltonian graphs

Kewen Zhao, Ronald J. Gould (2010)

Colloquium Mathematicae

Similarity:

An independent set S of a graph G is said to be essential if S has a pair of vertices that are distance two apart in G. In 1994, Song and Zhang proved that if for each independent set S of cardinality k+1, one of the following condition holds: (i) there exist u ≠ v ∈ S such that d(u) + d(v) ≥ n or |N(u) ∩ N(v)| ≥ α (G); (ii) for any distinct u and v in S, |N(u) ∪ N(v)| ≥ n - max{d(x): x ∈ S}, then G is Hamiltonian. We prove that if for each...

Output synchronization of multi-agent port-Hamiltonian systems with link dynamics

Bing Wang, Xinghu Wang, Honghua Wang (2016)

Kybernetika

Similarity:

In this paper, the output synchronization control is considered for multi-agent port-Hamiltonian systems with link dynamics. By using Hamiltonian energy function and Casimir function comprehensively, the design method is proposed to overcome the difficulties taken by link dynamics. The Hamiltonian function is used to handle the dynamic of agent, while the Casimir function is constructed to deal with the dynamic of link. Thus the Lyapunov function is generated by modifying the Hamiltonian...

On Hamiltonian properties of powers of special Hamiltonian graphs

Gary Chartrand, S. F. Kapoor (1974)

Colloquium Mathematicae

Similarity:

Degree sets for homogeneously traceable non-Hamiltonian graphs

Ronald J. Gould (1981)

Colloquium Mathematicae

Similarity:

On the construction of a $C^{2}$ -counterexample to the Hamiltonian Seifert conjecture in $ℝ^{4}$ .

Ginzburg, Viktor L., Gürel, Basak Z. (2002)

Electronic Research Announcements of the American Mathematical Society [electronic only]

Similarity:

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

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...