Related papers: A Generalization of Markov Numbers
Graph LP algebras are a generalization of cluster algebras introduced by Lam and Pylyavskyy. We provide a combinatorial proof of positivity for certain cluster variables in these algebras. This proof uses a hypergraph generalization of…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
The representation problem of finite-dimensional Markov matrices in Markov semigroups is revisited, with emphasis on concrete criteria for matrix subclasses of theoretical or practical relevance, such as equal-input, circulant, symmetric or…
We introduce a notion of probabilistic convexity and generalize some classical globalization theorems in Alexandrov geometry. A weighted Alexandrov's lemma is developed as a basic tool.
We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with arbitrary heights as well as infinitely many balls, which are expressed more succinctly in…
For the first time, a general fractional calculus of arbitrary order was proposed by Yuri Luchko in the works Mathematics 9(6) (2021) 594 and Symmetry 13(5) (2021) 755. In these works, the proposed approaches to formulate this calculus are…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special…
The cluster multiplication formulas for a generalized quantum cluster algebra of Kronecker type are explicitly given. Furthermore, a positive bar-invariant $\mathbb{Z}[q^{\pm\frac{1}{2}}]$-basis of this algebra is constructed.
Many of the stochastic models used in inference of phylogenetic trees from biological sequence data have polynomial parameterization maps. The image of such a map --- the collection of joint distributions for a model --- forms the model…
Special generic maps are generalizations of Morse functions with exactly two singular points on spheres and canonical projections of unit spheres. They restrict the manifolds of the domains strongly in considerable cases and are important…
Markov numbers are integers that appear in triples which are solutions of a Diophantine equation, the so-called Markov cubic $$x^2 + y^2 + z^2 - 3x y z = 0.$$ A classical topic in number theory, these numbers are related to many areas of…
It is known that the Kimura 3ST model of sequence evolution on phylogenetic trees can be extended quite naturally to arbitrary split systems. However, this extension relies heavily on mathematical peculiarities of the K3ST model, and…
In these notes we generalize the theory of graphical functions from scalar theories to theories with spin.
Recently Krichever proposed a generalization of the amoeba and the Ronkin function of a plane algebraic curve. In our paper higher-dimensional version of this generalization is studied. We translate to the generalized case different…
Consider a finite irreducible Markov chain with invariant distribution $\pi$. We use the inner product induced by $\pi$ and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set…
Motivated by Fomin and Zelevinsky's theory of cluster algebras we introduce a variant of the Markov equation; we show that all natural solutions of the equation arise from an initial solution by cluster transformations.
The generalized cluster complex was introduced by Fomin and Reading, as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex we associate a…
Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…