The Hamilton-Jacobi equation revisited

A new analysis of the nature of the solutions of the Hamilton-Jacobi equation of classical dynamics is presented based on Caratheodory’s theorem concerning canonical transformations. The special role of a principal set of solutions is stressed, and the existence of analogous results in quantum mechanics is outlined.

Hamilton's theory of turns revisited

We present a new approach to Hamilton's theory of turns for the groups SO(3) and SU(2) which renders their properties, in particular their composition law, nearly trivial and immediately evident upon inspection. We show that the entire construction can be based on binary rotations rather than mirror reflections.

Phase space methods and the Hamilton-Jacobi form of dynamics

A general analysis of the Hamilton-Jacobi form of dynamics motivated by phase space methods and classical transformation theory is presented. The connection between constants of motion, symmetries, and the Hamilton-Jacobi equation is described.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

USEFUL EXTENSIONS OF THE HENRY REACTION: EXPEDITIOUS ROUTES TO NITROALKANES AND NITROALKENES IN AQUEOUS MEDIA

The products of the Henry nitroaldol reaction from nitromethane and several aldehydes were reduced to the corresponding nitroalkanes with (n-Bu)(3)SnH in water under microwave irradiation (80 degrees C/10 min), or dehydrated to the corresponding nitroalkenes with K2CO3 in water (generally 0-5 degrees C/20 min). Both ``one-pot'' reactions occur in excellent yields across a range of aliphatic and aromatic (including heteroaromatic) substrates. It seems likely that the deoxygenation of the nitroaldols occurs via coordination of an oxygen atom of the nitro group with a tin atom, which facilitates hydride delivery in the transition state. The elimination of water from the nitroaldols in mild base is likely driven by the stability of the conjugated nitroalkene products. The elimination required workup with 2N HCl, which likely displaces a nitroalkane-nitroalkene equilibrium towards the latter. These extensions of the Henry reaction lead to products not easily obtained otherwise.