Enumeration of paths in the Young-Fibonacci graph

DOI10.1007/S10958-020-04829-7MaRDI QIDQ2202699zbMATH OpenOpenAlexFDO

Authors V. Yu. Evtushevsky

Publication date 29 September 2020

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.06379

zbMATH Keywords

Hasse diagram

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Lattices (06B99)

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.

Recommendations

• Enumeration of edges in some lattices of paths
• Duality of graded graphs
• scientific article; zbMATH DE number 1845549
• The Plancherel measure of the Young–Fibonacci graph
• scientific article; zbMATH DE number 3987281

Cites work

• Algebras Associated to the Young-Fibonacci Lattice
• Asymptotic theory of path spaces of graded graphs and its applications
• Differential Posets
• Duality of graded graphs
• scientific article; zbMATH DE number 4079428 (Why is no real title available?)
• The Degree Formula for the Skew-Representations of the Symmetric Group
• The Martin boundary of the Young-Fibonacci lattice

Cited in

(4)

• Duality of graded graphs
• Enumeration of paths, compositions of integers, and Fibonacci numbers
• The Plancherel measure of the Young–Fibonacci graph
• Enumeration of edges in some lattices of paths

This page was built for publication: Enumeration of paths in the Young-Fibonacci graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202699)