On the Weak Invariance Principle for Stationary Sequences under Projective Criteria

In this paper, we study the central limit theorem and its weak invariance principle for sums of a stationary sequence of random variables, via a martingale decomposition. Our conditions involve the conditional expectation of sums of random variables with respect to the distant past. The results contribute to the clarification of the central limit question for stationary sequences. Magda Peligrad is supported in part by a Charles Phelps Taft research support grant at the Univeristy of Cincinnati and the NSA grant H98230-05-1-0066.     

树映射的分布混沌

设T是个有限树,f是T上的连续映射．证明了f是分布混沌的当且仅当它的拓扑熵是正数．一些已知结论得到了改进．     

火工品可靠性试验数据的综合分析方法

升降法试验数据和固定刺激量下的成败型试验数据,是两种最常见的火工品可靠性试验数据．我们应用Markov链,研究了升降法试验数据下,感度分布参数的极大似然估计的特性．在此基础上,应用Bootstrap方法和Bayes方法,给出了综合分析两种试验数据的方法．最后,将该方法应用于520底火的可靠性鉴定,得出了有益的结论．     

柱形分布的电荷产生的电势

将无限长线电荷看成二维平面上的一个“源”,利用电势叠加原理计算了无限长柱形均匀分布的电荷产生的电势.这些柱体的截面电荷分布包括可解析表示和不可求解表示两种,后者可以通过数值计算给出结果.因此这种方法实际上可以计算任意截面柱形电荷分布的电势.通过计算,展示了各种电荷分布所产生电场的特性和共同特征.     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

Nonlinear Schrödinger equations with symmetric multi-polar potentials

This paper deals with a class of nonlinear elliptic equations involving a critical power-nonlinearity as well as a potential featuring multiple inverse square singularities. When the poles form a symmetric structure, it is natural we wonder how the symmetry affects such mutual interaction. The present paper means to study this aspect from the point of view of the existence of solutions inheriting the same symmetry properties as the set of singularities. Mathematics Subject Classification (2000) 35J60, 35J20, 35B33     

单轴晶体内表面入射e光线的双反射

基于光线遵从的Fermat原理,从几何学的角度讨论和分析了在单轴晶体中入射的e光线在界面上的双反射,得到了确定光线反射方向的一般公式,并对几种特殊情况进行了讨论.指出了上述结果与由电磁波的边界条件计算所得结果是一致的.     

Tunneling Radiation of a Torus-Like Black Hole in Anti-de Sitter Space-Time

An extension of the Parikh-Wilczek's semi-classical quantum tunneling method, the tunneling radiation of the charged particle from a torus-like black hole is investigated. Difference from the uncharged mass-less particle, the geodesics of the charged massive particle tunneling from the black hole is not light-like, but determined by the phase velocity. The derived result shows that the tunneling rate depends on the emitted particle's energy and electric charge, and takes the same functional form as uncharged particle. It proves also that the exact emission spectrum is not strictly pure thermal, but is consistent with the underlying unitary theory. PACS Numbers: 04.70.Dy, 97.60.Lf, 05.30.Ch.     

Action Principle and Modification of the Faddeev–Popov Factor in Gauge Theories

The quantum action (dynamical) principle is exploited to investigate the nature and origin of the Faddeev–Popov (FP) factor in gauge theories without recourse to path integrals. Gauge invariant as well as gauge non-invariant interactions are considered to show that the FP factor needs to be modified in more general cases and expressions for these modifications are derived. In particular we show that a gauge invariant theory does not necessarily imply the familiar FP factor for proper quantization. PACS numbers: 11.15.-q; 12.10.-g; 12.15.-y; 12.38.-t     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016