2000 character limit reached
Enumeration of paths in Young--Fibonacci graph (2012.06379v1)
Published 11 Dec 2020 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.