2020/12/11 by Vsevolod Evtushevsky, Evtushevsky, Vsevolod
Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Random Matrices and Applications
paper · pdf · doi:10.48550/arxiv.2012.06379
openalex publication_date 2020/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.