Enumeration of paths in Young--Fibonacci graph
Combinatorics
2020-12-14 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2012.06379,
title = {Enumeration of paths in Young--Fibonacci graph},
author = {Vsevolod Evtushevsky},
journal= {arXiv preprint arXiv:2012.06379},
year = {2020}
}
Comments
105 pages, Russian, short English version avaible at https://link.springer.com/article/10.1007/s10958-020-04829-7