长为{3,4,5}的完备删位纠错码的组合构造

本文研究了混合长度的删位纠错码的构造问题.利用组合设计的方法构造了长为{3,4,5}的完备删位纠错码T(2,{3,4,5},v),当v为正整数且v≠8时,得到了所有的T(2,{3,4,5},v)-码,并给出码字总数的一个上界,T(2,{3,4,5},v)-码的构造推广了长度为单一值的删位纠错码的构造结果.     

复指数函数系在$L_{\alpha}^{p}$空间中的完备性

设函数 $\alpha(t)$在$\bf R$上非负连续 和 $1\le{p}<+{\infty}$, 则 $L_{\alpha}^p=\{f: \int_{-{\infty}}^{\infty}|f(t)e^{-\alpha(t)}|^p\mathrm{d}t<{\infty}\}$ 是Banach空间. 本文中我们得到了一个复指数函数系在$L_{\alpha}^{p}$ 空间中稠密的充分必要条件.     

删失混合效应模型的分位回归及变量选择

纵向数据常常用正态混合效应模型进行分析.然而,违背正态性的假定往往会导致无效的推断.与传统的均值回归相比较,分位回归可以给出响应变量条件分布的完整刻画,对于非正态误差分布也可以给稳健的估计结果.本文主要考虑右删失响应下纵向混合效应模型的分位回归估计和变量选择问题.首先,逆删失概率加权方法被用来得到模型的参数估计.其次,结合逆删失概率加权和LASSO惩罚变量选择方法考虑了模型的变量选择问题.蒙特卡洛模拟显示所提方法要比直接删除删失数据的估计方法更具优势.最后,分析了一组艾滋病数据集来展示所提方法的实际应用效果.     

It模型金融市场的完备性

本文研究了标的资产价格服从连续时间It过程模型的金融市场的完备性问题。在允许有摩擦的金融市场中,当可允许投资策略取值于一个非空凸闭集时,给出了金融市场在内蕴完备条件下广义不完备的充分必要条件.     

对角量子信道纠错码空间的存在性与构造

通过量子信道的Kraus算子,提出了对角量子信道的概念,证明了对角量子信道的一些性质:一个量子信道成为对角量子信道的充要条件是所有对角矩阵都是它的不动点;同一对角量子信道的所有压缩矩阵具有相同的秩;一个对角量子信道不可纠错的充要条件是其压缩矩阵是行满秩的.进而证明了一个对角量子信道在整个空间上可纠错当且仅当其压缩矩阵为1秩阵.最后,利用一个具体例子给出了构造对角量子信道的码空间的一种方法.     

对数列{（1+（1/n））n+a}的单调完备性定理的修正

文[1]给出数列{(1+(1/n))n}与{(1+1/n)n+1}的单调性的新证,并结合2008年湖南理科压轴题作如下探究:研究数列{(1+1/n)n+a}(其中a为实数)的单调性,得出如下单调完备性定理:     

当$4q^{5}-5q^{4}-2q+1\leq d \leq 4q^{5}-5q^{4}-q$时$[g_{q}(6,d),6,d]_{q}$码的不存在性

证明了对于q≥17,当4q~5-5q~4-2q+1≤d≤4q~5-5q~4-q时,不存在达到Griesmer界的[n,k,d]_q码.此结果推广了Cheon等人在2005年和2008年的非存在性定理.     

加权Banach空间中随机函数列{t^λn（ω）}的完备性与闭包

该文研究了随机函数列{tλn(ω)在加权Banach空间Cα中的完备性与闭包.其中Cα表示在正实轴上连续且满足当,t→ ∞时,|f(t)|e-α(t)→0的连续复函数组成的Banach空间.     

一类具有排斥型奇性的中立型Li'{e}nard方程周期正解的存在性

利用Mawhin重合度拓展定理, 研究一类具有排斥型奇性的中立型Li''{e}nard方程周期问题. 在强奇性条件下, 获得周期正解存在性的新结果. 本文允许方程在无穷远点具有不定型奇性, 改进了已有文献中的相关结论.     

具有时滞的$n$维Li\''{e}nard型方程调和解的存在性

本文利用迭合度理论研究了具有时滞的$n$维Li\'{e}nard型方程调和解的存在性,在对阻尼项不作限制的前提下,给出了存在调和解的条件.     

Directed B(K, 1; v) with K = {4, 5} and {4, 6} related to deletion/insertion‐correcting codes

Motivated by the construction of t‐deletion/insertion‐correcting codes, we consider the existence of directed PBDs with block sizes from K = {4, 5} and {4, 6}. The spectra of such designs are determined completely in this paper. For any integer {υ ≥ 4, a DB({4,5} ,1; υ) exists if and only if υ∉{6, 8, 9, 12, 14}, and a DB({4, 6}, 1; υ) exists if and only if υ ≡ 0,1 mod 3 and υ∉{9,15}. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 147–156, 2001     

Existence of Perfect 3-Deletion-Correcting Codes

Bours [4] recently showed some constructions for perfect 2 and 3-deletion-correcting codes from combinatorial designs. He settled existence of perfect 2-deletion-correcting codes with words of length 4. However, the existence of perfect 3-deletion-correcting codes with words of length 5, or T^*(2, 5, v), remained unsettled for v 7, 8 (mod 10) and v = 13, 14, 15, 16. In this paper we provide new constructions for these codes from combinatorial designs, and show that a T^*(2, 5, v) exists for all v.     

Existence of T*(3, 4,v)‐codes

A word of length k over an alphabet Q of size v is a vector of length k with coordinates taken from Q. Let Q^*₄ be the set of all words of length 4 over Q. A T^*(3, 4, v)‐code over Q is a subset C^*? Q^*₄ such that every word of length 3 over Q occurs as a subword in exactly one word of C^*. Levenshtein has proved that a T^*(3, 4, vv)‐code exists for all even v. In this paper, the notion of a generalized candelabra t‐system is introduced and used to show that a T^*(3, 4, v)‐code exists for all odd v. Combining this with Levenshtein's result, the existence problem for a T^*(3,4, v)‐code is solved completely. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 42–53, 2005.     

Existence of Perfect 4-Deletion-Correcting Codes with Length Six

By a T ^*(2, k, v)-code we mean a perfect4-deletion-correcting code of length 6 over an alphabet of size v, which is capable of correcting anycombination of up to 4 deletions and/or insertions of letters that occur in transmission of codewords. Thethird author (DCC Vol. 23, No. 1) presented a combinatorial construction for such codes and prove thata T ^*(2, 6, v)-code exists for all positive integers v 3 (mod 5), with 12 possible exceptions of v. In this paper, the notion of a directedgroup divisible quasidesign is introduced and used to show that a T ^*(2, 6,v)-code exists for all positive integers v 3 (mod 5), except possiblyfor v {173, 178, 203, 208}. The 12 missing cases for T ^*(2,6, v)-codes with v 3 (mod 5) are also provided, thereby the existenceproblem for T ^*(2, 6, v)-codes is almost complete.     

A new infinite class of S(3, {4, 5, 7}, v)

A t‐wise balanced design ( at BD) of order v and block sizes from K , denoted by S ( t , K , v ), is a pair ( X , ??), where X is a v ‐element set and ?? is a set of subsets of X , called blocks , with the property that | B |∈ K for any B ∈?? and every t ‐element subset of X is contained in a unique block. In this article, we shall show that there is an S ( 3 , { 4 , 5 , 7 }, v ) for any positive integer v ≡ 7 ( mod12 ) with v ≠ 19 . Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 20:68–80, 2012     

Existence of a-fold Perfect （v, {5, 8}, 1）-Mendelsohn Designs

Let v be a positive integer and let K be a set of positive integers. A （v, K, 1）-Mendelsohn design, which we denote briefly by （v, K, 1）-MD, is a pair （X, B） where X is a v-set （of points） and B is a collection of cyclically ordered subsets of X （called blocks） with sizes in the set K such that every ordered pair of points of X are consecutive in exactly one block of B. If for all t =1, 2,..., r, every ordered pair of points of X are t-apart in exactly one block of B, then the （v, K, 1）-MD is called an r-fold perfect design and denoted briefly by an r-fold perfect （v, K, 1）-MD. If K = {k） and r = k - 1, then an r-fold perfect （v, （k）, 1）-MD is essentially the more familiar （v, k, 1）-perfect Mendelsohn design, which is briefly denoted by （v, k, 1）-PMD. In this paper, we investigate the existence of 4-fold perfect （v, （5, 8}, 1）-Mendelsohn designs.     

Existence of (q,k, 1) difference families with q a prime power and k = 4, 5

The existence of a (q, k, 1) difference family in GF(q) has been completely solved for k = 3. For k = 4, 5 partial results have been given by Bose, Wilson, and Buratti. In this article, we continue the investigation and show that the necessary condition for the existence of a (q, k, 1) difference family in GF(q), i.e., q ≡ 1 (mod k(k − 1)) is also sufficient for k = 4, 5. For general k, Wilson's bound shows that a (q, k, 1) difference family in GF(q) exists whenever q ≡ 1 (mod k(k − 1)) and q > [k(k − 1)/2]^k(k−1). An improved bound on q is also presented. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 21–30, 1999     

The Existence of (ν,6, λ)-Perfect Mendelsohn Designs with λ > 1

The basic necessary conditions for the existence of a (v, k, λ)-perfect Mendelsohn design (briefly (v, k, λ)-PMD) are v ≥ k and λ v(v − 1) ≡ 0 (mod k). These conditions are known to be sufficient in most cases, but certainly not in all. For k = 3, 4, 5, 7, very extensive investigations of (v, k, λ)-PMDs have resulted in some fairly conclusive results. However, for k = 6 the results have been far from conclusive, especially for the case of λ = 1, which was given some attention in papers by Miao and Zhu [34], and subsequently by Abel et al. [1]. Here we investigate the situation for k = 6 and λ > 1. We find that the necessary conditions, namely v ≥ 6 and λ v(v − 1)≡0 (mod 6) are sufficient except for the known impossible cases v = 6 and either λ = 2 or λ odd. Researcher F.E. Bennett supported by NSERC Grant OGP 0005320.     

幂次为2,3,4,5的素变量非线性型的整数部分

考虑了一个混合幂次为2,3,4,5的素变量非线性型的整数部分表示无穷多素数的问题.运用Davenport-Heilbronn方法证明了:如果λ_1,λ_2,λ_3,λ_4是正实数,至少有一个λ_i/λ_j(1≤ij≤4)是无理数,那么存在无穷多素数p_1,p_2,p_3,p_4,p,使得[λ_1p_1~2+λ_2p_2~3+λ_3p_3~4+λ_4p_4~5]=p.