Reduction of Hamiltonian Systems, Affine Lie Algebras and Lax Equations II.
M. Semenov-Tian-Shansky, A.G. Reyman (1981)
Inventiones mathematicae
Similarity:
Displaying similar documents to “Completely Integrable Hamiltonian Systems Connected with Semisimple Lie Algebras.”
Reduction of Hamiltonian Systems, Affine Lie Algebras and Lax Equations II.
Reduction of Hamiltonian Systems, Affine Lie Algebras and Lax Equations.
A.G. Reymann, M. Semenov-Tian-Shansky (1979)
Inventiones mathematicae
Similarity:
Modifying Lax Equations and the Second Hamiltonian Structure.
B.A. Kupershmidt, George Wilson (1980/81)
Inventiones mathematicae
Similarity:
Normal Modes for Nonlinear Hamiltonian Systems.
Alan Weinstein (1973)
Inventiones mathematicae
Similarity:
Picard-Lefschetz theory for the coadjoint quotient of a semisimple Lie algebra.
W. Rossmann (1995)
Inventiones mathematicae
Similarity:
A Lie connection between Hamiltonian and Lagrangian optics.
Dragt, Alex J. (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Drinfeld-Sokolov hierarchies on truncated current Lie algebras
Paolo Casati (2011)
Banach Center Publications
Similarity:
In this paper we construct on truncated current Lie algebras integrable hierarchies of partial differential equations, which generalize the Drinfeld-Sokolov hierarchies defined on Kac-Moody Lie algebras.
Highest Weights of Semisimple Lie Algebras
W. Laskar (1977)
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:
Monstrous moonshine and monstrous Lie superalgebras.
Richard E. Borcherds (1992)
Inventiones mathematicae
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...