Starting from the three-dimensional hydrostatic primitive equations, we derive Hamiltonian N–layer models with isentropic tropospheric and isentropic or isothermal stratospheric layers. Our construction employs a new parcel Hamiltonian formulation which describes the fluid as a continuum of Hamiltonian ordinary differential equations bound together by integral transport laws. In particular, we ...

Let G be a graph and H be a subgraph of G. If G contains a hamiltonian cycle C such that E(C)∩E(H) is empty, we say that C is an H-avoiding hamiltonian cycle. Let F be any graph. If G contains an H-avoiding hamiltonian cycle for every subgraph H of G such that H ∼= F , then we say that G is F -avoiding hamiltonian. In this paper, we give minimum degree and degree-sum conditions which ensure tha...

In this paper we develop a fractional Hamiltonian formulation for dynamic systems defined in terms of fractional Caputo derivatives. Expressions for fractional canonical momenta and fractional canoni-cal Hamiltonian are given, and a set of fractional Hamiltonian equations are obtained. Using an example, it is shown that the canonical fractional Hamiltonian and the fractional Euler-Lagrange form...

There are many evolution partial differential equations which can be cast into Hamiltonian form. Conservation laws of these equations are related to one–parameter Hamiltonian symmetries admitted by the PDEs [1]. The same result holds for semidiscrete Hamiltonian equations [2]. In this paper we consider semidiscrete canonical Hamiltonian equations. Using symmetries, we find conservation laws for...

An overview of Hamiltonian systems with noncanonical Poisson structures is given. Examples of bi-Hamiltonian ode's, pde's and lattice equations are presented. Numerical integrators using generating functions, Hamiltonian splitting, symplectic Runge-Kutta methods are discussed for Lie-Poisson systems and Hamiltonian systems with a general Poisson structure. Nambu-Poisson systems and the discrete...

A graph is hamiltonian if it has a hamiltonian cycle. It is well-known that Tutte proved that any 4connected planar graph is hamiltonian. It is also well-known that the problem of determining whether a 3-connected planar graph is hamiltonian is NP-complete. In particular, Chvátal and Wigderson had independently shown that the problem of determining whether a maximal planar graph is hamiltonian ...

Given the two boson representation of the conformal algebra Ŵ∞, the second Hamiltonian structure of the KP hierarchy, I construct a bi-Hamiltonian hierarchy for the two associated currents. The KP hierarchy appears as a composite of this new and simpler system. The bi-Hamiltonian structure of the new hierarchy gives naturally all the Hamiltonian structures of the KP system.

We show that the supersymmetric nonlinear Schrödinger equation is a bi-Hamiltonian integrable system. We obtain the two Hamiltonian structures of the theory from the ones of the supersymmetric two boson hierarchy through a field redefinition. We also show how the two Hamiltonian structures of the supersymmetric KdV equation can be derived from a Hamiltonian reduction of the supersymmetric two b...

A method of deriving a Hamiltonian from a tree that can be used for fast symplectic maps of N-body systems is presented. A full description of the Hamiltonian is given along with how the derivatives of that Hamiltonian can be used to implement a symplectic map based upon it. Results show that this alternate Hamiltonian can be used in place of the full Hamiltonian on some simple systems without ...

In this paper, we first introduce a novel class of graphs, namely supergrid. Supergrid graphs include grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for grid graphs and triangular grid graphs were known to be NP-complete. However, they are unknown for supergrid graphs. The Hamiltonian cycle (path) problem on supergrid graphs can be applied to ...