A direct proof of a theorem by Kolmogorov in hamiltonian systems

L. Chierchia; C. Falcolini

Displaying similar documents to “A direct proof of a theorem by Kolmogorov in hamiltonian systems”

Determination of Large Families and Diameter of Equiseparable Trees

Zoran Stanić (2006)

Publications de l'Institut Mathématique

Similarity:

Thompson's group $F (n)$ is not minimally almost convex.

Wladis, Claire (2007)

The New York Journal of Mathematics [electronic only]

Similarity:

On the rules for the elimination of the non-canonical Morgan trees

Damir Vukičević (2009)

Kragujevac Journal of Mathematics

Similarity:

Bijective counting of tree-rooted maps and shuffles of parenthesis systems.

Bernardi, Olivier (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On Catalan trees and the Jacobian conjecture.

Singer, Dan (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The triangles method to build $X$ -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A method to infer $X$ -trees (valued trees having $X$ as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2 $n$ -3 distance values between the $n$ elements of $X$ , if they fulfill some explicit conditions. This construction is based on the mapping between $X$ -tree and a weighted generalized 2-tree spanning $X$ .

Noncrossing trees and noncrossing graphs.

Chen, William Y.C., Yan, Sherry H.F. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Reconstruction of a tree from certain maximal proper subtrees

Ladislav Nebeský (1974)

Časopis pro pěstování matematiky

Similarity: