A Recursive Construction for New Symmetric Designs

We introduce a recursive construction of regular Handamard matrices with row sum 2h for h=±3ⁿ. Whenever q=(2h – 1)² is a prime power, we construct, for every positive integer m, a symmetric designs with parameters (4h²(q^m+1 – 1)/(q – 1), (2h² – h)q^m, (h² – h)q^m).     

On Resolvable Difference Families

A Steiner 2-design is said to be G-invariantly resolvable if admits an automorphism group G and a resolution invariant under G. Introducing and studying resolvable difference families, we characterize the class of G-invariantly resolvable Steiner 2-designs arising from relative difference families over G. Such designs have been already studied by Genma, Jimbo, and Mishima [13] in the case in which G is cyclic. Developping their results, we prove that any (p, k, 1)-DF (p prime) whose base blocks exactly cover p–1/k(k–1) distinct cosets of the k-th roots of unity (mod p), leads to a Ckp-invariantly resolvable cyclic (kp,k,1)-BBD. This induced us to propose several constructions for DF's having this property. In such a way we prove, in particular, the existence of a C5p-invariantly resolvable cyclic (5p, 5, 1)-BBD for each prime p = 20n + 1 < 1.000.     

强度m的对称正交表的递归构造

本文证明了Q~n空间的正交分划的存在性,对2水平正交表的递归构造方法进行了改进,通过对正交分划的构造提出了任意强度的高水平对称正交表的递归构造方法.     

A Steiner 2-design with an automorphism fixing exactly r + 2 points

Doyen conjectured that there is no Steiner 2-design having an automorphism with more than r + 1 but fewer than fixed points, where r is the replication number. The falsity of this conjecture is shown by describing 2-(45, 5, 1) designs having an automorphism of order 2 with exactly 13 fixed points. © 1999 John Wiley & Sons, Inc. J Combin Design 7: 375–380, 1999     

Constructions for near resolvable designs and BIBDs

The purpose of this article is twofold. First, it is shown that classical inversive planes of even order can be used to construct a class of 2—(2²ⁿ + 1, 2ⁿ, 2ⁿ—1) near resolvable designs, in which any two blocks have at most 2 points in common. Secondly, it is shown that a recursive construction method for BIBDs using resolvable BIBDs due to Shrikhande and Raghavarao can be extended by using near resolvable designs. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 227–231, 1999     

On the spectrum of critical sets in latin squares of order 2n

Suppose that L is a latin square of order m and P ? L is a partial latin square. If L is the only latin square of order m which contains P, and no proper subset of P has this property, then P is a critical set of L. The critical set spectrum problem is to determine, for a given m, the set of integers t for which there exists a latin square of order m with a critical set of size t. We outline a partial solution to the critical set spectrum problem for latin squares of order 2ⁿ. The back circulant latin square of even order m has a well‐known critical set of size m²/4, and this is the smallest known critical set for a latin square of order m. The abelian 2‐group of order 2ⁿ has a critical set of size 4ⁿ‐3ⁿ, and this is the largest known critical set for a latin square of order 2ⁿ. We construct a set of latin squares with associated critical sets which are intermediate between the back circulant latin square of order 2ⁿ and the abelian 2‐group of order 2ⁿ. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 25–43, 2008     

Quasi-symmetric 2-(28, 12, 11) designs with an automorphism of order 7

All quasi-symmetric 2-(28, 12, 11) designs with an automorphism of order 7 without fixed points or blocks are enumerated. Up to isomorphism, there are exactly 246 such designs. All but four of these designs are embeddable as derived designs in symmetric 2-(64, 28, 12) designs, producing in this way at least 8784 nonisomorphic symmetric 2-(64, 28, 12) designs. The remaining four 2-(28, 12, 11) designs are the first known examples of nonembeddable quasi-symmetric quasi-derived designs. These symmetric 2-(64, 28, 12) designs also produce at least 8784 nonisomorphic quasi-symmetric 2-(36, 16, 12) designs with intersection numbers 6 and 8, including the first known examples of quasi-symmetric 2-(36, 16, 12) designs with a trivial automorphism group. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 213–223, 1998     

MATCH（14，3，1）－设计的一个构造法

一个ＭＡＴＣＨ（ｎ，ｋ，λ）－设计就是完全图Ｋ_n的一个ｋ－匹配集合，使得Ｋ_n的每一对独立边恰好出现在λ个ｋ－匹配中。本文构造了一个ＭＡＴＣＨ（１４，３，１）－设计，解决了文献［１］中一个尚未解决的问题，同时还得到一个ＭＡＴＣＨ（４２，３，１）－设计。     

确定递推式数列收敛的几种方法

给出确定递推式数列收敛的三种方法,即利用单调有界定理、极限的精确定义以及压缩影像原理,举例说明其应用.     

Recursive algorithms for unbalanced banded Toeplitz systems

Direct recursive algorithms for the solution of band Toeplitz systems are considered here. They exploit the displacement rank properties, which allow a large reduction of computational efforts and storage requirements. Their use of the Sherman–Morrison–Woodbury formula turns out to be particularly suitable for the case of unbalanced bandwidths. The computational costs of the algorithms under consideration are compared both in a theoretical and practical setting. Some stability issues are discussed as well. Copyright © 2009 John Wiley & Sons, Ltd.     

关于一类无穷级数无穷和的一个递推公式

在本文中，我们利用周期函数的付立叶展开式，建立一类无穷级数无穷和的一个递推公式：其中     

一类调和级数的递推求和公式

通过对一个周期函数进行傅里叶级数展开,得到了偶数阶的调和级数以及交错的奇数阶调和级数求和的递推公式,然后在此基础之上,得到了其他两类调和级数的递推求和公式。     

Halving Steiner 2-designs

A Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into two isomorphic sets. This is equivalent to an edge-disjoint decomposition of a self-complementary graph G on v vertices into K_ks. The obvious necessary condition of those orders v for which there exists a halvable S(2,k,v) is that v admits the existence of an S(2,k,v) with an even number of blocks. In this paper, we give an asymptotic solution for various block sizes. We prove that for any k?5 or any Mersenne prime k, there is a constant number v₀ such that if v>v₀ and v satisfies the above necessary condition, then there exists a halvable S(2,k,v). We also show that a halvable S(2,2ⁿ,v) exists for over a half of possible orders. Some recursive constructions generating infinitely many new halvable Steiner 2-designs are also presented.     

A RECURSIVE ALGORITHM AND ITS CONVERGENCE FOR PARAMETER ESTIMATION OF CONVOLUTION MODEL

In this article, the problem on the estimation of the convolution model parameters is considered. The recursive algorithm for estimating model parameters is introduced from the orthogonal procedure of the data, the convergence of this algorithm is theoretically discussed, and a sufficient condition for the convergence criterion of the orthogonal procedure is given. According to this condition, the recursive algorithm is convergent to model wavelet A- = （1, α1,..., αq）.     

Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy

The complexity of index sets of families of general recursive functions is evaluated in the Kleene–Mostowski arithmetic hierarchy.