Skip Navigation

Journal of the London Mathematical Society 2005 72(1):1-24; doi:10.1112/S0024610705006666
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bailey, R. A.
Right arrow Articles by Cameron, P. J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The London Mathematical Society

Crested Products of Association Schemes

R. A. Bailey and Peter J. Cameron

School of Mathematical Sciences, Queen Mary, University of London Mile End Road, London E1 4NS, United Kingdom r.a.bailey{at}qmul.ac.uk, p.j.cameron{at}qmul.ac.uk
School of Mathematical Sciences, Queen Mary, University of London Mile End Road, London E1 4NS, United Kingdom p.j.cameron{at}qmul.ac.uk

Received 26 November 2003.

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 Qr for r = 1,2, each having an inherent partition Fr (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 F1 = U1 or F2 = E2, and to the wreath product if F1 = E1 and F2 = U2, where Er and Ur are the relation of equality and the universal relation on Qr. The character table of the crested product is calculated, and it is shown that, if the two schemes Q1 and Q2 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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.