Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Evtushevsky, Vsevolod"'
Autor:
Evtushevsky, Vsevolod
For a poset $(P,\leqslant)$ we consider the first-order theory, that is defined by set $P$ and relation $\leqslant$. The problem of undecidability of combinatorial theories attracts significant attention. Recently A. Wires proved the undecidability o
Externí odkaz:
http://arxiv.org/abs/2411.17739
Autor:
Evtushevsky, Vsevolod
We describe Martin boundary of the path space of $r$-differential version of Young--Fibonacci graph. Also we establish ergodicity of the corresponding measures.
Comment: 23 pages, in Russian
Comment: 23 pages, in Russian
Externí odkaz:
http://arxiv.org/abs/2411.16756
Autor:
Evtushevsky, Vsevolod
For fixed $k$, we consider the subgraph $YF_k=(V_k,E_k)$ 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 $V_k$, and an edge between t
Externí odkaz:
http://arxiv.org/abs/2312.13413
Autor:
Evtushevsky, Vsevolod
Among central measures on the path space of the Young--Fibonacci lattice the so-called Plancherel measure has a special role. Its ergodicity was proved by Kerov and Gnedin. The goal of this cycle of two articles is to prove that remaining measures fr
Externí odkaz:
http://arxiv.org/abs/2012.08107
Autor:
Bochkov, Ivan, Evtushevsky, Vsevolod
Among central measures on the path space of the Young--Fibonacci lattice the so-called Plancherel measure has a special role. Its ergodicity was proved by Kerov and Gnedin. The goal of this cycle of two articles is to prove that remaining measures fr
Externí odkaz:
http://arxiv.org/abs/2012.07447
Autor:
Evtushevsky, Vsevolod
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 path
Externí odkaz:
http://arxiv.org/abs/2012.06379