Searcharxiv⌕ Search

arXiv subjects

Christophe Reutenauer

Publications and source records attributed to Christophe Reutenauer.

At least 37 records · Page 2Linked to original sources
arXiv2016

Counting the ideals of given codimension of the algebra of Laurent polynomials in two variables

We establish an explicit formula for the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb F}_q[x,y,x^{-1}, y^{-1}]$ of Laurent polynomials in two variables over a finite field of cardinality $q$. This number is a palindromic polynomial of degree $2n$ in $q$. Moreover, $C_n(q) = (q-1)^2 P_n(q)$, where $P_n(q)$ is another palindromic polynomial; the latter is a $q$-analogue of the sum of divisors of $n$, which happens to be the number of subgroups of ${\mathbb Z}^2$ of index $n$.

math.AG↗
arXiv2016

Hall sets, Lazard sets and comma-free codes

We investigate the relationship between two constructions of maximal comma-free codes described respectively by Eastman and by Scholtz and the notions of Hall sets and Lazard sets introduced in connection with factorizations of free monoids and bases of free Lie algebras.

math.CO↗
arXiv2016

The Fourier expansion of η(z)η(2z)η(3z)/η(6z)

We compute the Fourier coefficients of the weight one modular form $η(z)η(2z)η(3z)/η(6z)$ in terms of the number of representations of an integer as a sum of two squares. We deduce a relation between this modular form and translates of the modular form $η(z)^4/η(2z)^2$. In the last section we use our main result to give an elementary proof of an identity by Victor Kac.

math.NT↗
arXiv2015

Number of right ideals and a $q$-analogue of indecomposable permutations

We prove that the number of right ideals of codimension $n$ in the algebra of noncommutative Laurent polynomials in two variables over the finite field $\mathbb F\_q$ is equal to $(q-1)^{n+1} q^{\frac{(n+1)(n-2)}{2}}\sum\_θq^{inv(θ)}$, where the sum is over all indecomposable permutations in $S\_{n+1}$ and where $inv(θ)$stands for the number of inversions of $θ$.

math.CO↗
arXiv2015

Return words of linear involutions and fundamental groups

We investigate the natural codings of linear involutions. We deduce from the geometric representation of linear involutions as Poincaré maps of measured foliations a suitable definition of return words which yields that the set of first return words to a given word is a symmetric basis of the free group on the underlying alphabet $A$. The set of first return words with respect to a subgroup of finite index $G$ of the free group on $A$ is also proved to be a symmetric basis of $G$.

math.CO↗
arXiv2015

Maximal bifix decoding

We introduce a class of sets of words which is a natural common generalization of Sturmian sets and of interval exchange sets. This class of sets consists of the uniformly recurrent tree sets, where the tree sets are defined by a condition on the possible extensions of bispecial factors. We prove that this class is closed under maximal bifix decoding. The proof uses the fact that the class is also closed under decoding with respect to return words.

math.CO↗
arXiv2015

Acyclic, connected and tree sets

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words defined by the property of the extension graph of each word in the set to be acyclic or connected or a tree. We prove that in a uniformly recurrent tree set, the sets of first return words are bases of the free group on the alphabet. Concerning acyclic sets, we prove as a main result that a set $F$ is acyclic if and only if any bifix code included in $F$ is a basis of the subgroup that it generates.

math.CO↗
arXiv2015

The finite index basis property

We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbolic systems corresponding to Sturmian words. We introduce a class of sets of factors of an infinite word with linear factor complexity containing Sturmian sets and regular interval exchange sets, namemly the class of tree sets. We prove as a main result that for a uniformly recurrent tree set $F$, a finite bifix code $X$ on the alphabet $A$ is $F$-maximal of $F$-degree $d$ if and only if it is the basis of a subgroup of index $d$ of the free group on $A$.

cs.DM↗
arXiv2015

Bifix codes and interval exchanges

We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval echange transformations is closed under maximal bifix decoding.

math.CO↗
arXiv2014

A d-dimensional extension of Christoffel words

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. Due to periodicity, the $d$-dimensional Christoffel graph can be embedded in a $(d-1)$-torus (a parallelogram when $d=3$). We show that Christoffel graphs have similar properties to those of Christoffel words: symmetry of their central part and conjugation with their reversal. Our main result extends Pirillo's theorem (characterization of Christoffel words which asserts that a word $amb$ is a Christoffel word if and only if it is conjugate to $bma$) in arbitrary dimension. In the generalization, the map $amb\mapsto bma$ is seen as a flip operation on graphs embedded in $\mathbb{Z}^d$ and the conjugation is a translation. We show that a fully periodic subgraph of the hypercubic lattice is a translate of its flip if and only if it is a Christoffel graph.

cs.DM↗
arXiv2013

Notes on sets of first return

We prove in this note that, for an alphabet with three letters, the set of first return to a given word in a set satisfying the tree condition is a basis of the free group.

math.CO↗
arXiv2013

The Reciprocal of $\sum_{n\geq 0}a^nb^n$ for non-commuting $a$ and $b$, Catalan numbers and non-commutative quadratic equations

The aim of this paper is to describe the inversion of the sum $\sum_{n\geq 0}a^nb^n$ where $a$ and $b$ are non-commuting variables as a formal series in $a$ and $b$. We show that the inversion satisfies a non-commutative quadratic equation and that the number of certain monomials in its homogeneous components equals to a Catalan number. We also study general solutions of similar quadratic equations.

math.CO↗
arXiv2012

Linearly recursive sequences and Dynkin diagrams

Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze}; these sequences are given by nonlinear recursions (with division), and the fact that they are integers is a consequence of the Laurent phenomenon of Fomin and Zelevinsky. If the sequences satisfy a linear recursion with constant coefficients, then the graph must be a Dynkin diagram or an extended Dynkin diagram, with an acyclic orientation. The converse also holds: the sequences of the frieze associated to an oriented Dynkin or Euclidean diagram satisfy linear recursions, and are even $\mathbb N$-rational. One uses in the proof objects called $SL_2$-{\em tilings of the plane}, which are fillings of the discrete plane such that each adjacent 2 by 2 minor is equal to 1. These objects, which have applications in the theory of cluster algebras, are interesting for themselves. Some problems, conjectures and exercises are given.

math.NT↗
arXiv2011

Bifix codes and Sturmian words

We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes maximal in a recurrent set $F$ of words ($F$-maximal bifix codes). In the case of bifix codes contained in Sturmian sets of words, we obtain several new results. Let $F$ be a Sturmian set of words, defined as the set of factors of a strict episturmian word. Our results express the fact that an $F$-maximal bifix code of degree $d$ behaves just as the set of words of $F$ of length $d$. An $F$-maximal bifix code of degree $d$ in a Sturmian set of words on an alphabet with $k$ letters has $(k-1)d+1$ elements. This generalizes the fact that a Sturmian set contains $(k-1)d+1$ words of length $d$. Moreover, given an infinite word $x$, if there is a finite maximal bifix code $X$ of degree $d$ such that $x$ has at most $d$ factors of length $d$ in $X$, then $x$ is ultimately periodic. Our main result states that any $F$-maximal bifix code of degree $d$ on the alphabet $A$ is the basis of a subgroup of index $d$ of the free group on~$A$.

math.CO↗
arXiv2010

On the superimposition of Christoffel words

Initially stated in terms of Beatty sequences, the Fraenkel conjecture can be reformulated as follows: for a $k$-letter alphabet A, with a fixed $k \geq 3$, there exists a unique balanced infinite word, up to letter permutations and shifts, that has mutually distinct letter frequencies. Motivated by the Fraenkel conjecture, we study in this paper whether two Christoffel words can be superimposed. Following from previous works on this conjecture using Beatty sequences, we give a necessary and sufficient condition for the superimposition of two Christoffel words having same length, and more generally, of two arbitrary Christoffel words. Moreover, for any two superimposable Christoffel words, we give the number of different possible superimpositions and we prove that there exists a superimposition that works for any two superimposable Christoffel words. Finally, some new properties of Christoffel words are obtained as well as a geometric proof of a classic result concerning the money problem, using Christoffel words.

math.CO↗
arXiv2010

$SL_k$-Tiling of the Plane

We study properties of (bi-infinite) arrays having all adjacent $k\times k$ adjacent minors equal to one. If we further add the condition that all adjacent $(k-1)\times (k-1)$ minors be nonzero, then these arrays are necessarily of rank $k$. It follows that we can explicit construct all of them. Several nice properties are made apparent. In particular, we revisit, with this perspective, the notion of frieze patterns of Coxeter. This shed new light on their properties. A connexion is also established with the notion of $T$-systems of Statistical Physics.

math.CO↗
arXiv2009

Frises

Each acyclic graph, and more generally, each acyclic orientation of the graph associated to a Cartan matrix, allows to define a so-called frise; this is a collection of sequences over the positive natural numbers, one for each vertex of the graph. We prove that if these sequences satisfy a linear recurrence, then the Cartan matrix is of Dynkin type (if the sequences are bounded) or of Euclidean type (if the sequences are unbounded). We prove the converse in all cases, except for the exceptional Euclidean Cartan matrices; we show even that the sequences are rational over the positive natural numbers. We generalize these results by considering frises with variables; as a byproduct we obtain, for the Dynkin and Euclidean type A cases, explicit formulas for the cluster variables, over the semiring of Laurent polynomials over the positive natural numbers generated by the initial variables (which explains simultaneously positivity and the Laurent phenomenon). The general tool are the so-called SL_2-tilings of the plane; these are fillings of the whole discrete plane by elements of a ring, in such a way that each 2 by 2 connected submatrix is of determinant 1.

math.RA↗