Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Zapiski Nauchnykh Seminarov POMI, 2019, Volume 481, Pages 39–62 (Mi znsl6777)  
Enumeration of paths in the Young–Fibonacci graph

V. Yu. Evtushevsky

Saint Petersburg State University
Full-text PDF (362 kB)
References:
PDF
HTML
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.
Key words and phrases: graded graph, Young–Fibonacci graph, differential graph.
Received: 17.09.2019
Document Type: Article
UDC: 519.115
Language: Russian
Citation: 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
\Bibitem{Evt19}
\by V.~Yu.~Evtushevsky
\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
\yr 2019
\vol 481
\pages 39--62
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl6777}
Linking options:
  • https://www.mathnet.ru/eng/znsl6777
  • https://www.mathnet.ru/eng/znsl/v481/p39
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:139
    Full-text PDF :70
    References:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024