2023/12/20 by Evtushevsky, Vsevolod
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2312.13413
For fixed k, we consider the subgraph YFk=(Vk,Ek) of the famous Young--Fibonacci graph formed by the words with at most k 2-s. The jump graph is a graded graph is defined as follows: each level is identified with Vk, and an edge between two vertices (v1,i) and (v2,i+1), v1,v2∈ Vk, of neighbouring levels us drawn iff v2 is a descendant of v1 in YFk. The goal of this paper is to describe all central measures on the path space of YFk.