Project Details
Description
We proposed to study the character tables, that is, the first and the second eigenmatrices of association schemes. The computations on character tables on the Hamming schemes and the Johnson schemes are repeated. More examples on character tables may hint what properties P- polynomial and Q-polynomial association schemes should hold. In the last section several other related studies are presented, such almost cover problems and the study of quantum isomorphism between simple graphs.
| Status | Finished |
|---|---|
| Effective start/end date | 2022/08/01 → 2023/07/31 |
Keywords
- Association scheme
- character table
- Hamming scheme
- Johnson scheme
- P-polynomial scheme
- Q-polynomial scheme
- distance-transitive graph
- almost cover
- quantum isomorphism
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.