k维Piatetski-Shapiro素数定理 *

研究了k(≥3)维的Piatetski Shapiro素数定理 .令π(x;c₁,… ,c_k)表示不超过x且具有形式 [n^c₁1]=… =[n^c_kk]的素数个数 ( 1 k- (k/( 4k²+2 ) )时 ,π(x;c₁,… ,c_k)具有渐近公式 .     

非周期函数类WrHω的宽度估计

In this paper, we obtain the strong assymptotic values of n-width d_n(W^rH^ω, C)and d_n(W^rH^ω, L) for non-periodic function class W^rH^ω, wheve ω is a concave modulus of continuity.     

Couette-Taylor流体系统中的保测度映射

本文讨论了一类与Couette-Taylor流体系统有关的保测度映射T,T:θ_n+1=θ_n+A+B/r_n²+C cos z_n,(mod2π) z_n+1=z_n+d(2r_n²-1)sinθ_n+1+F, r_n+1=r_n+E cosθ_n+1,其中A,B,C,D,E,F为参数.这是一类较为特殊的三维保测度映射,即在不动点邻域内存在不变曲线(一维不交流形).结果表明,不变曲线存在区域的大小随摄动参数C,D,E,F的增大而减小.另外,还显示了离开不动点的不同距离处映射的性态.     

关于弱收敛的一点说明

在文献[1] 中对任意一Hilbert空间$H$及其中一组无穷多个线性独立元素e_n, n=0,1,2,^…, 构造 K=span{e_n; n=0,1,2,^…}. 任何对K弱收敛之级数∑^∞_n=0a_nx_n, 其弱和$f$必属于K´={K 之所有线性泛函集}. 记 f=∑^∞_n=0a_nx_n. 如果H为函数空间, 则在文献[1--2]中我们称 f 为K-weak function, 而在文献[3]中, f 都简称为弱函数. 最近李邦河教授告诉我, Jacob Korevaar为了研究Fourier变换的更广泛的适用条件, 在文献[4]中引进了“Pansions” 的概念, 即为形式的Hermite展开, 这与上面论述中H=L²(-∞, +∞), x_n=e_n=Hermite函数时的weak functions 在本质上是一致的. 但我们以前不知道“Pansions”. 我们沿着华罗庚教授在文献[5]中的思路, 研究了weak functions的各种性质和应用. 还引进了generalized weak functions, weak functions的乘法与应用、广义Mellin变换等.Jacob Korevaar 研究了“Pansions" 的性质和某些广义函数的关系, 这是我们的侧重点的不同之处. 特此说明.     

类对称函数的Schur凸性和不等式

对x = (x₁, x₂,···, x_n) ∈ (0,1)ⁿ 和 r ∈ {1, 2,···, n} 定义对称函数 F_n(x, r) = F_n(x₁, x₂,···, x_n; r) =∏_{1≤i1∑j=1^r(1+xi3/1- xi3)^1/r, 其中i1, i2, ···, ir 是整数. 该文证明了Fn(x, r) 是(0,1)ⁿ 上的Schur凸、Schur乘性凸和Schur调和凸函数. 作为应用,利用控制理论建立了若干不等式.}     

B-值随机变量序列叠对数律的收敛速度

设{X,X_n;n≥1}是在可分Banach空间(B,‖·‖)中取值的独立同分布随机变量序列,并且EX=0,Ef²(X)<+∞,f∈B^*,记S_n=X₁+…+X_n,n≥1.本文的目的是在适当的充要条件下研究和的收敛速度.作为本文结果的应用,分别给出了X满足有界叠对数律和紧叠对数律各一个新的充要条件;同时,本文改进了文献[3]和[4]在实空间情形所建立的一些结果.     

完全t部图K(n1,n2…nt)的色唯一性

本文使用比较两个色等价图的色划分数的方法,得出了完全t部图的色等价图类仍为完全t部图的一般形式数值条件,进一步得出了K(n₁,n₂,n₃)和K(n₁,n₂,n₃,n₄)为色唯一图的一般形式数值条件。     

对称群表示的既约分解

S_n是n个文字的对称群,T^d为C[x₁,x₂,…,x_n]中d次齐式所成的子空间.T^d做为S_n模所确定的S_n的表示记为ρ^d.π(α)为与分析α相对应的既约表示.记N^d_α为,π(α)进入ρ^d的重数,做为文献[1]的继续,本文简化了幂级数所满足的递推公式,并具体求出了母函数的表达式。     

不动点集为常余维数6的(Z2)2作用

记J_n,k^r为具有如下性质的n维未定向上协边类α构成的集合:存在α的一个代表元Mⁿ及(Z₂)^k在Mⁿ上的作用,其不动点集为常余维数r .记J_n,k^r=∑_nJ_n,k^r,则J_n,k^r为未定向上协边环MO_n=     

有限特殊射影酉群U4(q)与U5(q)的一个特征性质

设G为有限群,如对每个质数r都有|N_G(R₁)|=|N_(Un(q))(R₂)|,那么G≌U_n(q),此处R₁∈Syl_r(G),R₂∈Syl_r(U_n(q)),n=4或5.     

The smallest degree sum that yields potentially Kr,r-graphic sequences

We consider a variation of a classical Turán-type extremal problem as follows: Determine the smallest even integer σ(K_r,r,n) such that every n-term graphic sequence π = (d₁,d₂,...,d_n) with term sum σ(π) = d₁ + d₂ + ... + d_n ≥ σ(K_r,r,n) is potentially K_r,r-graphic, where K_r,r is an r × r complete bipartite graph, i.e. π has a realization G containing K_r,r as its subgraph. In this paper, the values σ(K_r,r,n) for even r and n ≥ 4r² - r - 6 and for odd r and n ≥ 4r² + 3r - 8 are determined.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Graphic sequences and split graphs

The split graph K _rVK _s on r+s vertices is denoted by S _r,s. A graphic sequence π = (d ₁, d ₂, ···, d _n) is said to be potentially S _r,s-graphic if there is a realization of π containing S _r,s as a subgraph. In this paper, a simple sufficient condition for π to be potentially S _r,s-graphic is obtained, which extends an analogous condition for p to be potentially K _r+1-graphic due to Yin and Li (Discrete Math. 301 (2005) 218–227). As an application of this condition, we further determine the values of σ(S _r,s, n) for n ≥ 3r + 3s - 1.     

Conditions for -graphic sequences to be potentially -graphic

An r-graph is a loopless undirected graph in which no two vertices are joined by more than r edges. An r-complete graph on m+1 vertices, denoted by , is an r-graph on m+1 vertices in which each pair of vertices is joined by exactly r edges. A non-increasing sequence π=(d₁,d₂,…,d_n) of nonnegative integers is said to be r-graphic if it is realizable by an r-graph on n vertices. An r-graphic sequence π is said to be potentially -graphic if it has a realization containing as a subgraph. In this paper, some conditions for r-graphic sequences to be potentially -graphic are given. These are generalizations from 1-graphs to r-graphs of four theorems due to Rao [A.R. Rao, The clique number of a graph with given degree sequence, in: A.R. Rao (Ed.), Proc. Symposium on Graph Theory, in: I.S.I. Lecture Notes Series, vol. 4, MacMillan and Co. India Ltd., (1979), 251–267; A.R. Rao, An Erdös-Gallai type result on the clique number of a realization of a degree sequence (unpublished)] and Kézdy and Lehel [A.E. Kézdy, J. Lehel, Degree sequences of graphs with prescribed clique size, in: Y. Alavi et al., (Eds.), in: Combinatorics, Graph Theory, and Algorithms, vol. 2, New Issues Press, Kalamazoo Michigan, 1999, 535–544].     

NA随机场对数律的收敛速度

设d是一个正整数, N ^d是d -维正整数格点.设{X_n , n∈N ^d} 是一同分布的负相伴随机场, 记S_n =∑_{k≤ n} X_k, S_n^(k)=S_n-X_k, 如果r >2, EX₁ = 0 和σ²= Var(X₁}, 则存在一个正数M:=100√(r-2)(1+σ²)使得下列条件等价 (I)E |X₁|^r (log|X₁|)^d-1-r/2 <∞; (II)∑_{n∈ N^d} |n|^r/2-2P(max_{1≤ k≤ n} |S_n^(k)|≥ (2^d+1 )ε√|n| log |n |) <∞,∨ε > M; (III)∑_{n∈N ^d} |n|^r/2-2P(max_{1≤ k≤n} |S_k |≥ε√| n} log| n |) <∞,∨ε > M. (III)\ \ $\sum\limits_{{{\bf n}}\in {{\cal N}}^{d}} |n|^{r/2-2} P(\max\limits_{{\bf 1}\leq{\bf k}\leq{\bf n}}|S_{{\bf k}}|\geq \varepsilon \sqrt{|{\bf n}|\log |{\bf n}|})<\infty$, $\forall\varepsilon>M$.     

A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic

The split graph K _r + $\overline {{K_s}} $ on r+s vertices is denoted by S _r,s . A non-increasing sequence π = (d ₁, d ₂, …, d _n ) of nonnegative integers is said to be potentially S _r,s -graphic if there exists a realization of π containing S _r,s as a subgraph. In this paper, we obtain a Havel-Hakimi type procedure and a simple sufficient condition for π to be potentially S _r,s -graphic. They are extensions of two theorems due to A.R.Rao (The clique number of a graph with given degree sequence, Graph Theory, Proc. Symp., Calcutta 1976, ISI Lect. Notes Series 4 (1979), 251–267 and An Erd?s-Gallai type result on the clique number of a realization of a degree sequence, unpublished).     

The Erdös-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true

A variation in the classical Turan extrernal problem is studied. A simple graphG of ordern is said to have propertyPk if it contains a clique of sizek+1 as its subgraph. Ann-term nonincreasing nonnegative integer sequence π=(d₁, d₂,⋯, d₂) is said to be graphic if it is the degree sequence of a simple graphG of ordern and such a graphG is referred to as a realization of π. A graphic sequence π is said to be potentiallyP _k-graphic if it has a realizationG having propertyP _k . The problem: determine the smallest positive even number σ(k, n) such that everyn-term graphic sequence π=(d₁, d₂,…, d₂) without zero terms and with degree sum σ(π)=(d ₁+d ₂+ …+d ₂) at least σ(k,n) is potentially P_k-graphic has been proved positive. Project supported by the National Natural Science Foundation of China (Grant No. 19671077) and the Doctoral Program Foundation of National Education Department of China.     

The Smallest Degree Sum That Yields Potentially Kr＋1 - K3-Graphic Sequences

Let a（Kr,＋1 - K3,n） be the smallest even integer such that each n-term graphic sequence п= （d1,d2,…dn） with term sum σ（п） = d1 ＋ d2 ＋…＋ dn 〉 σ（Kr＋1 -K3,n） has a realization containing Kr＋1 - K3 as a subgraph, where Kr＋1 -K3 is a graph obtained from a complete graph Kr＋1 by deleting three edges which form a triangle. In this paper, we determine the value σ（Kr＋1 - K3,n） for r ≥ 3 and n ≥ 3r＋ 5.     

A characterization for a graphic sequence to be potentially C r -graphic

Let r 3, n r and π = (d1, d2, . . . , dn) be a graphic sequence. If there exists a simple graph G on n vertices having degree sequence π such that G contains Cr (a cycle of length r) as a subgraph, then π is said to be potentially Cr-graphic. Li and Yin (2004) posed the following problem: characterize π = (d1, d2, . . . , dn) such that π is potentially Cr-graphic for r 3 and n r. Rao and Rao (1972) and Kundu (1973) answered this problem for the case of n = r. In this paper, this problem is solved completely.     

Graphic sequences with a realization containing intersecting cliques

Let r≥ 1, k≥ 2 and Fm1 ,...,mki;r denote the most general definition of a friendship graph, that is, the graph of Kr+m1 , . . . , Kr+mk meeting in a common r set, where Kr+mi is the complete graph on r + mi vertices. Clearly, | Fm1 ,...,mki;r | = m1+ ··· + mk + r. Let σ(Fm1 ,...,mki;r , n) be the smallest even integer such that every n-term graphic sequence π = (d1, d2, . . . , dn) with term sum σ(π) = d1 + d2 + ··· + dn ≥σ(Fm1 ,...,mki;r,n) has a realization G containing Fm1 ,...,mki;r as a subgraph. In this paper, we determine σ(Fm1 ,...,mki;r,n) for n sufficiently large.