2022 Fiscal Year Final Research Report
Combinatorics related to representation theory and enumeration of paths
Project/Area Number |
18K03206
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Review Section |
Basic Section 11010:Algebra-related
|
Research Institution | Hokkaido University (2022) Shinshu University (2018-2021) |
Principal Investigator |
|
Project Period (FY) |
2018-04-01 – 2023-03-31
|
Keywords | Bijective proof / グラフ / Hook Length formula / 強レフシェッツ性 / トグリング群 / directed edge polytope |
Outline of Final Research Achievements |
We study an algorithm called Hillman-Grassl algorithm, which is used for a bijective prof of Hook Length formula. We introduced axioms to generalize the algorithm. In our theory, the algorithm is realized as an algorithm to create a path in some graphs. Moreover we apply our knowledge, obtained by this study, to the other tartgets as follows: 1. We study artinian gorenstein algebras defined by the weighted generating function of matcings. We show the Lefschetz property for the algebras. 2. We also study a quotient algebras monomial ideals. We calculate the determinants of multiplication map in the algebra. We show the Lefschetz property for the algebras. 3. We also study the structure of the toggling group of a path graph. We show the toggling group is the symmetric group on the independent sets of the path graph. 4. We also a polytope defined by a directed graph. We call it the directed edge polytope. We give an characterization for faces and facets of the polytope.
|
Free Research Field |
表現論的組合せ論
|
Academic Significance and Societal Importance of the Research Achievements |
本研究では, 組合せ論的構造に着目し, それらがコントールする代数的対象や多面体について研究を行いました. Hook Length formulaに対する研究では, 鍵となるアルゴリズムに対し, 一般化をした上で統一的な解釈を行いました. 代数系や多面体に対する研究では, 多面体の面の特徴付け与えるなどといった結果を得ており, 今後の研究に繋がることが期待できます.
|