Related papers: Patterns Within the Markov Tree

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

The $k$-Markov numbers, introduced by Gyoda and Matsushita, are those which appear in positive integral solutions to $x^2 + y^2 + z^2 + k(xy + xz + yz) = (3+3k)xyz$. When $k =0$, this recovers the ordinary Markov numbers. A long-standing…

Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…

We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…

This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…

Marked mesh patterns are a very general type of permutation pattern. We examine a particular marked mesh pattern originally defined by Kitaev and Remmel, and show that its generating function is described by the $r$-Stirling numbers. We…

Inspired by biological dynamics, we consider a growth Markov process taking values on the space of rooted binary trees, similar to the Aldous-Shields model. Fix $n\ge 1$ and $\beta>0$. We start at time 0 with the tree composed of a root…

This work builds upon the recent monograph [5] on self-similar Markov trees. A self-similar Markov tree is a random real tree equipped with a function from the tree to $[0,\infty)$ that we call the decoration. Here, we construct local time…

Let k>=2 and let (Q_{n}^{(k)})_{n>=2-k} be the k-generalized Pell sequence defined by Q_{n}^{(k)}=2Q_{n-1}^{(k)}+Q_{n-2}^{(k)}+...+Q_{n-k}^{(k)} for n>=2 with initial conditions Q_{-(k-2)}^{(k)}=Q_{-(k-3)}^{(k)}=...=Q_{-1}^{(k)}=0,…

We study the RG flow of N=1 world-volume gauge theories of D3-brane probes on certain singular Calabi-Yau threefolds. Taking the gauge theories out of conformality by introducing fractional branes, we compute the NSVZ beta-function and…

The $3x+1$ Problem asks if whether for every natural number $n$, there exists a finite number of iterations of the piecewise function $$f(2n)=n, \quad f(2n-1)=6n-2, $$ with an iterate equal to the number $1$, or in other words, every…

The general Markov model of the evolution of biological sequences along a tree leads to a parameterization of an algebraic variety. Understanding this variety and the polynomials, called phylogenetic invariants, which vanish on it, is a…

The 3n+1, or Collatz problem, is one of the hardest math problems, yet still unsolved. The Collatz conjecture is to prove or disprove that the Collatz sequences COL(n) always eventually reach the number of 1, for all n belongs to N+ (all…

We construct a four-parameter family of Markov processes on infinite Gelfand-Tsetlin schemes that preserve the class of central (Gibbs) measures. Any process in the family induces a Feller Markov process on the infinite-dimensional boundary…

We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative…

We study the joint occurrence of large values of a Markov random field or undirected graphical model associated to a block graph. On such graphs, containing trees as special cases, we aim to generalize recent results for extremes of Markov…

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…

We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…

In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…