Hostname: page-component-7479d7b7d-767nl Total loading time: 0 Render date: 2024-07-11T22:22:13.018Z Has data issue: false hasContentIssue false

CRESTED PRODUCTS OF ASSOCIATION SCHEMES

Published online by Cambridge University Press:  20 July 2005

R. A. BAILEY
Affiliation:
School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, United Kingdomr.a.bailey@qmul.ac.uk, p.j.cameron@qmul.ac.uk
PETER J. CAMERON
Affiliation:
School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, United Kingdomr.a.bailey@qmul.ac.uk, p.j.cameron@qmul.ac.uk
Get access

Abstract

The paper defines a new type of product of association schemes (and of the related objects, permutation groups and orthogonal block structures), which generalizes the direct and wreath products (which are referred to as ‘crossing’ and ‘nesting’ in the statistical literature). Given two association schemes $\mathcal{Q}_r$ for $r\,{=}\,1,2$, each having an inherent partition $F_r$ (that is, a partition whose equivalence relation is a union of adjacency relations in the association scheme), a product of the two schemes is defined, which reduces to the direct product if $F_1=U_1$ or $F_2=E_2$, and to the wreath product if $F_1 = E_1$ and $F_2 = U_2$, where $E_r$ and $U_r$ are the relation of equality and the universal relation on $\mathcal{Q}_r$. The character table of the crested product is calculated, and it is shown that, if the two schemes $\mathcal{Q}_1$ and $\mathcal{Q}_2$ have formal duals, then so does their crested product (and a simple description of this dual is given). An analogous definition for permutation groups with intransitive normal subgroups is created, and it is shown that the constructions for association schemes and permutation groups are related in a natural way.

The definition can be generalized to association schemes with families of inherent partitions, or permutation groups with families of intransitive normal subgroups. This time the correspondence is not so straightforward, and it works as expected only if the inherent partitions (or orbit partitions) form a distributive lattice.

The paper concludes with some open problems.

Keywords

Type
Notes and Papers
Copyright
The London Mathematical Society 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)