Related papers: Christoffel Words and Markoff Triples: An Algebrai…
Markoff triples are parametrized uniquely by Christoffel words.
The elements of Markoff triples are given by coefficients in certain matrix products defined by Christoffel words, and the Markoff injectivity conjecture, a long-standing open problem (also known as the uniqueness conjecture), is then…
We define Markoff words as certain factors appearing in bi-infinite words satisfying the Markoff condition. We prove that these words coincide with central words, yielding a new characterization of Christoffel words.
We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two Sturmian words with the same language have (almost always)…
We discuss certain matrices associated with Christoffel words, and show that they have a group structure. We compute their determinants and show a relationship between the Zolotareff symbol from number theory.
Markov numbers, i.e. positive integers appearing in solutions to $x^2 + y^2 + z^2 = 3xyz$, can be viewed as specializations of cluster variables. The second author and Matsushita gave a generalization of the Markov equation, $x^2 + y^2 +…
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…
We exhibit combinatorial results on Christoffel words and binary balanced words that are motivated by their geometric interpretation as approximations of digital segments. We give a closed formula for counting the exact number of balanced…
We propose a simple new combinatorial model to study spaces of acyclic Jacobi diagrams, in which they are identified with algebras of words modulo operations. This provides a starting point for a word-problem type combinatorial…
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$…
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…
We focus on the problem of producing new modular tensor categories from Hopf algebras. To do this, we first give a general method to construct factorizable Hopf algebras. Then we apply the method to construct two families of ribbon…
In this paper, we define and classify the sign-equivalent exchange matrices. We give a Diophantine explanation for the differences between rank 2 cluster algebras of finite type and affine type based on \cite{CL24}. We classify the positive…
The paper presents a linguistic and computational model aiming at making the morphological structure of the lexicon emerge from the formal and semantic regularities of the words it contains. The model is word-based. The proposed…
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…
In leading morpho-phonological theories and state-of-the-art text-to-speech systems it is assumed that word pronunciation cannot be learned or performed without in-between analyses at several abstraction levels (e.g., morphological,…
We study and classify faithfully balanced modules for the algebra of lower triangular $n$ by $n$ matrices. The theory extends known results about tilting modules, which are classified by binary trees, and counted with the Catalan numbers.…
This survey article gives an elementary introduction to the algebraic approach to Markov process duality, as opposed to the pathwise approach. In the algebraic approach, a Markov generator is written as the sum of products of simpler…
More and more languages in the world are under study nowadays, as a result, the traditional way of historical linguistics study is facing some challenges. For example, the linguistic comparative research among languages needs manual…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us to give a combinatorial interpretation of the Macdonald identities for affine root systems of the seven…