Enumeration of Paths in the Young–Fibonacci Graph

被引：0
|
作者：
Evtushevsky V.Y. [1 ]
机构：
[1] St.Petersburg State University, St.Petersburg
来源：
Journal of Mathematical Sciences | 2020年 / 247卷 / 5期
关键词：
D O I：
10.1007/s10958-020-04829-7
中图分类号：
学科分类号：
摘要：
The Young–Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the number of paths between two vertices of the Young–Fibonacci graph which is polynomial with respect to the minimum of their ranks. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.
引用
收藏
页码：663 / 679
页数：16
相关论文
共 50 条
12345