代数体函数及其导数的Picard值

本文得到了下列结果。 设w=w(z)为复平面上的-v值代数体函数,α(≠0)为一有限复数,则 (ⅰ) w′-αw~n, n≥4v+1 取任何值无限多次,除非w是一代数函数 (ⅱ) w′w~n=α,n≥4v-1 有无限个根,除非w是一代数函数。     

关于Hayman的一个问题和Tumura-Clunie定理

(1)证明了=f′-af~n(n≥5.f 为超越亚地函数,a≠0)取任何有穷复数无限次.[1]和(2)举例说明 n≥5是精确的.本文用完全不同方法找出了 n=4,3,2时 =f′-af取任何有穷复数无限次的条件.并举出例子说明本文的条件是精确的。而且本文还找出了 Tumura-Clunie 定理成立的最佳条件.     

代数体函数及其微分多项式

本文证明了v值代表体函数w的微分多项式p(w)是-λ(1<λ相似文献   

关于Fermat点的两个不等式的加强

设△ ABC的三边长为 a、b、c,其半周长、外接圆半径、内切圆半径、面积分别为 s、R、r、△ ;F是△ ABC内的 Fermat点 ,延长 AF、BF、CF分别交对边于 A′、B′、C′,记 FA =u,FB =v,FC =w,AA′=x,BB′=y,CC′=z;以∑ 表示循环和 .文 [1 ]证明了如下不等式 :　　　 u v w≤ 23s,( 1 )　　　 x y z≤ 3s. ( 2 )本文给出上述不等式的加强 .定理 1　在△ ABC中 ,有u v w≤ s ( 6 - 33) r.( 3)引理 1 [2 ]u v w =12 ( ∑a2 ) 2 3△ ( 4 )　　 uv vw uw =43△ . ( 5)定理 1的证明运用引理 1中的 ( 4 )式 ,得(…     

关于代数体函数的唯一性

研究涉及导函数的代数体函数的唯一性.证明了设w(z)为开复平面内不可约的v值代数体函数,a_i(i=1,2,…,4v-1)为判别的有穷复数,如果w(z)与w'(z)以a_1,a_2,…,a_(4v-1),∞为IM公共值,则w(z)≡w'(z).     

关于wm+awi0(w′)i1…(w(n))in的值分布

利用亚纯函数的Nevanlinna值分布理论,讨论了对任意非零复数a,任意正整数m,i0,i1,…,in,满足m≥λ △ 2时,亚纯函数wm awi0(w′)i1…(w(n))in的值分布.     

度为奇数的正则图的上负全控制数

f:v(G)→{一1,0,1}称为图G的负全控制函数,如果对任意点V∈V,均有f[v]≥1,其中 f[v]= ∑,f(u).如果对每个点v∈V,不存在负全控制函数g:V(G)→{-l,0,1),g≠f,满u∈N(v)足g(v)≤f(v),则称f是-个极小负全控制函数.图的上负全控制数F-t(G)=max{w(f)|f,是G的极小负全控制函数},其中w(f)=∑/v∈V(G)f(v).本文研究正则图的上负全控制数,证明了:令G是-个v∈V(G)n阶r-正则图.若r为奇数,则Γt-(G)＜＝r2 1/r2 2r-1n.     

PSU(n,K,f)(ν(f)≥1)中含根子群的极大子群

<正> K是任意域,τ:a_1→a是K的二阶自同构,F={a∈K|a=a}.V=V(n,K,f)是K上n维空间,定义了关于τ的非退化反Hermite内积f,其Witt指数,v(f)≥1.SU(n,K,f)是作用于V上的特殊酉群,G=PSU(n,k,f)是对应的射影群.我们假定n≥3,并排除非单的情形PSU(3,4).     

图K_(2n)\E(F_4)(n≥12)的点可区别边染色

对简单图G(V,E),设f是从E(G)到{1,2,…,k}的映射,k为自然数,如果.f满足:1)对任意的uv,uw∈E(G),v≠w,有.f(uv)≠f(uw);2)对任意的u,v∈V(G),u≠v,有C(u)≠C(v).则称f为图G的k-点可区别边染色法,而最小的k被称为点可区别边色数(其中C(u)={f(uv)|uv∈E(G)}.研究了图K_(2n)\E(F_4)(n≥12)的点可区别边色数.     

关于变量个数的几个单调函数

目前 ,人们对比较变量大小之间关系的不等式较为关注 ,但是 ,笔者发现 ,有一些不等式在变量的定义域内 ,经过变量置换 ,可以得到关于变量个数的一些单调函数 .为了讨论方便 ,设实函数 f(x)的定义域为x∈(a ,b) ,实数Pi>0 (1≤i≤n) ,n∈N .记λn=∑ni=1Pi,An=∑ni=1Pixi/λn,Bn=∑ni=1Pif(xi) /λn.定理　若 f(x)在区间 (a ,b)上为凸函数 ,则φ(n) =λn[f(An) -Bn]是n的递增函数 .证　设x′i∈ (a ,b) ,根据凸函数定理有f(A′n)≥B′n (1)A′n=∑ni=1Pix′i/λn,B′n=∑ni=1Pif(x′i) /λn.令x′1=x′2 =… =x′n - 1=An - 1,x′n=xn…     

关于Hayman的一个问题和Tumura—Clunie定理

[1]证明了ψ=f′-αf^n(n≥5。f为超越亚纯函数，α≠υ）取任何有究复数无限次。[1]和[2]举例说明n≥5是精确的。本文用完全不同方法找出了n=4,3,2时ψ＝f′-αf^n取任何有究复数无限次的条件。并举出例子说明本文的条件是精确的。而且本文还找出了Tumura-Clunie定理成立的最佳条件。     

φ-半压缩算子和φ-强增殖算子方程的迭代

设E是任意实Banach空间 ,K是E的非空闭凸子集·　T :K→K是一致连续_半压缩映像且值域有界·　设 an ,bn ,cn ,a′n ,b′n 和 c′n 是 [0 ,1]中的序列且满足条件 :ⅰ )an bn cn =a′n b′n c′n =1, n≥ 0 ;ⅱ )limbn =limb′n =limc′n =0 ;ⅲ ) ∑∞n =0bn =∞ ;ⅳ )cn =o(bn) ·　对任意给定的x0 ,u0 ,v0 ∈K ,定义Ishikawa迭代 xn 如下 :　　 xn 1=anxn bnTyn cnun,yn =a′nxn b′nTxn c′nvn　　 ( n≥ 0 ) ,其中un 和 vn 是K中两个有界序列·　则 xn 强收敛于T的唯一不动点·　最后研究了_强增殖算子方程解的Ishikawa迭代收敛性·     

图K_(2n)\E(K_(2,m))(n≥9,m≥3)的点可区别边染色

对简单图G(V,E),设f是从E(G)到{1,2,…,κ}的映射,κ为自然数,如果f满足:1)对任意的uv,uw∈E(G),v≠w,有f(uv)≠f(uw);2)对任意的u,v∈V(G),u≠v,有C(u)≠C(v).则称f为图G的κ-点可区别边染色法,而最小的κ被称为点可区别边色数(其中C(u)={f(uv)|uv∈E(G)}).研究了图K_(2n)\E(K_(2,m))(n≥9,m≥3)的点可区别边色数.     

Resolvability in circulant graphs

A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.     

运用均值定理解题的错解与技巧剖析

“若a1,a2,…,an∈R+,则a1+a2+n…+an≥na1a2…an,仅当a1=a2=…=an(n≥2,n∈N)时等号成立”是一个应用广泛的平均不等式,许多外形与它截然相异的函数式,常常也能利用它巧妙地求出最值.运用均值定理求最值是历年来高考的热点内容,因此必须掌握用重要不等式求函数最值的方法.一、重视运用正数、取等、定值1.注意正数例1求函数y=x+4x的值域.错解:∵x+4x≥2x×4x=4(仅当x=2时取等号),所以值域为[4,+∞).这里错误在于使用均值定理a+b≥2ab时忽略了条件:a,b∈R+.正解:当x>0时,x+4x≥2x×4x=4(当x=2时取等号);当x<0时,-x>0而(-x)+-4x≥2(-x)-4x=4…     

On strong metric dimension of graphs and their complements

A vertex x in a graph G strongly resolves a pair of vertices v, w if there exists a shortest x-w path containing v or a shortest x-v path containing w in G. A set of vertices S■V(G) is a strong resolving set of G if every pair of distinct vertices of G is strongly resolved by some vertex in S. The strong metric dimension of G, denoted by sdim(G), is the minimum cardinality over all strong resolving sets of G. For a connected graph G of order n≥2, we characterize G such that sdim(G) equals 1, n-1, or n-2, respectively. We give a Nordhaus-Gaddum-type result for the strong metric dimension of a graph and its complement: for a graph G and its complement G, each of order n≥4 and connected, we show that 2≤sdim(G)+sdim(G)≤2( n-2). It is readily seen that sdim(G)+sdim(G)=2 if and only if n=4; we show that, when G is a tree or a unicyclic graph, sdim(G)+sdim(G)=2(n 2) if and only if n=5 and G ～=G ～=C5, the cycle on five vertices. For connected graphs G and G of order n≥5, we show that 3≤sdim(G)+sdim(G)≤2(n-3) if G is a tree; we also show that 4≤sdim(G)+sdim(G)≤2(n-3) if G is a unicyclic graph of order n≥6. Furthermore, we characterize graphs G satisfying sdim(G)+sdim(G)=2(n-3) when G is a tree or a unicyclic graph.     

B值随机变量阵列加权和的完全收敛性

设{X_ni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论.     

超球上可微(0,q)式-问题的解

证明了:对任一在Cn中超球Bn上可微的(0,q)式g(z)若适合g=0,而且g在Bn内有紧致的支集,则当n≥q 1时v(w)=*∫Bng(z)∧*zN(z,w)是方程v=g之解,它在边界Bn上为零.     

Hamiltonian二部竞赛图

设 T(n,n)表示 n×n 二部竞赛图。本文证明了:如果 uv 是 T(n,n)的一条弧,蕴含d~-(u) d~ (v)≥n-2≥4,则 T(n,n)是 Hamilton 图,除非 T(n,n)属于两类已被刻划的特殊图类。     

鞅型序列的变换及其收敛性

本文证明了(1)设 Banach 空间 B 为 P 阶光滑的(1≤P≤2),X=(X_n,(?)_n,n≥1)为B 值鞅,v=(v_n,(?)_n,n≥1)为实值可予报序列,鞅变换 Y=(sum from i=1 to n V_i(X_i-X_(i-1)),(?)_n,n≥1)在一定的条件下具有 a.e.收敛性,L~p 收敛性及强(弱)大多数定律成立。(2)Banach空间 B 具有 Radon-Nikodym 性质,X=(X_n,(?)_n,n≥1)为 B 值依概极限鞅,实值可予报序列 V=(V_n,(?)_n,n≥1)满足 sum from i=1 to ∞ E(|V_i|~p)~(1/p)<∝,1相似文献