凸序列不等式的控制证明

利用控制不等式理论简洁地证明了一类凸序列不等式 (包括著名的 Nanson不等式的几个推广 ) ,并给出若干应用 .     

Proof of the Mixing Theorem for Statistical Systems in Classical Physics

In a general measure-theoretic context, it is proved that the action of a stochastic map on a pair of probability distributions can be characterized by the criterion of decreasing mixing distance.     

一类联图的距离谱半径以及盖理论（英文）

令X=(n₁,n₂,…,n_t),Y=(m₁,m₂,…,m_t)是两个t维递减序列.如果对所有的j,1≤j≤t,都有∑_i=1~j、n_i≥∑_i=1~j m_i以及∑_i=1~t n_i=∑_i=1~t m_i,则称X可盖Y,记作X■Y.如果X≠Y,则记作X■Y.本文考虑联图G(n₁,n₂,…,n_t;a)=(K_n1∪_n2∪…∪K_nt)∨K_a的谱半径,这里n₁+n₂+…+n_t+a=n,(n₁,n     

Muirhead-Rado inequality for compact groups

Muirhead’s majorization inequality was extended by Rado to the case of arbitrary permutation groups. We further generalize this inequality to compact groups and their linear representations over the reals. We characterize saturation of the inequality, and describe the saturation condition in detail for the case of actions on Hermitian operators. Supported in part by the National Science Foundation and the Center for the Mathematics of Information.     

Symmetric nonnegative realizability via partitioned majorization

A sufficient condition for symmetric nonnegative realizability of a spectrum is given in terms of (weak) majorization of a partition of the negative eigenvalues by a selection of the positive eigenvalues. If there are more than two positive eigenvalues, an additional condition, besides majorization, is needed on the partition. This generalizes observations of Suleǐmanova and Loewy about the cases of one and two positive eigenvalues, respectively. It may be used to provide insight into realizability of 5-element spectra and beyond.     

Extraction of subsystems “Majorized” by the rademacher system

In this paper it is proved that from any uniformly bounded orthonormal system {f _n} _n=1 ^∞ of random variables defined on the probability space (Ω, ε, P), one can extract a subsystem {fni} _i ^{Emphasis>=1/∞} majorized in distribution by the Rademacher system on [0, 1]. This means that {

Simple bounds for closed queueing networks

Consider a closed Jackson type network in which each queue has a single exponential server. Assume that N customers are moving among k queues. We establish simple closed form bounds on the network throughput (both lower and upper), which are sharper than those that are currently available. Numerical evaluation indicates that the improvements are significant.     

An extension of a convexity theorem of the generalized numerical range associated with

For any , let be the following subset of :

We show that if , then is always convex. When , it is an ellipsoid, probably degenerate. The convexity result is best possible in the sense that if we have defined similarly, then there are examples which fail to be convex when and .

The set is also symmetric about the origin for all , and contains the origin when . Equivalent statements of this result are given. The convexity result for is similar to Au-Yeung and Tsing's extension of Westwick's convexity result for .

     

Linear maps preserving group majorization

A necessary and sufficient condition for a linear map to preserve group majorizations is given. The condition is applied to prove some preservation results.     

反向Chrystal不等式

利用控制不等式理论建立了三个反向Chrysta l不等式,并给出了若干应用.