共查询到20条相似文献,搜索用时 125 毫秒
1.
对于一个有限简单图G,λKv的G-设计(G-填充,G-覆盖),记为(v,G,λ)-GD((v,G,λ)-PD,(v,G,λ)-CD),是一个(X,B),其中X是Kv的顶点集,B是Kv的子图族,每个子图(称为区组)均同构于G,且Kv中任一边都恰好(最多,至少)出现在B的λ个区组中.一个填充(覆盖)设计称为是最大(最小)的,如果没有其它的这种填充(覆盖)设计具有更多(更少)的区组.本文对于λ>1确定了(v,K2,3,λ)-GD的存在谱,并对任意λ构造了λKv的最大K2,3-填充设计和最小K2,3-覆盖设计. 相似文献
2.
设Γ 是一些单t- 一致超图的集合. 填充设计Pλ(t, Γ, v) (或覆盖设计Cλ(t, Γ, v)) 是一个二元有序组(X, B), 其中X 是完全t- 一致超图λKv(t) 的顶点集, B 是λKv(t) 的一些子超图的集合, 要求每个子超图都同构于Γ 中的某一个超图, 每个子超图称为是一个区组, 并且满足λKv(t) 中的每一条边至多(或至少) 含在B 的λ 个区组中. 给定参数t, v, λ, Γ, 填充设计Pλ(t, Γ, v) 的最大可能的区组数称为填充数, 记为dλ(t, Γ, v); 覆盖设计Cλ(t, Γ, v) 的最小可能的区组数称为覆盖数, 记为Cλ(t, Γ, v). 本文将确定Γ 中仅含超图K4(3) + e 时的dλ(t, Γ, v) 和Cλ(t, Γ, v) 的精确值. 相似文献
3.
设p(n)表示整数n>1的最小素因子.本文得到了(?),v≥0的渐近式,此处fv(n)是一类数论函数. 相似文献
4.
5.
When sample size is a sequence of r.v., the parametric estimates in linear models are interesting both theoretically and practically. For linear models Yi=xiβ+ei,i=1,2,…where {ei} are p-dimensional i .i .d.r.v′.s with Ee1=0. Var e1=σ2,0<σ2<∞. we consider estimate σ2(vn) of error variance σ2 and least squares estimate β(vn) of regression coefficient β, here {vn} is a sequence of r.v. with positve integers larger than P. In this paper some properties of estimates are discussed . Those are unbiasedness, consistency and normality . For σ2(vn), we also obtain some orders for convergence to normal distribution. 相似文献
6.
设B是实可分的Banach空间,{Xni,Fni,un≤i≤vn,n≥1}是B值适应随机元阵列,{αni,un≤i≤vn,n≥1}是实数阵列,当0<r<1或1≤r≤p且B是p可光滑时,研究了∑vni=un aniXni的Lr收敛性,所得的结果推广并改进了许多已知的结果. 相似文献
7.
该文证明:和如下耦合色散系统相联系的初值问题的充分光滑的解$(u,v)=(u(x,t),v(x,t))$, 如果在两个时刻有半线支集那么它们全为零.
{∂ tu+∂3x u+∂ x(up vp+1)=0,
∂ tv+∂3x v+∂x(up+1vp)=0,x∈R,t≥ 0 相似文献
8.
本文研究下面的非周期离散非线性Schrödinger 方程:
-Δun + vnun - ωun = gn(un),n ∈ Z,
其中V = {vn}n∈Z 和gn 都是非周期的,当|n| → +∞ 时,vn → +∞,并且时间频率ω ∈ R 可以满足下面的任何一种情形:(1)ω 属于算子-Δ + V 的一个有限谱间隔;(2)ω < inf σ(-Δ + V);(3)ω ∈ σ(-Δ+ V),其中σ(-Δ+ V)表示-Δ+ V的谱. 本文将用一些局部条件(在无穷远或零处)来代替一些全局条件. 利用变化的喷泉定理,当非线性项在无穷远处是超线性时,本文得到这个方程的无穷多个非平凡孤立子,并且,也得到指数衰减的孤立子的存在性. 相似文献
9.
10.
11.
DU Beiliang & WANG Jian Department of Mathematics Suzhou University Suzhou China Nantong Vocational College Nantong China 《中国科学A辑(英文版)》2005,48(4)
Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A Pv-factorization of Km,n is a set of edge-disjoint pv-factors of Km,n which partition the set of edges of Km,n. When v is an even number, Wang and Ushio gave a necessary and sufficient condition for the existence of Pv-factorization of Km,n.When v is an odd number, Ushio in 1993 proposed a conjecture. However, up to now we only know that Ushio Conjecture is true for v = 3. In this paper we will show that Ushio Conjecture is true when v = 4k - 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P4k-1-factorization of Km,n is (1) (2k - 1)m ≤ 2kn, (2) (2k -1)n≤2km, (3) m n ≡ 0 (mod 4k - 1), (4) (4k -1)mn/[2(2k -1)(m n)] is an integer. 相似文献
12.
13.
Let m be an integer and T be an m-linear Calderón-Zygmund operator, u, v1,..., vm be weights. In this paper, the authors give some sufficient conditions on the weights (u, vk) with 1 ≤ k ≤ m, such that T is bounded from Lp1(Rn, v1) × ··· × Lpm(Rn, vm) to Lp,∞(Rn, u). 相似文献
14.
对简单图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)的点可区别边色数. 相似文献
15.
Yanbin Jia & Changqing Xu 《数学研究通讯:英文版》2009,25(5):429-432
Let $G$ be a multigraph with vertex set $V(G)$. Assume that a positive
integer $f(v$) with $1 ≤ f(v) ≤ d(v)$ is associated with each vertex $v ∈ V$. An edge
coloring of $G$ is called an $f$-edge cover-coloring, if each color appears at each vertex $v$ at least $f(v)$ times. Let $χ′_{fc}(G)$ be the maximum positive integer $k$ for which an $f$-edge cover-coloring with $k$ colors of $G$ exists. In this paper, we give a new lower
bound of $χ′_{fc}(G)$, which is sharp. 相似文献
16.
<正> 本文的宗旨在于证明作者在[1]内所提及的全部结果,现在将本文的强果详述于下:定理1.命 F(x)表一无固定素因子的 k 次既约整值多项式.命(?)此处 w 是适合下面不等式的最小正整数(?)则在叙列{F(x)}中存在无限多个不超过 n 个素数的乘积.例如存在无限多个 x,使 x~3+2的素因子个数(包括相同的与相异的)不多于4.与此相类似,有定理2.设 k 为一正整数,命 n 适合(1)及(2),则当 x 充分大时,区间 x相似文献
17.
超方体(d,m)的控制数 总被引:1,自引:0,他引:1
This paper shows that the (d,m)-dominating number of the m-dimensional hypercube Qm(m≥4)is 2 for any integer d.([m/2] ≤d≤m). 相似文献
18.
LetλKm,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A Pv-factorization of λKm,n is a set of edge-disjoint Pv-factors of λKm,n which partition the set of edges of λKm,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a Pv-factorization of λKm,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v= 3. In this paper we will show that the conjecture is true when v= 4k- 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P4k-1-factorization of λKm,n is (1) (2κ - 1)m ≤ 2kn, (2) (2k - 1)n ≤ 2km, (3) m + n ≡0 (mod 4κ - 1), (4) λ(4κ - 1)mn/[2(2κ - 1)(m + n)] is an integer. 相似文献
19.
20.
设 n是正整数 ,k1 ,k2 ,… ,ks 是适合 k1 +k2 +… +ks=n的非负整数 ,正整数 nk1 k2 … ks=n!k1 !k2 !… ks!称为多项式系数 .本文讨论了当n=a0 +a1 p+a2 p2 +… +arpr ,其中 p为素数且 p≤ n,0≤ ai
相似文献