误差为鞅差序列的部分线性模型中估计的强相合性

考虑回归模型:y_i=x_{i ^β} +g(ti)+σ_ie_i ,i=1,2,...,n,其中 σ_i=f(u_i), (x_i,t_i,u_i)是固定非随机设计点列,f(^.),\ g(^.)$\ 是未知函数,β是待估参数,e_i是随机误差且关于非降σ -代数列{F_i,i≥1} 为鞅差序列.对文献[1]给出的基于f^(.)及g(^.)的一类非参数估计的β的最小二乘估计β_n和加权最小二乘估计β_n,在适当条件下证明了它们的强相合性,推广了文献[6]在e_i为iid情形下的结果.     

偶数阶Sturm-Liouville边值问题的多个正解

该文讨论了偶数阶边值问题 (-1)^m y^(2m)₌f(t,y), 0≤t≤1,a_i+1y⁽²ⁱ⁾ (0)-β_i+1y ⁽²ⁱ⁺¹⁾ (0)=0, γ_i+1y⁽²ⁱ⁾ (1)+δ_i+1y⁽²ⁱ⁺¹⁾ (1)=0,0≤i ≤m-1正解的存在性.借助于Leggett-Williams 不动点定理,建立了该问题存在三个及任意奇数个正解的充分条件.     

四阶椭圆方程基态解的集中性态

该文分析了四阶椭圆方程△^２u=|x|^au^p-1,x∈Ω; u=\Delta u=0 , x ∈аΩ, (Ω表示Rⁿ中以原点为中心的球)基态解的集中性态,并证明了当p趋近于 2^*=\frac{2n}{n-4} (n>4)时基态解u_p集中在Ω的边界附近.     

拟线性退化抛物型方程组解的整体存在性和爆破

该文研究光滑有界区域Ω( R^N (N≥ 1) 上具有齐次Dirichlet边界条件的拟线性退化抛物型方程组 u_t-div(|▽u|^p-2 ▽u) =av^α, v_t-div(|▽v|^q-2 ▽v) =bu^β 的非负解的性质, 其中p, q>2, α, β ≥ 1, a, b> 0是常数. 该文指出上述方程组的解是否在有限时刻爆破依赖于初值、系数 a 与 b以及 αβ 和 (p-1)(q-1)之间的关系.     

一类带权函数的拟线性椭圆方程

该文利用变分方法讨论了方程 -△_p u=λa(x)(u⁺)^p-1-μa(x)(u^-)^p-1+f(x, u), u∈W₀^1,p(\Omega)在(λ, μ)\not\in ∑_p和(λ, μ) ∈ ∑_p 两种情况下的可解性, 其中\Omega是 R^N(N≥3)中的有界光滑区域, ∑_p为方程 -△_p u=α a(x)(u⁺)^p-1-βa(x)(u^-)^p-1, u∈ W₀^1,p(\Omega)的Fucik谱, 权重函数a(x)∈ L^r(\Omega) (r≥ N/p)$且a(x)>0 a.e.于\Omega, f满足一定的条件.     

一类非线性高阶波动方程的初边值问题

该文研究一类非线性高阶波动方程u_tt－a_1^Uxx+a_₂u_x4+a₃u_x4_tt=φ(u_{x ⁾}x+f(u,u_x,u_xxu_xxx,u_x4)的初边值问题.证明整体古典解的存在唯一性并给出古典解爆破的充分条件.     

对于轮和完全图的 Ramsey 数的渐近上界

该文给出:对于偶数m≥4当n→ ∞时 r(W_m,K_n)≤l(1+o(1))C₁(m) (n/logn ) ^(2m-2)/(m-2)对于奇数m≥5当n→∞时r(W_m,K_n)≤(1+o(1))C₂(m) (n^2m/_m+1/^{_{log n)}(m+1)/(m-1)} .特别地,C₂(5)=12. 以及 c(ⁿ/_logn)^5/2≤r(K₄,K_n)≤ (1+o(1)) ^n3_/(logn)².此外,该文还讨论了轮和完全图的 Ramsey 数的一些推广.     

Gauss-Markov条件下最小二乘估计的强相合性

设Y_i=x＇_iβ+e_i,1≤i≤n为线性模型,β_n=(β_n1,…,β_np)＇为β=(β₁,…,β_p)＇的最小二乘估计,以u_n记(sum from i=1 to n(x_ix＇_i))的(1,1)元,v_n=u_n^-1.证明了在Ee_i=O且{e_i}满足Gauss-Markov条件时,v_i→∞及sum from i=2 to ∞(v_i^-2(v_i-v_i-1)log~2i<∞)为β_n1强相合的充分条件,且对任何ε_n→0,v_i→∞及sum from i=2 to ∞(ε_iv_i^-2(v_i-v_i-1)log²i<∞)已不再充分.提出了β_n1强相合的一个充要条件,它把β_n1强相合归结为正交随机变量级数的收敛问题.     

同分布 ρ 混合序列的最大值不等式及其应用

设X_n,n≥1是同分布的ρ混合序列, 记S_n=∑ⁿ_{i=1 Xi}. 该文讨论了$\max\limits_{1\leq i\leq n}\frac{|S_i|}{i}$ $(n\geq1)$的分布函数的上界. 作为应用,获得了随机变量$\sup\limits_{n\geq1}\frac{|S_n|}{n}$的1阶矩及$p(>1)$阶矩分别存在有限的充分必要条件,这是一个与独立同分布场合相一致的结果.     

二部多重图路因子分解的存在谱

若二部多重图λK_m,n的边集可以划分为λK_m,n 的P_v-因子,则称 λK_m,n存在P_v-因子分解.当v是偶数时, Ushio和Wang及本文的第二作者给出了λK_m,n存在P_v-因子分解的充分必要条件.同时提出了当v是奇数时λK_m,n存在P_v-因子分解的猜想.最近我们已经证明当v=4k-1时该猜想成立. 对于正整数k,文中证明λK_m,n 存在P_4k+1-因子分解的充分必要条件是: (1) 2km ≤ (2k+1)n, (2) 2kn ≤(2k+1)m, (3) m+n ≡ 0 (mod 4k+1), (4)λ (4k+1)mn/[4k(m+n)]是整数. 即证明:对于任意正整数k, 当v=4k+1时上述猜想成立，从而最终完成了该猜想成立的证明.     

Optimal labelling of a product of two paths

If G is a graph with p vertices and at least one edge, we set φ (G) = m n max |f(u) ? f(v)|, where the maximum is taken over all edges uv and the minimum over all one-to-one mappings f : V(G) → {1, 2, …, p}: V(G) denotes the set of vertices of G.P_n will denote a path of length n whose vertices are integers 1, 2, …, n with i adjacent to j if and only if |i ? j| = 1. P_m × P_n will denote a graph whose vertices are elements of {1, 2, …, m} × {1, 2, …, n} and in which (i, j), (r, s) are adjacent whenever either i = r and |j ? s| = 1 or j = s and |i ? r| = 1.Theorem.If max(m, n) ? 2, thenφ(P_m × P_n) = min(m, n).     

On the average genus of the random graph

The generalized Petersen graph GP (n, k), n ≤ 3, 1 ≥ k < n/2 is a cubic graph with vertex-set {u_j; i ? Z_n} ∪ {v_j; i ? Z_n}, and edge-set {u_iu_i, u_iv_i, v_iv_{i+k, i?}Z_n}. In the paper we prove that (i) GP(n, k) is a Cayley graph if and only if k² ? 1 (mod n); and (ii) GP(n, k) is a vertex-transitive graph that is not a Cayley graph if and only if k² ? -1 (mod n) or (n, k) = (10, 2), the exceptional graph being isomorphic to the 1-skeleton of the dodecahedon. The proof of (i) is based on the classification of orientable regular embeddings of the n-dipole, the graph consisting of two vertices and n parallel edges, while (ii) follows immediately from (i) and a result of R. Frucht, J.E. Graver, and M.E. Watkins [“The Groups of the Generalized Petersen Graphs,” Proceedings of the Cambridge Philosophical Society, Vol. 70 (1971), pp. 211-218]. © 1995 John Wiley & Sons, Inc.     

Inequalities of Hlawka type for matrices

A generalized Hlawka's inequality says that for any n (\geqq 2) (\geqq 2) complex numbers¶ x₁, x₂, ..., x_n,¶¶ ?_i=1ⁿ|x_i - ?_j=1ⁿx_j| \leqq ?_i=1ⁿ|x_i| + (n - 2)|?_j=1ⁿx_j|. \sum_{i=1}^n\Bigg|x_i - \sum_{j=1}^{n}x_j\Bigg| \leqq \sum_{i=1}^{n}|x_i| + (n - 2)\Bigg|\sum_{j=1}^{n}x_j\Bigg|. ¶¶ We generalize this inequality to the trace norm and the trace of an n x n matrix A as¶¶ ||A - Tr A ||₁ \leqq ||A||₁ + (n - 2)| Tr A|. ||A - {\rm Tr} A ||_1\ \leqq ||A||_1 + (n - 2)| {\rm Tr} A|. ¶¶ We consider also the related inequalities for p-norms (1 \leqq p \leqq ￥) (1 \leqq p \leqq \infty) on matrices.     

Cycles in bipartite graphs and an application in number theory

Let G = G(A, B) be a bipartite graph with |A| = u, |B| = v, and let / be a positive integer. In this paper we prove the following result: If v ≤ u, uv ≤ n, m = |E(G)|, and m ≥ max{180/u, 20/n^{1/2(1+(1/l))},} then G contains a C_2/. © 1995 John Wiley & Sons, Inc.     

Star partitions of graphs

Let G be a graph and n ≥ 2 an integer. We prove that the following are equivalent: (i) there is a partition (V₁,…,V_m) of V (G) such that each V_i induces one of stars K_1,1,…,K_1,n, and (ii) for every subset S of V(G), G\ S has at most n|S| components with the property that each of their blocks is an odd order complete graph. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 185–190, 1997     

How Tight Is the Bollobás-Komlós Conjecture?

The bipartite case of the Bollobás and Komlós conjecture states that for every j₀, %>0 there is an !=!(j₀, %) >0 such that the following statement holds: If G is any graph with minimum degree at least n$\displaystyle {n \over 2}+%n then G contains as subgraphs all n vertex bipartite graphs, H, satisfying¶H)hj₀ \quad {\rm and} \quad b(H)h!n.$j (H)hj₀ \quad {\rm and} \quad b(H)h!n.¶Here b(H), the bandwidth of H, is the smallest b such that the vertices of H can be ordered as v₁, …, v_n such that v_i~_Hv_j implies |imj|hb.¶ This conjecture has been proved in [1]. Answering a question of E. Szemerédi [6] we show that this conjecture is tight in the sense that as %̂ then !̂. More precisely, we show that for any 0 such that that !(j₀, %)Д %.     

Graph decompositions without isolated vertices III

Let G be a graph of order n, and n = Σ^k_i=1 a_i be a partition of n with a_i ≥ 2. In this article we show that if the minimum degree of G is at least 3k−2, then for any distinct k vertices v₁,…, v_k of G, the vertex set V(G) can be decomposed into k disjoint subsets A₁,…, A_k so that |A_i| = a_i,v_iisA_i is an element of A_i and “the subgraph induced by A_i contains no isolated vertices” for all i, 1 ≥ i ≥ k. Here, the bound on the minimum degree is sharp. © 1997 John Wiley & Sons, Inc.