Related papers: Christoffel words and Markoff triples
We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…
Timed words are words where letters of the alphabet come with time stamps. We extend the definitions of semistandard tableaux, insertion, Knuth equivalence, and the plactic monoid to the setting of timed words. Using this, Greene's theorem…
We introduce the notion of $\alpha$-numbers and formal intercept of sturmian words, and derive from this study general factorisations formula for sturmian words. Sturmian words are defined as infinite words with lowest unbound complexity,…
The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural…
The Markov numbers are the positive integer solutions of the Diophantine equation $x^2 + y^2 + z^2 = 3xyz$. Already in 1880, Markov showed that all these solutions could be generated along a binary tree. So it became quite usual (and…
We show that strongly positively recurrent Markov shifts (in particular shifts of finite type) are classified up to Borel conjugacy by their entropy, period and their numbers of periodic points.
First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…
The paper contains a detailed computation about the algebra of canonical commutation relation, the representation of the Weyl unitaries, the quasi-free states and their von Neumann entropy. The Markov triplet is defined by constant entropy…
Markov categories are a recent categorical approach to the mathematical foundations of probability and statistics. Here, this approach is advanced by stating and proving equivalent conditions for second-order stochastic dominance, a widely…
The Christoffel-Darboux kernels for orthogonal polynomials in several real variables are investigated within the context of the three term recurrence relation reformulated for this purpose. Examples of orthogonal polynomials on the unit…
A general criterion is given for when a Markov chain trapped with probability p(x) in state x will be almost surely trapped. The quenched (state x is a trap forever with probability p(x)) and annealed (state x traps with probability p(x) on…
In this note, we present few examples of Piecewise Deterministic Markov Processes and their long time behavior. They share two important features: they are related to concrete models (in biology, networks, chemistry,. . .) and they are…
We introduce Markov substitute processes, a new model at the crossroad of statistics and formal grammars, and prove its main property : Markov substitute processes with a given support form an exponential family.
A method of constructing Markov chains on finite state spaces is provided. The chain is specified by three constraints: stationarity, dependence and marginal distributions. The generalized Pythagorean theorem in information geometry plays a…
For arbitrary reduced words we give formulas for the crystal structures on string and Lusztig data of type A as well as the defining inequalities of the corresponding polytopes revealing certain dualities between them.
We provide a parametrisation of a loxodrome by three specially arranged cycles. The parametrisation is covariant under fractional linear transformations of the complex plane and naturally encodes conformal properties of loxodromes. Selected…
Markov combination is an operation that takes two statistical models and produces a third whose marginal distributions include those of the original models. Building upon and extending existing work in the Gaussian case, we develop Markov…
A class of trigonometric interpolation splines depending on parameter vectors, selected convergence factors and interpolation factors is considered. The concept of crosslink grids and interpolation grids is introduced; these grids can match…
We study infinite binary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponents. This extends results by Fici and Zamboni [TCS 2013]. Interestingly, the words with 18 and 20…
The sum of symmetric Markov dependent three-point random variables is approximated by the difference of two independent Poisson random variables (Skellam random variable). The accuracy is estimated in local, total variation and Wasserstein…