𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characters of Association Schemes and Normal Closed Subsets

✍ Scribed by Akihide Hanaki

Publisher
Springer Japan
Year
2003
Tongue
English
Weight
268 KB
Volume
19
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Maximal Closed Subsets in Association
On Maximal Closed Subsets in Association Schemes
✍ Paul-Hermann Zieschang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 274 KB

We offer a sufficient condition for a closed subset in an association scheme to be maximal. The result generalizes naturally the well-known (group-theoretical) fact that the one-point-stabilizer of a flag transitive automorphism group of a 2-design with \*=1 must be a maximal subgroup. In finite gro

Generalised Classes in Groups and Associ
Generalised Classes in Groups and Association Schemes: Duals of Results on Characters and Sharpness
✍ K.W. Johnson; E. Poimenidou πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 76 KB

A result of Strunkov on generalised conjugacy classes of groups is most conveniently expressed in terms of the P-matrix of an association scheme. This result is dual to a result of Blichfeldt on permutation characters, which has been shown by Cameron and Kiyota to hold for arbitrary characters and l

Two-arc closed subsets of graphs
Two-arc closed subsets of graphs
✍ Marston Conder; Margaret Morton; Cheryl E. Praeger πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract A subset of vertices of a graph is said to be 2‐arc closed if it contains every vertex that is adjacent to at least two vertices in the subset. In this paper, 2‐arc closed subsets generated by pairs of vertices at distance at most 2 are studied. Several questions are posed about the str