Related papers: Christoffel words and Markoff triples
We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.
For a positive integer $m>1$, if the generalized Markoff equation $a^2+b^2+c^2=3abc+m$ has a solution triple, then it has infinitely many solutions. We show that all positive solution triples are generated by a finite set of triples that we…
By making use of only simple facts about congruence, we first show that every even Markoff number is congruent to 2 modulo 32, and then, generalizing an earlier result of Baragar, establish the uniqueness for those Markoff numbers c where…
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
In this article, we extend the definition of Christoffel words to directed subgraphs of the hypercubic lattice in arbitrary dimension that we call Christoffel graphs. Christoffel graphs when $d=2$ correspond to well-known Christoffel words.…
A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a…
The Markoff injectivity conjecture states that $w\mapsto\mu(w)_{12}$ is injective on the set of Christoffel words where $\mu:\{\mathtt{0},\mathtt{1}\}^*\to\mathrm{SL}_2(\mathbb{Z})$ is a certain homomorphism and $M_{12}$ is the entry above…
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of…
The trapezoidal Fox conjecture states that the coefficient sequence of the Alexander polynomial of an alternating knot is unimodal. We are motivated by a harder question, the strong Fox conjecture, which asks whether the coefficient…
Some relations among Pythagorean triples are established. The main tool is a fundamental characterization of the Pythagorean triples through a chatetus which allows to determine relationships with Pythagorean triples having the same…
Contiguous hypergeometric relations for semiclassical discrete orthogonal polynomials are described as Christoffel and Geronimus transformations. Using the Christoffel-Geronimus-Uvarov formulas quasi-determinatal expressions for the shifted…
We introduce a deformed squared Markov equation given by $X^2 + Y^2 + Z^2 + (q+q^{-1})(XY+YZ+XZ) = 3(1 + q + q^{-1})XYZ$. Symmetric solutions of this new equation present a remarkable factorization property which allows us to talk about…
We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.
For Jacobi parameters belonging to one of the three classes: asymptotically periodic, periodically modulated and the blend of these two, we study the asymptotic behavior of the Christoffel functions and the scaling limits of the…
We define a new relation between character triples and prove some Clifford theory properties for weights in terms of character triples.
Borel and Reutenauer (2006) showed, \emph{inter alia}, that a word $w$ of length $n>1$ is conjugate to a Christoffel word if and only if for $k=0,1, \dots , n-1$, $w$ has $k+1$ distinct circular factors of length $k$. Sturmian words are the…
By a Christoffel matrix we mean a $n\times n$ matrix corresponding to the lexicographic array of a Christoffel word of length $n.$ In this note we show that if $R$ is an integral domain, then the product of two Christoffel matrices over $R$…
In this article, we consider the Christoffel transformations for skew-orthogonal polynomials and partial-skew-orthogonal polynomials. We demonstrate that the Christoffel transformations can act as spectral problems for discrete integrable…