Designs in Product Association Schemes

A number of important families of association schemes—such as the Hamming and Johnson schemes—enjoy the property that, in each member of the family, Delsarte t-designs can be characterised combinatorially as designs in a certain partially ordered set attached to the scheme. In this paper, we extend this characterisation to designs in a product association scheme each of whose components admits a characterisation of the above type. As a consequence of our main result, we immediately obtain linear programming bounds for a wide variety of combinatorial objects as well as bounds on the size and degree of such designs analogous to Delsarte's bounds for t-designs in Q-polynomial association schemes.     

特征不为2的有限正交几何与PBIB设计（Ⅱ）

在本文中,我们在特征不为2的有限正交几何中,取定一个(m,2s,s)型子空间P_0,再取不含于P_0且与P_0正交的(1,0,0)型子空间作处理,构作了一些结合方案和PBIB(3)、PBIB(2)设计,并计算了它们的参数.     

A Class of Imprimitive Association Schemes

From Burnside's p^αq^β-Theorem, it follows that any nonabelian group of order p^αq^β, where p and q are primes, cannot be simple. As a main result of this article, we state and prove an analog of the mentioned theorem for commutative association schemes.     

A structural classification of SR group divisible designs

A simple method of construction of a semi-regular (SR) group divisible design from another SR group divisible design is given. Using this method, 111 available SR designs from Clatworthy (1973) and John and Turner (1977) are systematically classified into 20 classes. This procedure may produce new nonisomorphic solutions for known designs.     

A Note on Thin P-Polynomial and Dual-Thin Q-Polynomial Symmetric Association Schemes

Let Y denote a d-class symmetric association scheme, with d 3. We show the following: If Y admits a P-polynomial structure with intersection numbers p _ij ^h and Y is 1-thin with respect to at least one vertex, then p _ll ^l =0 p _li ⁱ =0 1 i - 1. If Y admits a Q-polynomial structure with Krein parameters q _ij ^h , and Y is dual 1-thin with respect to at least one vertex, then q _ll ^l = 0 q _li ⁱ = 01 i d-1.     

Association Schemes with at Most Two Nonlinear Irreducible Characters and Applications to Finite Groups

An irreducible character χ of an association scheme is called nonlinear if the multiplicity of χ is greater than 1. The main result of this paper gives a characterization of commutative association schemes with at most two nonlinear irreducible characters. This yields a characterization of finite groups with at most two nonlinear irreducible characters. A class of noncommutative association schemes with at most two nonlinear irreducible character is also given.     

几个结合方案族的构造

本文给出了从两个类的结合方案构造三个类结合方案的两种方法,另外得到了一个结合方案族。     

Construction of Optimal Blocking Schemes for Robust Parameter Designs

Robust parameter design (RPD) is an important issue in experimental designs. If all experimental runs cannot be performed under homogeneous conditions, blocking the units is effective. In this paper, we obtain the correspondence relation between fractional factorial RPDs and the blocking schemes for full factorial RPDs. In addition, we provide a construction of optimal blocking schemes that make all main effects and control-by-noise two-factor interactions estimable.     

Three-Class Association Schemes

We study (symmetric) three-class association schemes. The graphs with four distinct eigenvalues which are one of the relations of such a scheme are characterized. We also give an overview of most known constructions, and obtain necessary conditions for existence. A list of feasible parameter sets on at most 100 vertices is generated.     

Semidirect Products of Association Schemes

In his 1996 work developing the theory of association schemes as a generalized group theory, Zieschang introduced the concept of the semidirect product as a possible product operation of certain association schemes. In this paper we extend the semidirect product operation into the entire set of association schemes. We then derive a way to decompose certain association schemes into smaller association schemes. We also investigate to what extent this product helps us to understand and characterize the structure of association schemes. We give some examples to show that the semidirect product produces many schemes that cannot be described as neither the direct product nor the wreath product of smaller schemes.This research was supported by Com²MaC-KOSEF, Korea.     

Connectedness of PBIB designs having asymmetrical association schemes

Summary A necessary and sufficient condition for the connectedness ofm-associate partially balanced incomplete block (PBIB) designs having an asymmetrical association scheme is given, only in terms of design parameters, without inner structure parameters of designs. Supported in part by Grant 321-6066-58530013 (Japan).     

Equitable Partitions of Flat Association Schemes

Let (X, G) be an association scheme. We say that (X, G) is flat if it is homogeneous and if any two distinct points have at most one common g-neighbor for each g ∈ G. In this paper we prove that any nondiscrete equitable partition of (X, G) has at most one singleton if (X, G) is flat, and {X} is the unique equitable partition without any singleton if (X, G) is flat and |X| is a prime. This work was supported for two years by Korea Research Foundation Grant (KRF-2006-003-C00010) and Pusan National University Research Grant. Received: January 31, 2007. Final version received: Novmeber 14, 2007.     

Imprimitive Q-polynomial Association Schemes

It is well known that imprimitive P-polynomial association schemes with are either bipartite or antipodal, i.e., intersection numbers satisfy either for all for all . In this paper, we show that imprimitive -polynomial association schemes with are either dual bipartite or dual antipodal, i.e., dual intersection numbers satisfy either .     

高精度隐式参差光滑格式的构造

参照Lax-Wendroff格式的构造方法,就双曲型方程、抛物型方程和双曲-抛物型方程,构造了一种新的IRS(implicit residual smoothing)格式。该IRS格式有二阶或三阶时间精度且大大地拓宽了解的稳定区域和CFL数。这种新的IRS格式有中心加权型和迎风偏向型两种,并用von-Neumann分析方法分析了格式的稳定范围。讨论了在透平机械中广泛应用的Dawes方法的局限性,发现该方法对稳态问题得出的解与时间步长的选取有关,对粘性问题求解时,时间步长受严格限制。最后,结合TVD(total variation diminishing)格式和四阶Runge-Kutta技术,用IRS格式和Dawes方法对二维反射激波场进行了数值模拟,数值结果支持本文的分析结论。     

Irreducible Representations of Wreath Products of Association Schemes

The wreath product of finite association schemes is a natural generalization of the notion of the wreath product of finite permutation groups. We determine all irreducible representations (the Jacobson radical) of a wreath product of two finite association schemes over an algebraically closed field in terms of the irreducible representations (Jacobson radicals) of the two factors involved.     

特征为2的有限域上二次曲面的结合方案的注记

By using nondegenerate and degenerate quadrics in projective space over finite fields of characteristic 2, some association schemes were constructed and their parameters were computed by the authors (see Adv. in Math., 3(2000), 120-128 and Acta Math. Appl. Sinica, 1(1999), 96-103). In this note, their polynomial properties, eigenmatrices, imprimitivities, association subschemes and related quotient association schemes are studied.     

Association Schemes of Quadratic Forms and Symmetric Bilinear Forms

Let X _n and Y _n be the sets of quadratic forms and symmetric bilinear forms on an n-dimensional vector space V over , respectively. The orbits of GL _n( ) on X _n × X _n define an association scheme Qua(n, q). The orbits of GL _n( ) on Y _n × Y _n also define an association scheme Sym(n, q). Our main results are: Qua(n, q) and Sym(n, q) are formally dual. When q is odd, Qua(n, q) and Sym(n, q) are isomorphic; Qua(n, q) and Sym(n, q) are primitive and self-dual. Next we assume that q is even. Qua(n, q) is imprimitive; when (n, q) (2,2), all subschemes of Qua(n, q) are trivial, i.e., of class one, and the quotient scheme is isomorphic to Alt(n, q), the association scheme of alternating forms on V. The dual statements hold for Sym(n, q).     

Association Schemes Related to Kasami Codes and Kerdock Sets

Two new infinite series of imprimitive 5-class association schemes are constructed. The first series of schemes arises from forming, in a special manner, two edge-disjoint copies of the coset graph of a binary Kasami code (double error-correcting BCH code). The second series of schemes is formally dual to the first. The construction applies vector space duality to obtain a fission scheme of a subscheme of the Cameron-Seidel 3-class scheme of linked symmetric designs derived from Kerdock sets and quadratic forms over GF(2).     

Association Schemes with Multiple Q-polynomial Structures

It is well known that an association scheme with has at most two P-polynomial structures. The parametrical condition for an association scheme to have two P-polynomial structures is also known. In this paper, we give a similar result for Q-polynomial association schemes. In fact, if , then we obtain exactly the same parametrical conditions for the dual intersection numbers or Krein parameters.