Detecting nonclassicality of light via Lieb's concavity

Nonclassical light states are important for both conceptual and practical reasons: they are basic ingredients in testing and exploring quantum foundations, and are crucial resources in quantum technologies. Various useful criteria have been developed to detect nonclassicality in the literature, and several meaningful measures of nonclassicality have been introduced and measured experimentally. In this work, by use of a non-Hermitian generalization of the Wigner-Yanase-Dyson skew information and playing with operator ordering in evaluating average photon number, we develop a novel family of criteria for detecting nonclassicality of light based on Lieb's concavity, which is a deep and powerful result concerning interaction between quantum states and observables. We elucidate the information-theoretic as well as the physical meaning of the criteria, and illustrate their effectiveness in capturing and quantifying nonclassicality of various important light states.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

一类二阶三点边值问题单调正解的存在性

利用范数形式的锥上不动点定理,研究了一类二阶微分方程三点边值问题单调正解的存在性．分别给出了齐次和非齐次边界条件下的三点边值问题单调正解存在的充分条件,确定了解曲线的凹凸性,并且给出了一个应用实例．     

Cyclic networks with general blocking and starvation

We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k₁..., k_m) subject to a fixed total buffer capacityK=k ₁ +... + k_m. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818.     

Dynamic complexity of optimal paths and discount factors for strongly concave problems

We study the relationship between the dynamical complexity of optimal paths and the discount factor in general infinite-horizon discrete-time concave problems. Given a dynamic systemx _t+1=h(x _t ), defined on the state space, we find two discount factors 0 < ^{* **} < 1 having the following properties. For any fixed discount factor 0 < < ^*, the dynamic system is the solution to some concave problem. For any discount factor ^** < < 1, the dynamic system is not the solution to any strongly concave problem. We prove that the upper bound ^** is a decreasing function of the topological entropy of the dynamic system. Different upper bounds are also discussed.This research was partially supported by MURST, National Group on Nonlinear dynamics in Economics and Social Sciences. The author would like to thank two anonymous referees for helpful comments and suggestions.     

Lipschitz Continuity and Interpolation Properties of Some Classes of Increasing Functions

We study local Lipschitz continuity and interpolation properties of some classes of increasing functions defined on the cone Rⁿ ₊₊ of n-vectors with positive coordinates. We also study the so-called self-conjugate increasing positively homogeneous functions.     

借助几何图形理解高等数学中的抽象概念和结论

高等数学的很多内容比较抽象,学生不易理解.通过几个例子说明如何将抽象的数学概念和结论与几何图形有机的结合起来,加深对这些概念结论的理解,激发学生的学习兴趣.     

σ2 Hessian方程的Pogorelov型C2 内估计及应用

提出利用拉格朗日乘子法重新证明σ2算子的最优凹性,并定义了一个凸锥Γ3?=λ=(λ1,λ2,?,λn)∈Rn:σ1(λ)>0,σ2(λ|i)>0,1≤i≤n。利用σ2算子的最优凹性，给出了σ2Hessian方程Pogorelov型C2内估计，进而证明了σ2(D2u(x))=1,x∈Rn的满足二次多项式增长条件的Γ3?-凸整解为二次多项式。