Computing Isomorphisms of Association Schemes and its Application
โ Scribed by Izumi Miyamoto
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 270 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
โฆ Synopsis
Isomorphisms of association schemes are isomorphisms of edge-labeled regular graphs permitting to permute the labels. We give an algorithm computing isomorphisms of association schemes using their algebraic property. We also study an application of computing isomorphisms of association schemes to computing normalizers of permutation groups.
๐ SIMILAR VOLUMES
Given a reaction mechanism we show how a symbolic computation approach can be used to develop the kinetic equations by identifying the reaction scheme with an equivalent matrix. Our method is also applicable in cases where the stoichiometric matrix approach fails. The specific algorithm that is writ
It is shown that the group association scheme for the split extension of 2 3 by SL 3 (2) is not isomorphic to that for the non-split extension , although they have the same set of parameters (intersection numbers) .
We shall describe an algorithm based on an idea of Roggenkamp and Scott (Roggenkamp and Scott, 1993) ) to compute \(\mathrm{Hom}_{\text {alg }}(\mathbb{F} H, \mathbb{F} G\) ), where \(H, G\) are finite \(p\)-groups and \(\mathbb{F} H, \mathbb{F} G\) are their group algebras over \(\mathbb{F}=\mathbb
We show that for the split and non-split extensions of F 2 q by S L(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 of F 2 q by the standard Borel subgroup of S L(2, q) (q = 2 e , e โฅ 3), the group associa