Cauchy-Riemann方程的Riemann-Hilbert边值问题

本文考虑多柱域上非齐次的Cauchy-Riemann方程的Riemann-Hilbert边值问题.讨论了上述边值问题可解的充分必要条件,并给出了边值问题解的积分表达式.     

Koch曲线上的齐次Riemann边值问题

当L为典型的分形曲线一Koch曲线时,提出了Riemann边值问题,但在一般情况下,在Koch曲线上所做的Cauchy型积分无意义.当对已知函数G(z),g(z)增加一定的解析条件,同时利用一列Cauchy型积分的极限函数,对定义在Koch曲线上的齐次Riemann边值问题进行了讨论,并得到与经典解析函数边值问题相类似的结果.     

一类变系数非齐次调和方程边值问题的级数解

利用由三角级数和幂级数复合构成的函数项级数的有关性质,得到了一类变系数非齐次调和方程边值问题的级数解.使变系数非齐次调和方程边值问题的求解有了新的进展.     

一阶椭圆型复方程组Riemann—Hibert边值问题

本文以解析函数的边值问题Ｂ的解的存在性为基础，根据它们的先验估计式及利用参数开拓法，导出了满足条件Ｃ的多个复变量的一阶拟线性椭圆型复方程组的Ｒｉｅｍａｎｎ－Ｈｉｂｅｒｔ边值问题的可解条件，并给出了解的积分表达式。     

非齐次微分方程两点边值问题正解的存在性及多重性

本文考虑一类非齐次微分方程的两点边值问题,得到了一些有关其正解存在性与多重性的精确条件．     

化波动方程的非齐次边界为齐次边界

在一维波动方程初边值问题中,通过构造辅助函数的方法,分类将各种非齐次边界条件转化为齐次边界条件.     

边界过原点的任意半平面中的Hilbert边值问题

给出了边界过原点的任意半平面中的Hilbert边值问题的提法,定义了函数的一种对称扩张,并利用这种对称扩张将此Hilbert边值问题转化为无穷直线上的Riemann边值问题,得到了该问题的一般解和可解性定理.     

单准周期的Riemann边值问题

本文研究了光滑封闭曲线情况下的加法与乘法单准周期Riemann边值问题,运用保角变换的方法,获得了单准周期函数的一些性质,并且对解在无穷远处作适当要求下给出了单准周期边值问题的解法.     

四元数分析中的T算子与两类边值问题

本文研究四元数分析中的非齐次 Ｄｉｒａｃ方程．引入了这类方程的分布解即 Ｔ算子,证明了Ｔ算子的一些性质并考察了非齐次Ｄｉｒａｃ方程的Ｄｉｒｉｃｈｌｅｔ边值问题,并将结果推广到高阶非齐次Ｄｉｒａｃ方程及这种方程的一类边值问题的情况．     

非正则型Hilbert边值问题

本文考虑了解析函数非正则型的Hilbert边值问题．利用对称扩张法将问题化为等价的正则型Riemann边值问题，获得了问题的通解及可解性条件，同时给出了问题可解的一个必要条件．     

多元多项式齐次方程组的一个解法

本文对多元多项式齐次方程组给出一种解法，并给出其解子模的基所含向量的个数在最坏情况时的下界。     

SOLUTION OF A RESEARCH PROBLEM

ＳＯＬＵＴＩＯＮＯＦＡＲＥＳＥＡＲＣＨＰＲＯＢＬＥＭＷＵＳＨＩＱＵＡＮ（巫世权）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｔｉｏｎａｌＵｎｉｖｅｒｓｉｔｙｏｆＴｅｃｈｎｏｌｏｇｙ，Ｃｈａｎｇｓｈａ４１００７３，Ｃｈｉｎａ）Ａｂｓｔｒａｃｔ...     

The Siegel norm,the length function and character values of finite groups

In this paper we present some new results on the connection between the Siegel norm, the length function and irreducible character values of finite groups. In addition, we provide algorithms to compute the length of a cyclotomic integer and the set of cyclotomic integers with Siegel norm bounded by a given positive real number.     

The Formula of General Term of the Sum of Equal Powers of Natural Numbers

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＴｏｆｉｎｄｔｈｅｇｅｎｅｒａｌｔｅｒｍｆｏｒｍｕｌａｏｆｃａｌｃｕｌａｔｉｎｇｗａｓａｎｏｌｄｅｓｔｐｒｏｂｌｅｍｉｎＮｕｍｂｅｒＴｈｅｏｒｙ．Ｅａｒｌｙｉｎ３００Ｂ．Ｃ．,Ａｒｃｈｉｍｅｄｏ,ｔｈｅｍａｔｈｅｍａｔｉｃｉａｎｏｆａｎｃｉｅｎｔＧｒｅｅｃｅ,ｗｏｒｋｅｄｏｕｔｔｈｅｆｏｒｍｕｌａ∑ｎｋ＝１ｋ＝ｎ（ｎ＋１）２ａｎｄ∑ｎｋ＝１ｋ２＝ｎ（ｎ＋１）（２ｎ＋１）６．Ｓｏｆａｒ,ｐｅｏｐｌｅｈａｖｅｇｏｔｍａｎｙｆｏｒｍｓｏｆｅｐｒｅｓｓｉｏｎｏｆｔｈｅｇｅ…     

The diffeomorphic types of the complements of arrangements in CP~3Ⅱ

For any arrangement of hyperplanes in CP~3,we introduce the soul of this arrangement. The soul,which is a pseudo-complex,is determined by the combinatorics of the arrangement of hyper- planes.In this paper,we give a sufficient combinatoric condition for two arrangements of hyperplanes to be diffeomorphic to each other.In particular we have found sufficient conditions on combinatorics for the arrangement of hyperplanes whose moduli space is connected.This generalizes our previous result on hyperplane point arrangements in CP~3.     

用AHP法建立教学质量评估体系

以AHP为理论基础,结合Delphi方法,对高校教师教学质量评估体系进行尝试性建构。通过构建结构→个体判断→群判断处理→量化指标体系生成的分步操作,来达到科学、民主、公正、客观的评价目标。     

The diffeomorphic types of the complements of arrangements in ??3 II

For any arrangement of hyperplanes in ℂℙ³, we introduce the soul of this arrangement. The soul, which is a pseudo-complex, is determined by the combinatorics of the arrangement of hyperplanes. In this paper, we give a sufficient combinatoric condition for two arrangements of hyperplanes to be diffeomorphic to each other. In particular we have found sufficient conditions on combinatorics for the arrangement of hyperplanes whose moduli space is connected. This generalizes our previous result on hyperplane point arrangements in ℂℙ³. This work was partially supported by NSA grant and NSF grant     

A generalization of Alon–Aydinian–Huang theorem

Let $S_{n,k}^m$ be the collection of sets of real numbers of size n, in which every subset of size larger than k has a sum less than m, where $n\ge k+1$, and m is some real number. Denote by $a_{n,k}^m$ the maximum number of nonempty subsets of a set in $S_{n,k}^m$ with a sum at least m. In particular, when $m=0$, Alon, Aydinian, Huang ((2014) [1]) proved that $a_{n,k}^0={\sum }_{i=0}^{k?1}\left(\begin{array}{c}n?1\\ i\end{array}\right)$, where two technical proofs, based on a weighted version of Hall's theorem and an extension of the nonuniform Erd?s–Ko–Rado theorem, were presented. In this note, we extend their elegant result from $m=0$ to any real number m, and show that $a_{n,k}^m=\{\begin{array}{cc}{\sum }_{i=0}^{k?1}\left(\begin{array}{c}n?1\\ i\end{array}\right)\hfill & \text{ if }m\ge 0\hfill \\ {\sum }_{i=1}^k\left(\begin{array}{c}n\\ i\end{array}\right)\hfill & \text{ if }m<0\hfill \end{array}$. Our proof is obtained by exploring the recurrence relation and initial conditions of $a_{n,k}^m$.     

A Note on the Theorems of Church-Turing and Trachtenbrot

We sketch proofs of the theorems of Church-Turing and Trachtenbrot using a semi-monomorphic axiomatization. Mathematics Subject Classification : 03B10, 03B25.