对偶L_p-质心体与Fourier变换

对p>0,Lutwak,Yang和Zhang引进了R~n中一个凸体K的对偶L_p~-质心体Γ_(-p)K.本文研究Γ_(-p)KΓ_(-p)L是否必定蕴涵vol_n(K)≤vol_n(L)的问题.我们的结果是Lutwak(p=1的情形)及Grinberg和Zhang(p>1的情形)关于L_(p~-)质心体算子Γ_p的类似问题的结果的对偶形式.     

样条插值的最优误差界和宽度问题(Ⅰ)

我们在 J 及 J~2中分别定义偏序如下:设,Γ_1.Γ_2∈J,若γ_i(1)≤γ_i(2),i=1,…,m;则称Γ_1≤Γ_2.当上式中全部成立等号时,记Γ_1=Γ_2,否则,记Γ_1<Γ_2.设(Γ_1,(?)_1)、(Γ_2,(?)_2)∈J~2,若Γ_1≤Γ_2及(?)_1≤(?)_2同时成立,则记(Γ_1,(?)_1)≤(Γ_2,(?)_2).当上两式均为等式时,就记(Γ_1,(?)_1)=(Γ_2,(?)_2),否则记(Γ_1,(?)_1)(?)(Γ_1,(?)_2).今后,我们还令:     

关于分圆多项式系数的注记

自然数m称为HΓ数,如果分圆多项式Fm(x)的系数只能是0或±1.本文研究自然数m成为HΓ数的条件,证明:如果p是素数,那么1)m=15p(p>5)为HΓ数的充分必要条件是p≡±1(mod30);2)m=21p(p>7)为HΓ数的充分必要条件是p≡±1,±11,±19(mod42);3)m=33p(p>11)为HΓ数的充分必要条件是p≡±1,±7,±25(mod66).     

双诱导映射(L)集合范畴的幂对象及子对象分类子探讨

引入双诱导映射(L)集合范畴的幂对象及子对象分类子的概念,并分别讨论它们的判别定理,同时给出它们的具体结构.     

L*n系统中理论的相对发散度和相对相容度

利用公式的Σr-真度(文中称为相对真度)理论,在模糊命题逻辑系统(L*n)中提出了任意理论Γ相对于特定理论Γ0的相对发散度和ηΓ0-相容度概念.对于有限理论,给出了其相对于特定理论Γ0的δΓ0-相容度概念,并对两种相容度的性质作了初步探究,揭示了二者之间的内在联系.同时给出任意理论Γ相对于特定理论Γ0的相容、不相容及完全相容的定义及其等价刻画.     

关于L_p-混合质心体的Busemann-Petty问题

对p≥1,Lutwak和Zhang引进了R~n中一个星体K的L_p-质心体Γ_pK的概念,Grinberg和Zhang研究了L_p-质心体算子Γ_p的Busemann-Petty问题;最近,马统一引进了星体K的L_p-混合质心体Γ_(p,i)K(i∈R)的概念,即L_p-质心体是它的特殊类.本文研究了Γ_(p,i)K(?)Γ_(p,i)L是否一定(?)的问题.其结果是Grinberg和Zhang关于L_p-质心体算子Γ_p的Busemann-Petty问题的推广形式.     

关于具有预先给定极点的有理函数的最佳逼近问题

<正> 在此工作中,主要得到了五个定理.它们是作者及类元仁,C.H.,■Elliott H.M.,Walsh J.L.及中一些结果的推广及改进. 设区域D是j_λ类区域,0≤λ≤1(或说区域D的边界Γ是j_λ类曲线),即区域D的边界Γ是一条光滑曲线,且若用Q(s)表示Γ的切线与正实轴的夹角时(看作弧长s的函数),函数Q(s)的连续模j(s)满足条件     

三角范畴中的（n,m）-强ξ-Gorenstein投射对象

引入了三角范畴中一类特殊的对象,称其为（n,m）-强ξ-Gorenstein投射对象（简记为（n,m）-ξ-SG-投射对象）,其中n≥1且m≥0.主要研究这类对象的ξ-Gorenstein投射维数及其合冲,并且给出了任一对象的ξ-Gorenstein投射维数小于m的充要条件.     

多连通域上二阶非线性椭圆型方程组广义黎曼-希尔伯特问题

这里G是平面上m+1连通区域,不妨取为标准圆域,即它的边界Γ是由m+1个圆周Γ_k:|z-z_k|=γ_k所组成,Γ_0为|z|=1,且设原点z=0含在G内。根据Riemann定理,平面上任意的以约当曲线为边界的m+1连通区域,都可共形映照到这样的标准区域。a_i(z)(i=1,2)是确定在Γ上逐段为常数的连续函数,在Γ_0上a_i(z)=0,在Γ_j上a_i(z)=a_(ij)=常数,i=1,2;j=1,…,m。     

抛物型点控制系统的逼近

设■是 R~■中的有界开区域,具有充分光滑的边界Γ.设b∈■,T>0.记■=■x(0,T),Σ=Γ×(0,T)假定 L 是■中带变系数的二阶椭圆型偏微分算子,     

Extreme values of the sum of squares of degrees of bipartite graphs

In this paper we determine the minimum and maximum values of the sum of squares of degrees of bipartite graphs with a given number of vertices and edges.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

Radius of convexity of certain classes of analytic functions

We consider the classes of analytic functions introduced recently by K.I. Noor which are defined by conditions joining ideas of close-to-convex and of bounded boundary rotation functions. We investigate coefficients estimates and radii of convexity.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。