Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2604.06538 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918433348648960 |
|---|---|
| author | van Dam, Edwin Koolen, Jack H. Xiong, Yanzhen |
| author_facet | van Dam, Edwin Koolen, Jack H. Xiong, Yanzhen |
| contents | An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed 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 must be amorphic. We now construct non-amorphic $d$-class association schemes in which precisely two relations are not strongly regular of Latin square type or strongly regular of negative Latin square type, for any $d \geq 4$. We also raise the question whether different types of strongly regular graphs can coexist in an association scheme. Among some other results, we show that if one of the relations is a lattice graph, then any other strongly regular relation in the scheme must be of Latin square type. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_06538 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Almost amorphic association schemes van Dam, Edwin Koolen, Jack H. Xiong, Yanzhen Combinatorics An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed 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 must be amorphic. We now construct non-amorphic $d$-class association schemes in which precisely two relations are not strongly regular of Latin square type or strongly regular of negative Latin square type, for any $d \geq 4$. We also raise the question whether different types of strongly regular graphs can coexist in an association scheme. Among some other results, we show that if one of the relations is a lattice graph, then any other strongly regular relation in the scheme must be of Latin square type. |
| title | Almost amorphic association schemes |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.06538 |