| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654553 | European Journal of Combinatorics | 2006 | 8 Pages |
Abstract
Given a finite partially ordered set XX, and, for each xx in XX, an association scheme on a set ΩxΩx, we show how to define an association scheme on ∏xΩx∏xΩx in a way that specializes to iterated crossing and nesting when XX is series–parallel. The character table of the new association scheme is found.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
R.A. Bailey,