SINGULAR BOUNDARY PROPERTIES OF HARMONIC FUNCTIONS AND FRACTAL ANALYSIS

ＳＩＮＧＵＬＡＲＢＯＵＮＤＡＲＹＰＲＯＰＥＲＴＩＥＳＯＦＨＡＲＭＯＮＩＣＦＵＮＣＴＩＯＮＳＡＮＤＦＲＡＣＴＡＬＡＮＡＬＹＳＩＳＷＥＮＺＨＩＹＩＮＧＺＨＡＮＧＹＩＰＩＮＧＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＪａｎｕａｒｙ１１，１９９５．Ｒｅｖｉ...     

第I类非自共轭锥上的Gamma函数

本文将Ｇａｍｍａ函数及Ｓｉｅｇｅｌ积分推广到一般的第Ｉ类非自共轭锥上．作为其应用，显式给出了以这些锥为底的管状域（或第一类Ｓｉｅｇｅｌ域）的Ｃａｕｃｈｙ Ｓｚｅｇ¨ｏ核和形式Ｐｏｉｓｏｎ核．     

n进制中非零数字之积函数的均值公式

设 N =a1nk1+ a2 nk2 +… + asnks( 1 aik2 >… >ks 0 ) ,a( N,n) =a1a2 … as,本文给出了均值 Ar( N ,n) =∑m相似文献   

CD生产函数与CES生产函数的几点比较

本文对ＣＤ生产函数与ＣＥＳ生产函数进行了几个方面的比较分析，以便于实际运用中的选择。     

弱1—凸对策及其解的性质

本文提出了一类特殊的ｎ人合作对策模型─—弱１—凸对策，研究了弱１—凸对策的解的性质，并证明弱１—凸对策的解满足所有常见的公理化特征．     

用多路逆磁系统测量热电子环磁镜中热电子沿轴向的分布

本文介绍了多路逆磁测量方法及利用这一方法在ＨＥＲ装置上测量热电子环沿轴向的长度与晃荡电子密度的轴向分布的实验结果。     

The universal nilpotent group compactification of a semigroup

The purpose of this paper is to introduce an algebra of functions on a semitopological semigroup and to study these functions from the point of view of universal semigroup compactification. We show that the corresponding semigroup compactification of this algebra is universal with respect to the property of being a nilpotent group.

     

谐振子薛定谔方程的简单解法

物质的许多物理与化学性质都可以用线性谐振子模型解释，本文用简单的数学运算求解线性谐振子的薛定谔方程，避免了特殊函数等复杂的数学运算，得出了量子力学教材完全相同的结果。     

三系数有限元向量尺度函数的构造

The aim of this paper is to present construction of finite element multiscaling function with three coefficients. In order to illuminate the result, two examples are given finally.     

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.