Association Schemes and Fusion Algebras (An Introduction)

We introduce the concept of fusion algebras at algebraic level, as a purely algebraic concept for the fusion algebras which appear in conformal field theory in mathematical physics. We first discuss the connection between fusion algebras at algebraic level and character algebras, a purely algebraic concept for Bose-Mesner algebras of association schemes. Through this correspondence, we establish the condition when the matrix S of a fusion algebra at algebraic level is unitary or symmetric. We construct integral fusion algebras at algebraic level, from association schemes, in particular from group association schemes, whose matrix S is unitary and symmetric. Finally, we consider whether the modular invariance property is satisfied or not, namely whether there exists a diagonal matrix T satisfying the condition (ST)³ = S ². We prove that this property does not hold for some integral fusion algebras at algebraic level coming from the group association scheme of certain groups of order 64, and we also prove that the (nonintegral) fusion algebra at algebraic level obtained from the Hamming association scheme H(d, q) has the modular invariance property.     

Rational Functions and Association Scheme Parameters

The parameters of metric, cometric, symmetric association schemes with q ± 1 (the same as the parameters of the underlying orthogonal polynomials) can be given in general by evaluating a single rational function of degree (4, 4) in the complex variable q ^j. But in all known examples, save the simple n-gons, these reduce to polynomials of degree at most 2 in q ^j with q an integer. One reason this occurs is that the rational function can have singularities at points which would determine some of the parameters. This paper deals with the case in which not all of the singularities are removable, thus giving some reason why the n-gons might naturally be the only exceptions to schemes with parameters being polynomials of degree at most 2 in q ^j , except possibly for schemes of very small diameter.     

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.     

A combinatorial approach to transitive extensions of generously unitransitive permutation groups

Motivated by symmetric association schemes (which are known to approximate generously unitransitive group actions), we formulate combinatorial approximations to transitive extensions of generously unitransitive permutation groups. Specifically, the notions of compatible and coherent partitions are suggested and investigated in terms of the orbits of an ambient group (H, Ω) on the k‐subsets of Ω, k=2, 3, 4. We apply these ideas to investigate transitive extensions of the automorphism groups of the classical Johnson and Hamming schemes. In the latter case, we further provide algorithmic details and computer‐generated data for the particular series of Hamming schemes H(m, 3), m⩾2. Finally, our approach is compared to the concept of a symmetric association scheme on triples in the sense of Mesner and Bhattacharya. © 2010 Wiley Periodicals, Inc. J Combin Designs 18:369–391, 2010     

Matrix-valued symmetric templates for interpolatory surface subdivisions: I. Regular vertices

The objective of this paper is to introduce a general procedure for deriving interpolatory surface subdivision schemes with “symmetric subdivision templates” (SSTs) for regular vertices. While the precise definition of “symmetry” will be clarified in the paper, the property of SSTs is instrumental to facilitate application of the standard procedure for finding symmetric weights for taking weighted averages to accommodate extraordinary (or irregular) vertices in surface subdivisions, a topic to be studied in a continuation paper. By allowing the use of matrices as weights, the SSTs introduced in this paper may be constructed to overcome the size barrier limited to scalar-valued interpolatory subdivision templates, and thus avoiding the unnecessary surface oscillation artifacts. On the other hand, while the old vertices in a (scalar) interpolatory subdivision scheme do not require a subdivision template, we will see that this is not the case for the matrix-valued setting. Here, we employ the same definition of interpolation subdivisions as in the usual scalar consideration, simply by requiring the old vertices to be stationary in the definition of matrix-valued interpolatory subdivisions. Hence, there would be another complication when the templates are extended to accommodate extraordinary vertices if the template sizes are not small. In this paper, we show that even for C² interpolatory subdivisions, only one “ring” is sufficient in general, for both old and new vertices. For example, for 1-to-4 split C² interpolatory surface subdivisions, we obtain matrix-valued symmetric interpolatory subdivision templates (SISTs) for both triangular and quadrilateral meshes with sizes that agree with those of the Loop and Catmull–Clark schemes, respectively. Matrix-valued SISTs of similar sizes are also constructed for C² interpolatory and subdivision schemes in this paper. In addition to small template sizes, an obvious feature of matrix-valued weights is the flexibility for introducing shape-control parameters. Another significance is that, in contrast to the usual scalar setting, matrix-valued SISTs can be formulated in terms of the coefficient sequence of some vector refinement equation of interpolating bivariate C² splines with small support. For example, by modifying the spline function vectors introduced in our previous work [C.K. Chui, Q.T. Jiang, Surface subdivision schemes generated by refinable bivariate spline function vectors, Appl. Comput. Harmon. Anal. 15 (2003) 147–162; C.K. Chui, Q.T. Jiang, Refinable bivariate quartic and quintic C²-splines for quadrilateral subdivisions, Preprint, 2004], C² symmetric interpolatory subdivision schemes associated with refinement equations of C² cubic and quartic splines on the 6-directional and 4-directional meshes, respectively, are also constructed in this paper.     

On Symmetric Association Schemes with k 1=3

In this paper, we have a classification of primitive symmetric association schemes with k ₁ = 3.     

Imprimitive cometric association schemes: Constructions and analysis

Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others being left as open problems. In particular, we prove that any Q-antipodal association scheme is dismantlable: the configuration induced on any subset of the equivalence classes in the Q-antipodal imprimitivity system is again a cometric association scheme. Further examples are explored. Dedicated to the memory of Dom de Caen, 1956—2002.     

Error estimates for a discontinuous Galerkin method with interior penalties applied to nonlinear Sobolev equations

A Discontinuous Galerkin method with interior penalties is presented for nonlinear Sobolev equations. A semi‐discrete and a family of fully‐discrete time approximate schemes are formulated. These schemes are symmetric. Hp‐version error estimates are analyzed for these schemes. For the semi‐discrete time scheme a priori L^∞(H¹) error estimate is derived and similarly, l^∞(H¹) and l²(H¹) for the fully‐discrete time schemes. These results indicate that spatial rates in H¹ and time truncation errors in L² are optimal. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Geometric construction of some families of two-class and three-class association schemes from nondegenerate quadrics in characteristic two

1.IntroductionThetheoryoflinearspacesintriteprojectivegeometryhasbeenusedbyseveralauthorsinconstructingBIBandPBIBdesigns.BoseI21firstusedthepropertiesofquadricsurfaCesinfiniteprojectivegeometryoftwoandthreedimensionsforconstr-netingexperimelltaldesigns.D.K.Ray-Chaudhurils]usedthegeometryofquadricstoconstructseveralseriesofPBIBdesignswithtwoassociateclasses.I.M.Chakravartila]usednondegenerateanddegenerateHebotianvarietiestoconstructsomefamiliesoftwo-classandthree-classassociationschemes…     

Reduction of the number of associate classes of hypercubic association schemes

The reduction of the number of associate classes of some hypercubic association schemes by clubbing certain associate classes has been studied in the paper. It has been found that the reduction of anm-class hypercubic association scheme forv=2 ^m treatments into a 2-class association scheme is always possible. Further it is proved herein that them-class hypercubic association scheme forv=s ^m treatments is reducible (i) to a 3-class association scheme, whens=3 and (ii) to a 2-class association scheme, whens=4, which really hasp ₁₁ ¹ =p ₁₁ ² and hence leads to a series of balanced incomplete block designs.     

Square root 3 -Subdivision Schemes: Maximal Sum Rule Orders

   Abstract. Subdivision with finitely supported masks is an efficient method to create discrete multiscale representations of smooth surfaces for CAGD applications. Recently a new subdivision scheme for triangular meshes, called

On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations

For a given non-symmetric commutative association scheme, by fusing all the non-symmetric relations pairwise with their symmetric counterparts, we can obtain a new symmetric association scheme. In this paper, we introduce a set of feasibility and realizability conditions for a class e symmetric association scheme to be split into a class e+1 non-symmetric commutative association scheme. By applying the feasibility and realizability conditions, we obtain a classification into six categories of the class 4 non-symmetric fission schemes of group-divisible 3-schemes. Complete solutions for three of the six categories and partial results for the remaining cases are presented.     

Classification of three-class association schemes using backtracking with dynamic variable ordering

We describe several techniques for the exhaustive computer generation of non-isomorphic association schemes with a given set of intersection numbers using a backtracking algorithm with forward checking and dynamic variable ordering. We have applied these techniques to the classification of certain open parameter sets for three-class association schemes listed by Van Dam in (Three-class association schemes, J. Algebraic Combin. 10 (1999) 69–107) for which we present several new results. Among these are some new (imprimitive) distance regular graphs of diameter 3.     

A Pair of Families of Non-isomorphic Group Association Schemes with the same Parameters

We show that for the split and non-split extensions ofFq²bySL (2, q) (q =  2^e,e  ≥  3), the group association schemes have the same parameters but are not isomorphic. For the split and non-split extensions ofFq²by the standard Borel subgroup of SL(2,q ) (q =  2^e, e ≥  3), the group association schemes are shown to be isomorphic.     

A Symmetric Characteristic Finite Volume Element Scheme for Nonlinear Convection-Diffusion Problems

In this paper, we implement alternating direction strategy and construct a symmetric FVE scheme for nonlinear convection-diffusion problems. Comparing to general FVE methods, our method has two advantages. First, the coefficient matrices of the discrete schemes will be symmetric even for nonlinear problems. Second, since the solution of the algebraic equations at each time step can be inverted into the solution of several one-dimensional problems, the amount of computation work is smaller. We prove the optimal H1-norm error estimates of order O（△t2 ＋ h） and present some numerical examples at the end of the paper.     

On Even Generalized Table Algebras

Generalized table algebras were introduced in Arad, Fisman and Muzychuk (Israel J. Math. 114 (1999), 29–60) as an axiomatic closure of some algebraic properties of the Bose-Mesner algebras of association schemes. In this note we show that if all non-trivial degrees of a generalized integral table algebra are even, then the number of real basic elements of the algebra is bounded from below (Theorem 2.2). As a consequence we obtain some interesting facts about association schemes the non-trivial valencies of which are even. For example, we proved that if all non-identical relations of an association scheme have the same valency which is even, then the scheme is symmetric.     

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).     

Finite volume methods on Voronoi meshes

Two cell-centered finite difference schemes on Voronoi meshes are derived and investigated. Stability and error estimates in a discrete H¹-norm for both symmetric and nonsymmetric problems, including convection dominated, are proven. The theoretical results are illustrated with several numerical experiments. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14:193–212, 1998     

Interior penalty discontinuous Galerkin methods with implicit time‐integration techniques for nonlinear parabolic equations

We prove existence and numerical stability of numerical solutions of three fully discrete interior penalty discontinuous Galerkin methods for solving nonlinear parabolic equations. Under some appropriate regularity conditions, we give the l²(H¹) and l^∞(L²) error estimates of the fully discrete symmetric interior penalty discontinuous Galerkin–scheme with the implicit θ ‐schemes in time, which include backward Euler and Crank–Nicolson finite difference approximations. Our estimates are optimal with respect to the mesh size h. The theoretical results are confirmed by some numerical experiments. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups

A partial difference set having parameters (n ², r(n − 1), n + r ² − 3r, r ² − r) is called a Latin square type partial difference set, while a partial difference set having parameters (n ², r(n + 1), − n + r ² + 3r, r ² + r) is called a negative Latin square type partial difference set. Nearly all known constructions of negative Latin square partial difference sets are in elementary abelian groups. In this paper, we develop three product theorems that construct negative Latin square type partial difference sets and Latin square type partial difference sets in direct products of abelian groups G and G′ when these groups have certain Latin square or negative Latin square type partial difference sets. Using these product theorems, we can construct negative Latin square type partial difference sets in groups of the form where the s _i are nonnegative integers and s ₀ + s ₁ ≥ 1. Another significant corollary to these theorems are constructions of two infinite families of negative Latin square type partial difference sets in 3-groups of the form for nonnegative integers s _i . Several constructions of Latin square type PDSs are also given in p-groups for all primes p. We will then briefly indicate how some of these results relate to amorphic association schemes. In particular, we construct amorphic association schemes with 4 classes using negative Latin square type graphs in many nonelementary abelian 2-groups; we also use negative Latin square type graphs whose underlying sets can be elementary abelian 3-groups or nonelementary abelian 3-groups to form 3-class amorphic association schemes.