Related papers: Patterns Within the Markov Tree

We consider the Markoff-Rosenberger equation $$ax^2+by^2+cz^2=dxyz$$ with $(x,y,z)=(U_i,U_j,U_k),$ where $U_i$ denotes the $i$-th generalized Lucas number of first/second kind. We provide upper bound for the minimum of the indices and we…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

This article contains new tools for studying the shape of the stationary distribution of sizes in a dynamic economic system in which units experience random multiplicative shocks and are occasionally reset. Each unit has a Markov-switching…

We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…

Given a sequence of i.i.d. random functions $\Psi_{n}:\mathbb{R}\to\mathbb{R}$, $n\in\mathbb{N}$, we consider the iterated function system and Markov chain which is recursively defined by $X_{0}^{x}:=x$ and…

A Pythagorean triple is a triple of positive integers $(x,y,z)$ such that $x^2+y^2=z^2$. If $x,y$ are coprime and $x$ is odd, then it is called a primitive Pythagorean triple. Berggren showed that every primitive Pythagorean triple can be…

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…

Let $ \{L_n\}_{n\ge 0} $ be the sequence of Lucas numbers given by $ L_0=2, ~ L_1=1 $ and $ L_{n+2}=L_{n+1}+L_n $ for all $ n\ge 0 $. In the first paper, for an integer $d\geq 2$ which is square-free, we show that there is at most one value…

We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…

We consider a sequence of Markov chains $(\mathcal X^n)_{n=1,2,...}$ with $\mathcal X^n = (X^n_\sigma)_{\sigma\in\mathcal T}$, indexed by the full binary tree $\mathcal T = \mathcal T_0 \cup \mathcal T_1 \cup ...$, where $\mathcal T_k$ is…

We discuss properties of diophantine solutions of the Pythagoras equation, $a^2+b^2=c^2$, where the three numbers have no common factor. Some of the highlights are: (1) All triplets for which $c$ (called the `peak') is non-prime can be…

In this paper, we examine the Diophantine problem given by the equation $F_n = F_l^k (F_l^m - 1)$, where $n, l, m \geq 1$ and $k \geq 3$. Here, $\{ F_t \}_{t=0}^{\infty} $ denotes the Fibonacci numbers, defined by the recurrence relation…

One open problem in source coding is to characterize the limits of representing losslessly a non-identity discrete function of the data encoded independently by the encoders of several correlated sources with memory. This paper investigates…

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…

We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…

We study a special case of the vertex splitting model which is a recent model of randomly growing trees. For any finite maximum vertex degree $D$, we find a one parameter model, with parameter $\alpha \in [0,1]$ which has a so--called…

Methods of phylogenetic inference use more and more complex models to generate trees from data. However, even simple models and their implications are not fully understood. Here, we investigate the two-state Markov model on a tripod tree,…

Let $G$ be a finite tree with root $r$ and associate to the internal vertices of $G$ a collection of transition probabilities for a simple nondegenerate Markov chain. Embedd $G$ into a graph $G^\prime$ constructed by gluing finite linear…

Let $r, v, n$ be positive integers. This paper investigate the number of solutions $s_{r,v}(n)$ of the following infinite Diophantine equations $$ n=1^{r}\cdot |k_{1}|^{v}+2^{r}\cdot |k_{2}|^{v}+3^{r}\cdot |k_{3}|^{v}+\ldots, $$ for ${\bf…