Characterizations of amorphic schemes and fusions of pairs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910860307333120 |
|---|---|
| author | van Dam, Edwin R. Koolen, Jack H. Xiong, Yanzhen |
| author_facet | van Dam, Edwin R. Koolen, Jack H. Xiong, Yanzhen |
| contents | An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the set of relations, where a pair forms an edge if it fuses. We show that if the fusing-relations graph is connected but not a path, then the association scheme is amorphic. As a side result, we show that if an association scheme has at most one relation that is neither strongly regular of Latin square type nor strongly regular of negative Latin square type, then it is amorphic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_00567 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Characterizations of amorphic schemes and fusions of pairs van Dam, Edwin R. Koolen, Jack H. Xiong, Yanzhen Combinatorics An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the set of relations, where a pair forms an edge if it fuses. We show that if the fusing-relations graph is connected but not a path, then the association scheme is amorphic. As a side result, we show that if an association scheme has at most one relation that is neither strongly regular of Latin square type nor strongly regular of negative Latin square type, then it is amorphic. |
| title | Characterizations of amorphic schemes and fusions of pairs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2404.00567 |