首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
姚云飞 《工科数学》2002,18(5):49-53
在赋范线性空间中考虑下列几类泛函方程(Ⅰ)f(x)g(y)=h(x y),(Ⅱ)f(x y)=f(x)f(y),(Ⅲ)f(x y)=f(x) f(y) ag(x)g(y)的性质与解以及彼此之间的关系。  相似文献   

2.
姚云飞 《大学数学》2002,18(5):49-53
在赋范线性空间中考察下列几类泛函方程( ) f(x) g(y) =h(x+y) ,  ( ) f(x+y) =f(x) f(y) ,  ( ) f(x+y) =f(x) +f(y) +ag(x) g(y)的性质与解以及彼此之间的关系 .  相似文献   

3.
设条件(A)为:若对任意的a,b,c∈R,存在依赖于a,b,c的整系数多项式f(x,y),f(x,y)形如∑ki=0αiyixyK-i+f1(x,y),f1(x,y)为一整系数多项式,其每一项关于x的次数2,关于y的次数K(此处K=K(a,b)为依赖于a,b的正整数),∑i=0αi=1,使[f(a,b),c]=0.结论为:满足条件(A)的K the半单纯环是交换的.这是一些结论的统一推广.  相似文献   

4.
研究了如下扰动二次可积微分系统x=-y(x+1)+εf{x,y),y=x(x+1)+εg(x,y),其中0|ε|《1,f(x,y)和g(x,y)是关于x,y的n次多项式.应用Abelian积分法得到该系统至多存在n个极限环,且这个上界是可达的.  相似文献   

5.
Let h be a measurable function defined on R+×R+. LetΩ∈ L(log L+)νq(Sn1-1×Sn2-1)(1 ≤νq≤ 2) be homogeneous of degree zero and satisfy certain cancellation conditions. We show that the singular integral T f(x1, x2) = p. v.∫ Rn1+n2Ω(y′1, y′2)h(|y1|, |y2|)|y1|n1|y2|n2f(x1- y1, x2- y2)dy1dy2maps from Sα1, α2p, q˙F(Rn1× Rn2) boundedly to itself for 1 p, q ∞, α1, α2 ∈ R.  相似文献   

6.
讨论了三阶线性非齐次微分方程y′′′+p(x)y″+q(x)y′+r(x)y+f(x)=0的Hyers-Ulam稳定性,即若函数f是它的一个近似解,则该方程一定存在与f是任意接近的精确解,并给出了简单实例.  相似文献   

7.
<正>学完高中数学必修一,我们知道,正比例函数f(x)=kx(k≠0)满足性质f(x+y)=f(x)+f(y),指数函数f(x)=a~x(a>0,a≠1)满足性质f(x+y)=f(x)f(y),对数函数f(x)=log_ax(a>0,a≠1)满足性质f(xy)=f(x)+f(y),幂函数f(x)=x~α(α∈R)满足性质f(xy)=f(x)f(y).然后,我们就会反过来想,满足这些性质的函数是唯一确定的吗?直到学习了导数,在  相似文献   

8.
1 问题的引入 考虑边值问题 L_y≡-εy″+p(x)y′+q(x)y=f(x),x∈I≡(o,1), y(0)=y(1)=0, (1,1)其中ε是一常数,ε∈(0,1),p(x),q(x),f(x)是[0,1]上的光滑函数,且满足p(x)≥a_1>0,q(x)≥0,q(x)-(1/2)P′(x)≥a_2>0.以下用C和d表示一常数,仅依赖于p(x),q(x),f(x),与ε无关,在不同的地方它们可能代表不同的数. 引入双线性形式 B(u,v)=integral from n=0 to 1(εu′v′+pu′v +quv)dx,u,v∈H~1(I),及范数  相似文献   

9.
文[1]讨论了除环上2阶全矩阵环的导子的一些性质,本文继此讨论一般结合环R上的R阶全矩阵环R_n的导子的性质.环R的加群自同态(?)称为R的导子,若对x、y∈R,有d(xy)=xd(y) d(x)y.如下总假定R有单位元,且用R_n表示R上的n阶全矩阵环,E_ij表示(i,j)位置元素为R的单位元1其余元素为零的R_n的矩阵单位,xE饰表示对角线上元素为x的数量阵.  相似文献   

10.
利用Picard-Fuchs方程法得到了Abelian积分I(h)=∮_(Г_h)g(x,y)dx-f(x,y)dy的零点个数的上界,其中Γ_h是由H(x,y)=x~2+y~2+2xy+a(x~4+y~4)=h定义的闭轨线,a0,h∈(0,+∞),f(x,y)和g(x,y)是关于x和y的n次多项式.进而得到该系统极限环个数的上界.  相似文献   

11.
Extreme values of the sum of squares of degrees of bipartite graphs   总被引:1,自引:0,他引:1  
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.  相似文献   

12.
13.
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.  相似文献   

14.
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.  相似文献   

15.
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.  相似文献   

16.
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 Ap.  相似文献   

17.
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.  相似文献   

18.
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 Pm 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 Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2.  相似文献   

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

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号