加载中…
For fixed , we consider the subgraph of the famous Young–Fibonacci graph formed by the words with at most 2-s. The jump graph is a graded graph is defined as follows: each level is identified with , and an edge between two vertices and , , of neighbouring levels us drawn iff is a descendant of in . The goal of this paper is to describe all central measures on the path space of .

生成讲解博客的中文版本

生成AI智能校验的中文版本