Percolation in strongly correlated systems: The massless Gaussian field

We derive a number of new results for correlated nearest neighbor site percolation onZ ^d. We show in particular that in three dimensions the strongly correlated massless harmonic crystal, i.e., the Gaussian random field with mean zero and covariance –, has a nontrivial percolation behavior: sites on whichS _x h percolate if and only ifh _c . with0 _c < . This provides the first rigorous example of a percolation transition in a system with infinite susceptibility.     

The symmetry of ground states under perturbation

We consider a two-body potential which has only periodic ground states and prove that it can be perturbed, by an arbitrarily small perturbation, so as to have only aperiodic ground states.Research supported in part by NSF grant MCS 78-01520-A01.     

带有扰动非线性源的多孔介质方程的近似泛函分离变量

讨论了带有扰动非线性源的多孔介质方程的近似泛函分离变量问题. 给出了该类方程容许近似泛函分离变量解的完全分类. 举例阐述了近似泛函分离变量解的求解步骤,获得了分类方程的近似泛函分离变量解.     

非Chetaev型变质量非完整系统的Lie对称性与Noether对称性

研究非Chetaev型变质量非完整系统的Lie对称性与Noether对称性以及其间的 关系,给出Lie对称性导致Noether对称性以及Noether对称性导致Lie对称性的条件.     

中国股票市场波动特性的实证研究

本文以上证综指和深成分指数的日收益率为研究对象 ,应用 GARCH、TARCH模型理论 ,进一步分析了日收益率波动的条件异方差性、非对称性 ,同时比较了两个股票市场的不同波动特征     

The ground state for sticky disks

It is proven that the ground state of the two-dimensional sticky potential is the triangular lattice.Research supported in part by NSF grant MCS 78-01520-A01.     

Localizations of Transfors

Let be n-dimensional teisi, i.e., higher-dimensional Gray-categorical structures. The following questions can be asked. Does a left q-transfor , i.e., a functor 2 _q , induce a right q-transfor , i.e., a functor More generally, does a functor induce a functor For k-arrows c and whose (k – 1)-sources and targets agree, does a q-transfor induce a q-transfor , for appropriate k-arrows For k-arrows c and whose (k – 1)-sources and targets agree, does a q-transfor induce a (q + k + 1)-transfor , for appropriate k-arrows I give answers to these questions in the cases where n-dimensional teisi and their tensor product have been defined, i.e., for n 3, and for n up to 5 in some cases that do not need all data and axioms of n-dimensional teisi.I apply the above to compositions in teisi, in particular to braidings and syllepses. One of the results is that a braiding on a monoidal 2-category induces a pseudo-natural transformation , where is the reverse of ? –, which is almost, but not quite, equal to – ?. However, in higher dimensions need not be reversible, so a braiding on a higher-dimensional tas can not be seen as a transfor A B B A.     

Invariant Simultaneous Solutions of Evolution Equations of Integrable Hierarchies

We construct classical point symmetry groups for joint pairs of evolution equations (systems of equations) of integrable hierarchies related to the auxiliary equation of the method of the inverse problem of second order. For the two cases: the hierarchy of Korteweg--de Vries (KdV) equations and of the systems of Kaup equations, we construct simultaneous solutions invariant with respect to the symmetry group. The problem of the construction of these solutions can be reduced, respectively, to the first and second Painlevé equations depending on a parameter. The Painlevé equations are supplemented by the linear evolution equations defining the deformation of the solution of the corresponding Painlevé equation.     

Absence of continuous symmetry breaking in a one-dimensional n−2 model

For a one-dimensional array ofS ^N–1 spins (N 2) with isotropic pair interactions (and more general systems) with J(j–i) obeying sup_n[n^–1 ₁ ⁿ j ²|J(j)|]<, we prove that every equilibrium state is invariant under the natural action ofSO(N). In particular, there is no long-range order of the conventional type. Included is the caseJ(n)=n ^–2.Research partially supported by U.S.N.S.F. Grant No. MCS-78-01885.S. Fairchild Scholar at Caltech. On leave from Departments of Mathematics and Physics, Princeton University, Princeton, New Jersey 08544.     

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.