| Project/Area Number |
24K22830
|
|---|
| Research Category |
Grant-in-Aid for Research Activity Start-up
|
| Allocation Type | Multi-year Fund |
|---|
| Review Section |
0201:Algebra, geometry, analysis, applied mathematics,and related fields
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
MUKHERJEE SAYAN 東京大学, 大学院理学系研究科(理学部), 特任助教 (90998527)
|
|---|
| Project Period (FY) |
2024-07-31 – 2026-03-31
|
| Project Status |
Granted (Fiscal Year 2024)
|
| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2025: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2024: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | Graph Theory / Extremal Combinatorics / Tensor Networks / Computer Science |
|---|
| Outline of Research at the Start |
In extremal graph theory, people are interested in analyzing the structure of graphs that maximize or minimize some graph parameter under given constraints. We plan to analyze such extremal problems, and their applications to diverse areas such as optimizing tensor network contraction, social network analysis, and different areas of computer science. We will make use of tools such as algebra, probability theory and other mathematical tools, as well as techniques involving algorithms and programming.
|
