The maximum number of columns in supersaturated designs with

Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle .     

Decomposable super‐simple NRBIBDs with block size 4 and index 6

Necessary conditions for the existence of a super‐simple, decomposable, near‐resolvable ‐balanced incomplete block design (BIBD) whose 2‐component subdesigns are both near‐resolvable ‐BIBDs are (mod ) and . In this paper, we show that these necessary conditions are sufficient. Using these designs, we also establish that the necessary conditions for the existence of a super‐simple near‐resolvable ‐RBIBD, namely (mod ) and , are sufficient. A few new pairwise balanced designs are also given.     

圆形刚性夹杂双周期分布的反平面问题

研究含双周期分布的圆形刚性夹杂在无穷远受纵向剪切的弹性平面问题，遵循复合材料中各夹杂相互影响的重要条件。采用复变函数方法。构造相应模型的复应力函数。通过坐标变换，同时满足夹杂边界位移条件，再利用围线积分将求争方程组化为线性代数方程组。导出了圆形刚性夹杂双周期分布的界面应力解析表达式。算例给出了界面应力最大值与夹杂间距的变化规律。求出了刚性夹杂的合理间距问题，本文发展的分析方法为研究夹杂材料的细观机理探索了一条有效的分析途径。     

Heavy flavor baryon spectra via QCD sum rules

In this talk, we give a short review of our recent works on studying the singly heavy baryon, doubly heavy baryon, and triply heavy baryon spectra from QCD sum rules.     

Direct and inverse problems for electromagnetic scattering by a doubly periodic structure with a partially coated dielectric

Consider the problem of scattering of electromagnetic waves by a doubly periodic Lipschitz structure. The medium above the structure is assumed to be homogenous and lossless with a positive dielectric coefficient. Below the structure there is a perfect conductor with a partially coated dielectric boundary. We first establish the well‐posedness of the direct problem in a proper function space and then obtain a uniqueness result for the inverse problem by extending Isakov's method. Copyright © 2009 John Wiley & Sons, Ltd.     

Equitable resolvable coverings

In an earlier article, Willem H. Haemers has determined the minimum number of parallel classes in a resolvable 2‐(qk,k,1) covering for all k ≥ 2 and q = 2 or 3. Here, we complete the case q = 4, by construction of the desired coverings using the method of simulated annealing. Secondly, we look at equitable resolvable 2‐(qk,k,1) coverings. These are resolvable coverings which have the additional property that every pair of points is covered at most twice. We show that these coverings satisfy k < 2q ? , and we give several examples. In one of these examples, k > q. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 113–123, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10024     

Tychonoff expansions by independent families

A method for Tychonoff expansions using independent families is introduced. Using this method we prove that every countable Tychonoff space which admits a partition into infinitely many open-hereditarily irresolvable dense subspaces has a Tychonoff expansion that is -resolvable but not strongly extraresolvable. We also show that, under Luzin's Hypothesis ( ), there exists an -resolvable Tychonoff space of size which is not maximally resolvable.

     

Optimal doubly constant weight codes

A doubly constant weight code is a binary code of length n₁ + n₂, with constant weight w₁ + w₂, such that the weight of a codeword in the first n₁ coordinates is w₁. Such codes have applications in obtaining bounds on the sizes of constant weight codes with given minimum distance. Lower and upper bounds on the sizes of such codes are derived. In particular, we show tight connections between optimal codes and some known designs such as Howell designs, Kirkman squares, orthogonal arrays, Steiner systems, and large sets of Steiner systems. These optimal codes are natural generalization of Steiner systems and they are also called doubly Steiner systems. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 137–151, 2008     

对称双随机矩阵逆特征值问题

主要研究随机矩阵逆特征值问题．特别是对称双随机矩阵和列随机矩阵逆特征值问题．对参考文献[1]与[2]的结论作了一些推广．并给出了—个数值例子．