von Neumann’s trace inequality for Hilbert–Schmidt operators

von Neumann’s inequality in matrix theory refers to the fact that the Frobenius scalar product of two matrices is less than or equal to the scalar product of the respective singular values. Moreover, equality can only happen if the two matrices share a joint set of singular vectors, and this latter part is hard to find in the literature. We extend these facts to the separable Hilbert space setting, and provide a self-contained proof of the “latter part”.     

相对论性无自旋粒子在Hartmann势场中运动的精确解

在标量势等于矢量势的条件下,本文获得了具有Hartmann型势的Klein-Gordon方程的精确解.给出了束缚态的精确的能谱方程和归一化的径向波函数,对于散射态,获得了按“k/2π标度”归一化的径向波函数和相移的解析计算公式.讨论了散射振幅的解析性质和波函数、能谱方程以及相移的非相对论近似.     

On the distribution singular values of Toeplitz matrices

We prove a second order formula concerning distribution of singular values of Toeplitz matrices in some cases when conditions of the H. Widom Theorem are not satisfied.

     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

有界变量线性规划的基线算法

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。文中根据基线算法的算法原理，通过对BL表的旋转，在各变量满足界约束的条件下，使目标函数值不断增大，直至得到有界硬上界，从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤，并给出了一个例子。与单纯形法相比，采用基线算法解有界变量线性规划操作更简单。迭代次数少，解题速度更快。     

Extremes of deterministic sub‐sampled moving averages with heavy‐tailed innovations

Let {X_k}_k?1 be a strictly stationary time series. For a strictly increasing sampling function g:?→? define Y_k=X_g(k) as the deterministic sub‐sampled time series. In this paper, the extreme value theory of {Y_k} is studied when X_k has representation as a moving average driven by heavy‐tailed innovations. Under mild conditions, convergence results for a sequence of point processes based on {Y_k} are proved and extremal properties of the deterministic sub‐sampled time series are derived. In particular, we obtain the limiting distribution of the maximum and the corresponding extremal index. Copyright © 2003 John Wiley & Sons, Ltd.     

Resolution of Some Open Problems Concerning Multiple Zeta Evaluations of Arbitrary Depth

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst–Zagier formula. Other results we provide settle three of the remaining outstanding conjectures of Borwein, Bradley, and Broadhurst. A complete treatment of a certain arbitrary depth class of periodic alternating unit Euler sums is also given.