Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.14948 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914880152403968 |
|---|---|
| author | Kravchuk, Artem |
| author_facet | Kravchuk, Artem |
| contents | A Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group $Sym_n$ generated by all transpositions. This paper shows how the spectrum of $T_n$ can be obtained using the spectral properties of the Jucys-Murphy elements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_14948 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | One more proof about the spectrum of Transposition graph Kravchuk, Artem Combinatorics A Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group $Sym_n$ generated by all transpositions. This paper shows how the spectrum of $T_n$ can be obtained using the spectral properties of the Jucys-Murphy elements. |
| title | One more proof about the spectrum of Transposition graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2407.14948 |