On Hermitian block Hankel matrices,matrix polynomials,the Hamburger moment problem,interpolation and maximum entropy

Reproducing kernel space methods are used to study the truncated matrix Hamburger moment problem on the line, an associated interpolation problem and the maximum entropy solution. Enroute a number of formulas are developed for orthogonal matrix polynomials associated with a block Hankel matrix (based on the specified matrix moments for the Hamburger problem) under less restrictive conditions than positive definiteness. An analogue of a recent formula of Alpay-Gohberg and Gohberg-Lerer for the number of roots of certain associated matrix polynomials is also established.The author would like to acknowledge with thanks Renee and Jay Weiss for endowing the chair which supported this research.     

Measurement of the spin and temperature dependence of ddµ molecule formation rate in solid and liquid deuterium

The ddµ molecule formation rate is experimentally measured for the two hyperfine states of the dµ-atom in the temperature range of 5–30 K. Results are consistent with a preliminary measurement by the TRIUMF group and contradict theoretical predictions. The work has been performed on the JINR phasotron (Dubna).     

Range convexity,continuity, and strategy-proofness of voting schemes

A voting scheme assigns to each profile of alternatives reported byn individuals a compromise alternative. A voting scheme is strategy-proof if no individual is better off by lying, i.e., not reporting a best alternative. In this paper the main results concern the case where the set of alternatives is the Euclidean plane and the preferences are Euclidean. It is shown that for strategy-proof voting schemes continuity is equivalent to convexity of the range of the voting scheme. Using a result by Kim and Roush (1984), this leads to characterizations of surjective or unanimous, anonymous, strategy-proof voting schemes.Furthermore, the paper contains an extensive discussion of related results in the area.