Zap. Nauchn. Sem. POMI, 2019, Volume 481, Pages 39–62
Enumeration of paths in the Young–Fibonacci graph
V. Yu. Evtushevsky
Saint Petersburg State University
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.
Key words and phrases:
graded graph, Young–Fibonacci graph, differential graph.
PDF file (362 kB)
V. Yu. Evtushevsky, “Enumeration of paths in the Young–Fibonacci graph”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part XXX, Zap. Nauchn. Sem. POMI, 481, POMI, St. Petersburg, 2019, 39–62
Citation in format AMSBIB
\paper Enumeration of paths in the Young--Fibonacci graph
\inbook Representation theory, dynamical systems, combinatorial and algoritmic methods. Part~XXX
\serial Zap. Nauchn. Sem. POMI
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|