Related papers: A Generalization of Markov Numbers

We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

The present paper deals with a generalization of the Baskakov operators. Some direct theorems, asymptotic formula and $A$-statistical convergence are established. Our results are based on a $\rho$ function. These results include the…

We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To…

We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials…

In this paper we consider all possible generalizations of the B-type Hecke algebras, namely the cyclotomic and what we call 'generalized', and we construct Markov traces on each of them, so as to obtain all possible different levels of…

We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these…

We study projective manifolds with nonamenable and non-residually finite fundamental groups. We generalize the uniformization theorem of our earlier note. We generalize a classical theorem of Maltsev about finitely generated subgroups of…

Many learning algorithms can be represented as Markov processes, and understanding their generalization error is a central topic in learning theory. For specific continuous-time noisy algorithms, a prominent analysis technique relies on…

Determining potential probability distributions with a given causal graph is vital for causality studies. To bypass the difficulty in characterizing latent variables in a Bayesian network, the nested Markov model provides an elegant…

In this paper we consider the original and different generalizations of Postnikov-Shapiro algebra which enumerate forests and trees of graphs, see~\cite{PSh}. Our main result is that the algebra counting forests depends only on graphical…

We study the solutions of the Rosenberg--Markoff equation ax^2+by^2+cz^2 = dxyz (a generalization of the well--known Markoff equation). We specifically focus on looking for solutions in arithmetic progression that lie in the ring of…

We describe estimators $\chi_n(X_0,X_1,...,X_n)$, which when applied to an unknown stationary process taking values from a countable alphabet ${\cal X}$, converge almost surely to $k$ in case the process is a $k$-th order Markov chain and…

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

Motivated by the work of Boston, Jones and Goksel, we propose a Markov model for the factorisation of post-critically finite (PCF) cubic polynomials f. Using the information encoded in the critical orbits, we define a Markov model for PCF…

Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…

Snake graphs appear naturally in the theory of cluster algebras. For cluster algebras from surfaces, each cluster variable is given by a formula which is parametrized by the perfect matchings of a snake graph. In this paper, we identify…

In the present paper we study a unified approach for Quantum Markov Chains. A new quantum Markov property that generalizes the old one, is discussed. We introduce Markov states and chains on general local algebras, possessing a generic…

In this paper we consider the problem of computing the stationary distribution of nearly completely decomposable Markov processes, a well-established area in the classical theory of Markov processes with broad applications in the design,…

We realize a family of generalized cluster algebras as Caldero-Chapoton algebras of quivers with relations. Each member of this family arises from an unpunctured polygon with one orbifold point of order 3, and is realized as a…