Related papers: Christoffel words and Markoff triples
Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as…
The appearance of numerous period-doubling cascades is among the most prominent features of {\bf parametrized maps}, that is, smooth one-parameter families of maps $F:R \times {\mathfrak M} \to {\mathfrak M}$, where ${\mathfrak M}$ is a…
It is shown that two braids represent transversally isotopic links if and only if one can pass from one braid to another by conjugations in braid groups, positive Markov moves, and their inverses.
An alternative "flipped" version of the quartification model is obtained by rearrangement of the particle assignments. The model has two standard (trinification) families and one flipped quartification family. An interesting…
Proof systems for the Relativized Propositional Calculus are defined and compared.
Methods of constructing trigonometric fundamental splines with constant sign and sign-changing convergence factors are given. An example and graphics illustrating the concepts of convergence and interpolation grids are given. Some methods…
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 introduce a class of Markov chains, that contains the model of stochastic approximation by averaging and non-averaging. Using martingale approximation method, we establish various deviation inequalities for separately Lipschitz functions…
We construct a word-theoretic framework for generalized Markov numbers, that is, positive integers appearing in positive integer solutions of the generalized Markov equation $x^2+y^2+z^2+k_1yz+k_2zx+k_3xy=(3+k_1+k_2+k_3)xyz$. For each…
We define a quantity $c_m(n,k)$ as a generalization of the notion of the composition of the positive integer $n$ into $k$ parts. We proceed to derive some known properties of this quantity. In particular, we relate two partial Bell…
We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized…
We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian…
The theory of ``Markov-up'' processes is being developed. This is a new class of stochastic processes with ``partial'' markovian features; it could also be called ``one-sided Markov''. Such a behavior may be found in the real world and in…
Let k be a field. Let also (F, G) be a matched pair of groups. We give necessary and sufficient conditions on a pair (\sigma, \tau) of 2-cocycles in order that the crossed product algebra and the crossed coproduct coalgebra…
We construct versal and equimultiple versal deformations of the parametrization of a Legendrian curve.
We apply Monte Carlo Markov Chain methods to the stellar parameter estimation problem. This technique is useful when dealing with non-linear models and allows to derive realistic error bars on the inferred parameters. We give the first…
Stochastic processes find applications in modelling systems in a variety of disciplines. A large number of stochastic models considered are Markovian in nature. It is often observed that higher order Markov processes can model the data…
We prove that the Fibonacci word $f$ satisfies among all characteristic Sturmian words, three interesting extremal properties. The first concerns the length and the second the minimal period of its palindromic prefixes. Each of these two…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant…