Convex Hamiltonian energy surfaces and their periodic trajectories

In this paper we introduce symplectic invariants for convex Hamiltonian energy surfaces and their periodic trajectories and show that these quentities satisfy several nontrivial relations. In particular we show that they can be used to prove multiplicity results for the number of periodic trajectories.This paper represents results obtained while holding a visiting position at the Courant Institute for Mathematical Sciences, New YorkResearch partially supported by NSF Grant No. DMS-8603149 and a Rutgers University Research Council Grant     

Chromatographic separation map and incremental relationships in the method of relative analysis of retention under HPLC conditions

It was demonstrated that the correlations between the logarithms of the retention factors for various pairs of substances being linear makes it possible to plot and analyze maps of separation of complex mixtures at various mobile phase compositions on the basis of two measurements at the boundaries of the eluent composition range. Applied to the available experimental data, the relative analysis of retention showed that the use of incremental relationships in the form of the difference between the retention parameters for the corresponding substances at a given mobile phase composition is incorrect. A substantiation of the new method was presented.     

The thermodynamic properties of Ln2BaO4 (Ln = Sm, Dy, Ho)

The thermodynamic properties of the Ln₂BaO₄ phases (Ln = Dy, Ho, Sm) were studied by the electromotive force method with a fluoride electrolyte (890–1180 K), solution calorimetry in 1.07 N hydrochloric acid at 298.15 K, and differential scanning calorimetry (298–860 K). The experimental data were jointly processed, and the thermodynamic functions of the compounds over the temperature range 298–1200 K were calculated.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.