Ⅱ型循环拟差集的一些不存在性定理

本文研究(v,k,λ)-Ⅱ型循环拟差集存在的必要条件,特别对 v≡1(mod 4)的情形,给出了一些不存在性定理。最后指出:满足 v≡1(mod 4),v<100的整数v,除了 v=45,69,73,81,93外,其余参数的(v,k,λ)-Ⅱ型循环拟差集的存在性问题均获得完满解决。     

单纯正交表OA$_\lambda(3, 5, v)$的存在性

An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.     

Existence of Simple OA_λ(3,5,v)′s

An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.     

组合理论中的一个丢番图方程

本文给出了在组合理论中遇到的以下丢番图方程k2 =k+λ(v- 1 ) ,0 <λ 相似文献   

某些可分解平衡不完全区组设计

本文证明存在某些可分解平衡不完全区组设计RB(k,λ;v)。例如,存在RB(6,5;42)及RB(5,2;55)。     

点数不超过20的旗传递非对称2-设计

本文研究了旗传递点数不大于20的2-(v,k,λ)设计的分类,证明了当(r,λ)=1时,在同构意义下只存在18个这样的设计.     

The spectrum of path factorization of bipartite multigraphs

LetλK_(m,n)be a bipartite multigraph with two partite sets having m and n vertices, respectively.A P_v-factorization ofλK_(m,n)is a set of edge-disjoint P_v-factors ofλK_(m,n)which partition the set of edges ofλK_(m,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 P_v-factorization ofλK_(m,n).When v is an odd number,we have proposed a conjecture.Very recently,we have proved that the conjecture is true when v=4k-1.In this paper we shall show that the conjecture is true when v = 4k 1,and then the conjecture is true.That is,we will prove that the necessary and sufficient conditions for the existence of a P_(4k 1)-factorization ofλK_(m,n)are(1)2km≤(2k 1)n,(2)2kn≤(2k 1)m,(3)m n≡0(mod 4k 1),(4)λ(4k 1)mn/[4k(m n)]is an integer.     

素变量混合幂丢番图逼近(Ⅱ)（英文）

设λ_1,λ_2,λ_3,λ_4是正实数,λ_1/λ_2是无理数和代数数,V是well-spaced序列,δ0.证了:对于任意给定的大于或等于3的正整数k及任意ε0,v∈V,v≤X,使得λ_1p_1~22+λ2p_2~2+λ_3p_3~3+λ_4p_4~k-v|v~(-δ)没有素数解p_1,p_2,p_3,p_4的v的个数不超过O(X~(σ+2δ+ε)),这里σ满足:当3≤k≤4时σ=1-4/11k;当k≥5时,σ=1-2/11k.这改进了之前[Chinese Ann.Math.Ser.A,2015,36(3):303-312]的结果.     

可分解平衡不完全区组设计的存在性理论

<正> 设 X 是一有限集,它的非空子集合我们叫做区组,它的区组族(?)(族中可以有相同的区组)如果符合以下条件,叫做品种数为 v,区组大小为 k,相遇数为λ的平衡不完全区组设计(BIBD),记作 B[k,λ;v](以下总假定 k≥2,λ≥1,v≥1):     

A bound for Wilson''''s general theorem

Given any set K of positive integers and positive integer λ, let c(K,λ) denote the smallest integer such that v∈B(K,λ) for every integer v≥c(K,λ) that satisfies the congruences λv(v-1)≡0 (mod β(K) and λ(v-1)≡0 (mod α(K)). Let K0 be an equivalent set of K, k and k* be the smallest and the largest integers in K0. We prove that c(K,λ)≤exp exp{Q0}Qo=max{2(2p(ko)2-k2kk)p(ko)4,(Kk242y-k-2)(y2)}, whereand y=k*+k(k-1)+1.