| Project/Area Number |
22K03403
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Review Section |
Basic Section 12030:Basic mathematics-related
|
|---|
| Research Institution | Shimane University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2022-04-01 – 2025-03-31
|
| Project Status |
Discontinued (Fiscal Year 2023)
|
| Budget Amount *help |
¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2024: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2023: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2022: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Keywords | association scheme / strongly regular graph / graph isomorphism / distance-regular graph |
|---|
| Outline of Research at the Start |
We will continue investigation of 3-tuple intersection numbers of association schemes, in particular, the Grassmann schemes. We plan to study how some graph operations affect the WL-dimension. The main research target will be a proof that the ISO problem of circular-arc graphs is polynomial time.
|
| Outline of Annual Research Achievements |
1. With Ponomarenko (Saint-Petersburg, the Steklov Institute of Mathematics) and Guo, Cai (Hainan University), we constructed exponentially many strongly regular graphs with bounded Weisfeiler-Leman dimension. The paper is under review.
2. With Suda (National Defence Academy), we showed that The paper is prepared for submission.
3. With Kabanov (Krasovskii Institute of Mathematics), we determined all strongly regular graphs that are decomposable into divisible design graphs and a Delsarte clique. The paper is prepared for submission.
4. With Abiad, Khramova (Eindhoven University), we computed a linear programmig bound for sum-rank-metric codes. The paper is prepared for submission.
|
| Current Status of Research Progress |
Current Status of Research Progress
2: Research has progressed on the whole more than it was originally planned.
Reason
We expected to obtain the above results.
|
| Strategy for Future Research Activity |
1. We plan to improve the Weisfeiler-Leman dimension of permutation graphs
and use this to to determine the Weisfeiler-Leman dimension of circular-arc
graphs without 3-coclique (joint with Ponomarenko, Nedela, Zeman).
2. We plan to study coherent configurations of Cartesian products of graphs.
This may help to improve linear programming bounds for sum-rank-metirc codes.
|
